InfoDiffusion: Information Entropy Aware Diffusion Process for Non-Autoregressive Text Generation

Diffusion models have garnered considerable interest in the field of text generation. Several studies have explored text diffusion models with different structures and applied them to various tasks, including named entity recognition and summarization. However, there exists a notable disparity between the "easy-first" text generation process of current diffusion models and the "keyword-first" natural text generation process of humans, which has received limited attention. To bridge this gap, we propose InfoDiffusion, a non-autoregressive text diffusion model. Our approach introduces a "keyinfo-first" generation strategy and incorporates a noise schedule based on the amount of text information. In addition, InfoDiffusion combines self-conditioning with a newly proposed partially noising model structure. Experimental results show that InfoDiffusion outperforms the baseline model in terms of generation quality and diversity, as well as exhibiting higher sampling efficiency.Comment: EMNLP 2023 Finding

A Data-Driven Evolutionary Transfer Optimization for Expensive Problems in Dynamic Environments

Many real-world problems are usually computationally costly and the objective functions evolve over time. Data-driven, a.k.a. surrogate-assisted, evolutionary optimization has been recognized as an effective approach for tackling expensive black-box optimization problems in a static environment whereas it has rarely been studied under dynamic environments. This paper proposes a simple but effective transfer learning framework to empower data-driven evolutionary optimization to solve dynamic optimization problems. Specifically, it applies a hierarchical multi-output Gaussian process to capture the correlation between data collected from different time steps with a linearly increased number of hyperparameters. Furthermore, an adaptive source task selection along with a bespoke warm staring initialization mechanisms are proposed to better leverage the knowledge extracted from previous optimization exercises. By doing so, the data-driven evolutionary optimization can jump start the optimization in the new environment with a strictly limited computational budget. Experiments on synthetic benchmark test problems and a real-world case study demonstrate the effectiveness of our proposed algorithm against nine state-of-the-art peer algorithms

Interactive Decomposition Multi-Objective Optimization via Progressively Learned Value Functions

Decomposition has become an increasingly popular technique for evolutionary multi-objective optimization (EMO). A decomposition-based EMO algorithm is usually designed to approximate a whole Pareto-optimal front (PF). However, in practice, the decision maker (DM) might only be interested in her/his region of interest (ROI), i.e., a part of the PF. Solutions outside that might be useless or even noisy to the decision-making procedure. Furthermore, there is no guarantee to find the preferred solutions when tackling many-objective problems. This paper develops an interactive framework for the decomposition-based EMO algorithm to lead a DM to the preferred solutions of her/his choice. It consists of three modules, i.e., consultation, preference elicitation and optimization. Specifically, after every several generations, the DM is asked to score a few candidate solutions in a consultation session. Thereafter, an approximated value function, which models the DM's preference information, is progressively learned from the DM's behavior. In the preference elicitation session, the preference information learned in the consultation module is translated into the form that can be used in a decomposition-based EMO algorithm, i.e., a set of reference points that are biased toward to the ROI. The optimization module, which can be any decomposition-based EMO algorithm in principle, utilizes the biased reference points to direct its search process. Extensive experiments on benchmark problems with three to ten objectives fully demonstrate the effectiveness of our proposed method for finding the DM's preferred solutions.Comment: 25 pages, 18 figures, 3 table

Dynamic Multi-Objectives Optimization with a Changing Number of Objectives

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Existing studies on dynamic multiobjective optimization (DMO) focus on problems with time-dependent objective functions, while the ones with a changing number of objectives have rarely been considered in the literature. Instead of changing the shape or position of the Pareto-optimal front/set (PF/PS) when having time-dependent objective functions, increasing or decreasing the number of objectives usually leads to the expansion or contraction of the dimension of the PF/PS manifold. Unfortunately, most existing dynamic handling techniques can hardly be adapted to this type of dynamics. In this paper, we report our attempt toward tackling the DMO problems with a changing number of objectives. We implement a dynamic two-archive evolutionary algorithm which maintains two co-evolving populations simultaneously. In particular, these two populations are complementary to each other: one concerns more about the convergence while the other concerns more about the diversity. The compositions of these two populations are adaptively reconstructed once the environment changes. In addition, these two populations interact with each other via a mating selection mechanism. Comprehensive experiments are conducted on various benchmark problems with a time-dependent number of objectives. Empirical results fully demonstrate the effectiveness of our proposed algorithm.Engineering and Physical Sciences Research Council (EPSRC)NSF

