相关论文: Global optimization using L\'evy flights

L\'evy walk process is one of the most effective models to describe superdiffusion, which underlies some important movement patterns and has been widely observed in the micro and macro dynamics. From the perspective of random walk theory,…

The L\'evy flight foraging hypothesis states that organisms must have evolved adaptations to exploit L\'evy walk search strategies. Indeed, it is widely accepted that inverse square L\'evy walks optimize the search efficiency in foraging…

We present a global optimization routine for the variational quantum algorithms, which utilizes the dynamic tunneling flow. Originally designed to leverage information gathered by a gradient-based optimizer around local minima, we adapt the…

The equation with the time fractional substantial derivative and space fractional derivative describes the distribution of the functionals of the L\'evy flights; and the equation is derived as the macroscopic limit of the continuous time…

An Euler discretization of the Langevin diffusion is known to converge to the global minimizers of certain convex and non-convex optimization problems. We show that this property holds for any suitably smooth diffusion and that different…

Cooperation among individuals has been key to sustaining societies. However, natural selection favors defection over cooperation. Cooperation can be favored when the mobility of individuals allows cooperators to form a cluster (or group).…

A new technique of global optimization and its applications in particular to neural networks are presented. The algorithm is also compared to other global optimization algorithms such as Gradient descent (GD), Monte Carlo (MC), Genetic…

We present a new family of graphs with remarkable properties. They are obtained by connecting the points of a random walk when their distance is smaller than a given scale. Their degree (number of neighbors) does not depend on the graph's…

We solve a problem of non-convex stochastic optimisation with help of simulated annealing of Levy flights of a variable stability index. The search of the ground state of an unknown potential is non-local due to big jumps of the Levy…

Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of L\'evy walks, a specific range of optimal efficiencies was suggested under variation of search…

The paper proves convergence to global optima for a class of distributed algorithms for nonconvex optimization in network-based multi-agent settings. Agents are permitted to communicate over a time-varying undirected graph. Each agent is…

L\'evy walks (LWs) are spatiotemporally coupled random-walk processes describing superdiffusive heat conduction in solids, propagation of light in disordered optical materials, motion of molecular motors in living cells, or motion of…

Differentiable simulation is a promising toolkit for fast gradient-based policy optimization and system identification. However, existing approaches to differentiable simulation have largely tackled scenarios where obtaining smooth…

What is the most efficient search strategy for the random located target sites subject to the physical and biological constraints? Previous results suggested the L\'evy flight is the best option to characterize this optimal problem,…

This book chapter introduces to the problem to which extent search strategies of foraging biological organisms can be identified by statistical data analysis and mathematical modeling. A famous paradigm in this field is the Levy Flight…

In this paper we address the problem of rare-event simulation for heavy-tailed L\'evy processes with infinite activities. We propose a strongly efficient importance sampling algorithm that builds upon the sample path large deviations for…

We present GLASSES: Global optimisation with Look-Ahead through Stochastic Simulation and Expected-loss Search. The majority of global optimisation approaches in use are myopic, in only considering the impact of the next function value; the…

We study the efficiency of search processes based on Levy flights (LFs) with power-law distributed jump lengths in the presence of an external drift. While LFs turn out to be efficient search processes when relative to the starting point…

To solve the Unmanned Aerial Vehicle (UAV) path planning problem, a meta-heuristic optimization algorithm called competitive game optimizer (CGO) is proposed. In the CGO model, three phases of exploration and exploitation, and candidate…

This paper presents a new complex optimization problem in the field of automatic design of advanced industrial systems and proposes a hybrid optimization approach to solve the problem. The problem is multi-objective as it aims at finding…