Searcharxiv⌕ Search

arXiv subjects

Oleksandr Borysenko

Publications and source records attributed to Oleksandr Borysenko.

5 recordsLinked to original sources

Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm

A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently. In this study, we employ the Langevin equation with a QNG stochastic force to demonstrate that its discrete-time solution gives a generalized form of the above-specified algorithm, which we call Momentum-QNG. Similar to other optimization algorithms with the momentum term, such as the Stochastic Gradient Descent with momentum, RMSProp with momentum and Adam, Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space and, therefore, demonstrates an improved performance compared to the basic QNG. In this paper we benchmark Momentum-QNG together with the basic QNG, Adam and Momentum optimizers and explore its convergence behaviour. Among the benchmarking problems studied, the best result is obtained for the quantum Sherrington-Kirkpatrick model in the strong spin glass regime. Our open-source code is available at https://github.com/borbysh/Momentum-QNG

quant-ph↗

Long-time dynamics of a stochastic density dependent predator-prey model with Holling II functional response and jumps

The existence and uniqueness of a global positive solution is proven for the system of stochastic differential equations describing a nonautonomous stochastic density dependent predator-prey model with Holling-type II functional response disturbed by white noise, centered and non-centered Poisson noises. Sufficient conditions are obtained for stochastic ultimate boundedness, stochastic permanence, non-persistence in the mean, weak persistence in the mean and extinction of a population densities in the considered stochastic predator-prey model.

math.PR↗

CoolMomentum: A Method for Stochastic Optimization by Langevin Dynamics with Simulated Annealing

Deep learning applications require global optimization of non-convex objective functions, which have multiple local minima. The same problem is often found in physical simulations and may be resolved by the methods of Langevin dynamics with Simulated Annealing, which is a well-established approach for minimization of many-particle potentials. This analogy provides useful insights for non-convex stochastic optimization in machine learning. Here we find that integration of the discretized Langevin equation gives a coordinate updating rule equivalent to the famous Momentum optimization algorithm. As a main result, we show that a gradual decrease of the momentum coefficient from the initial value close to unity until zero is equivalent to application of Simulated Annealing or slow cooling, in physical terms. Making use of this novel approach, we propose CoolMomentum -- a new stochastic optimization method. Applying Coolmomentum to optimization of Resnet-20 on Cifar-10 dataset and Efficientnet-B0 on Imagenet, we demonstrate that it is able to achieve high accuracies.

stat.ML↗

Long-time behavior of a non-autonomous stochastic predator-prey model with jumps

It is proved the existence and uniqueness of the global positive solution to the system of stochastic differential equations describing a non-autonomous stochastic predator-prey model with a modified version of Leslie-Gower and Holling-type II functional response disturbed by white noise, centered and non-centered Poisson noises. We obtain sufficient conditions of stochastic ultimate boundedness, stochastic permanence, non-persistence in the mean, weak persistence in the mean, and extinction of the solution to the considered system.

math.PR↗

Stochastic two-species mutualism model with jumps

The existence and uniqueness are proved for the global positive solution to the system of stochastic differential equations describing a two-species mutualism model disturbed by the white noise, the centered and non-centered Poisson noises. We obtain sufficient conditions for stochastic ultimate boundedness, stochastic permanence, nonpersistence in the mean, strong persistence in the mean and extinction of the solution to the considered system.

math.PR↗