Equal Force Recovery in Dysferlin-Deficient and Wild-Type Muscles Following Saponin Exposure

Dysferlin plays an important role in repairing membrane damage elicited by laser irradiation, and dysferlin deficiency causes muscular dystrophy and associated cardiomyopathy. Proteins such as perforin, complement component C9, and bacteria-derived cytolysins, as well as the natural detergent saponin, can form large pores on the cell membrane via complexation with cholesterol. However, it is not clear whether dysferlin plays a role in repairing membrane damage induced by pore-forming reagents. In this study, we observed that dysferlin-deficient muscles recovered the tetanic force production to the same extent as their WT counterparts following a 5-min saponin exposure (50 μg/mL). Interestingly, the slow soleus muscles recovered significantly better than the fast extensor digitorum longus (EDL) muscles. Our data suggest that dysferlin is unlikely involved in repairing saponin-induced membrane damage and that the slow muscle is more efficient than the fast muscle in repairing such damage

Brain glucose metabolism is associated with hormone level in Cushing's disease: A voxel-based study using FDG-PET

AbstractChronic exposure to elevated levels of glucocorticoids can exert a neurotoxic effect in patients, possibly manifesting as molecular imaging alterations in patients. The aim of this study was to investigate the potential association between brain metabolism and elevated hormone level using 18F-fluorodeoxyglucose positron emission tomography. We retrospectively enrolled 92 consecutive patients with confirmed diagnosis of Cushing's disease. A voxel-based analysis was performed to investigate the association between cerebral 18F-fluorodeoxyglucose uptake and serum cortisol level. Relatively impaired metabolism of specific brain regions correlated with serum cortisol level was found. Specifically, notable correlations were found in the hippocampus, amygdala, and cerebellum, regions considered to be involved in the regulation and central action of glucocorticoids. Moreover, some hormone-associated regions were found in the frontal and occipital cortex, possibly mediating the cognitive changes seen in Cushing's disease. Our findings link patterns of perturbed brain metabolism relates to individual hormone level, thus presenting a substrate for cognitive disturbances seen in Cushing's disease patients, as well as in other conditions with abnormal cortisol levels

Integration of Preferences in Decomposition Multiobjective Optimization

This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.© 2018 IEEE. Rather than a whole Pareto-optimal front, which demands too many points (especially in a high-dimensional space), the decision maker (DM) may only be interested in a partial region, called the region of interest (ROI). In this case, solutions outside this region can be noisy to the decision-making procedure. Even worse, there is no guarantee that we can find the preferred solutions when tackling problems with complicated properties or many objectives. In this paper, we develop a systematic way to incorporate the DM's preference information into the decomposition-based evolutionary multiobjective optimization methods. Generally speaking, our basic idea is a nonuniform mapping scheme by which the originally evenly distributed reference points on a canonical simplex can be mapped to new positions close to the aspiration-level vector supplied by the DM. By this means, we are able to steer the search process toward the ROI either directly or interactively and also handle many objectives. Meanwhile, solutions lying on the boundary can be approximated as well given the DM's requirements. Furthermore, the extent of the ROI is intuitively understandable and controllable in a closed form. Extensive experiments on a variety of benchmark problems with 2 to 10 objectives, fully demonstrate the effectiveness of our proposed method for approximating the preferred solutions in the ROI.Royal Society (Government)Ministry of Science and Technology of ChinaScience and Technology Innovation Committee Foundation of ShenzhenShenzhen Peacock PlanEngineering and Physical Sciences Research Council (EPSRC)Engineering and Physical Sciences Research Council (EPSRC