Negatively Correlated Search

Evolutionary Algorithms (EAs) have been shown to be powerful tools for complex optimization problems, which are ubiquitous in both communication and big data analytics. This paper presents a new EA, namely Negatively Correlated Search (NCS), which maintains multiple individual search processes in parallel and models the search behaviors of individual search processes as probability distributions. NCS explicitly promotes negatively correlated search behaviors by encouraging differences among the probability distributions (search behaviors). By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, which makes NCS a promising method for non-convex optimization. The cooperation scheme of NCS could also be regarded as a novel diversity preservation scheme that, different from other existing schemes, directly promotes diversity at the level of search behaviors rather than merely trying to maintain diversity among candidate solutions. Empirical studies showed that NCS is competitive to well-established search methods in the sense that NCS achieved the best overall performance on 20 multimodal (non-convex) continuous optimization problems. The advantages of NCS over state-of-the-art approaches are also demonstrated with a case study on the synthesis of unequally spaced linear antenna arrays

High-dimensional Black-box Optimization via Divide and Approximate Conquer

Divide and Conquer (DC) is conceptually well suited to high-dimensional optimization by decomposing a problem into multiple small-scale sub-problems. However, appealing performance can be seldom observed when the sub-problems are interdependent. This paper suggests that the major difficulty of tackling interdependent sub-problems lies in the precise evaluation of a partial solution (to a sub-problem), which can be overwhelmingly costly and thus makes sub-problems non-trivial to conquer. Thus, we propose an approximation approach, named Divide and Approximate Conquer (DAC), which reduces the cost of partial solution evaluation from exponential time to polynomial time. Meanwhile, the convergence to the global optimum (of the original problem) is still guaranteed. The effectiveness of DAC is demonstrated empirically on two sets of non-separable high-dimensional problems.Comment: 7 pages, 2 figures, conferenc

A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization

Large-scale optimization problems that involve thousands of decision variables have extensively arisen from various industrial areas. As a powerful optimization tool for many real-world applications, evolutionary algorithms (EAs) fail to solve the emerging large-scale problems both effectively and efficiently. In this paper, we propose a novel Divide-and-Conquer (DC) based EA that can not only produce high-quality solution by solving sub-problems separately, but also highly utilizes the power of parallel computing by solving the sub-problems simultaneously. Existing DC-based EAs that were deemed to enjoy the same advantages of the proposed algorithm, are shown to be practically incompatible with the parallel computing scheme, unless some trade-offs are made by compromising the solution quality.Comment: 12 pages, 0 figure

Integrated fault estimation and accommodation design for discrete-time Takagi-Sugeno fuzzy systems with actuator faults

This paper addresses the problem of integrated robust fault estimation (FE) and accommodation for discrete-time Takagi–Sugeno (T–S) fuzzy systems. First, a multiconstrained reduced-order FE observer (RFEO) is proposed to achieve FE for discrete-time T–S fuzzy models with actuator faults. Based on the RFEO, a new fault estimator is constructed. Then, using the information of online FE, a new approach for fault accommodation based on fuzzy-dynamic output feedback is designed to compensate for the effect of faults by stabilizing the closed-loop systems. Moreover, the RFEO and the dynamic output feedback fault-tolerant controller are designed separately, such that their design parameters can be calculated readily. Simulation results are presented to illustrate our contributions

Tensor stability in Born-Infeld determinantal gravity

We consider the transverse-traceless tensor perturbation of a spatial flat homogeneous and isotropic spacetime in Born-Infeld determinantal gravity, and investigate the evolution of the tensor mode for two solutions in the early universe. For the first solution where the initial singularity is replaced by a regular geometric de Sitter inflation of infinite duration, the evolution of the tensor mode is stable for the parameter spaces $\alpha<-1$, $\omega\geq-1/3$ and $\alpha=-1$, $\omega>0$. For the second solution where the initial singularity is replaced by a primordial brusque bounce, which suffers a sudden singularity at the bouncing point, the evolution of the tensor mode is stable for all regions of the parameter space. Our calculation suggests that the tensor evolution can hold stability in large parameter spaces, which is a remarkable property of Born-Infeld determinantal gravity. We also constrain the theoretical parameter $|\lambda|\geq 10^{-38} \text{m}^{-2}$ by resorting to the current bound on the speed of the gravitational waves.Comment: 14 pages, added a general discussion on the tensor stability in Sec. 3, and added Sec. 5 on the parameter constraint, published versio

Structural Deep Embedding for Hyper-Networks

Network embedding has recently attracted lots of attentions in data mining. Existing network embedding methods mainly focus on networks with pairwise relationships. In real world, however, the relationships among data points could go beyond pairwise, i.e., three or more objects are involved in each relationship represented by a hyperedge, thus forming hyper-networks. These hyper-networks pose great challenges to existing network embedding methods when the hyperedges are indecomposable, that is to say, any subset of nodes in a hyperedge cannot form another hyperedge. These indecomposable hyperedges are especially common in heterogeneous networks. In this paper, we propose a novel Deep Hyper-Network Embedding (DHNE) model to embed hyper-networks with indecomposable hyperedges. More specifically, we theoretically prove that any linear similarity metric in embedding space commonly used in existing methods cannot maintain the indecomposibility property in hyper-networks, and thus propose a new deep model to realize a non-linear tuplewise similarity function while preserving both local and global proximities in the formed embedding space. We conduct extensive experiments on four different types of hyper-networks, including a GPS network, an online social network, a drug network and a semantic network. The empirical results demonstrate that our method can significantly and consistently outperform the state-of-the-art algorithms.Comment: Accepted by AAAI 1