Transitions in a genetic transcriptional regulatory system under Lévy motion

Based on a stochastic differential equation model for a single genetic regulatory system, we examine the dynamical effects of noisy fluctuations, arising in the synthesis reaction, on the evolution of the transcription factor activator in terms of its concentration. The fluctuations are modeled by Brownian motion and α-stable Lévy motion. Two deterministic quantities, the mean first exit time (MFET) and the first escape probability (FEP), are used to analyse the transitions from the low to high concentration states. A shorter MFET or higher FEP in the low concentration region facilitates such a transition. We have observed that higher noise intensities and larger jumps of the Lévy motion shortens the MFET and thus benefits transitions. The Lévy motion activates a transition from the low concentration region to the non-adjacent high concentration region, while Brownian motion can not induce this phenomenon. There are optimal proportions of Gaussian and non-Gaussian noises, which maximise the quantities MFET and FEP for each concentration, when the total sum of noise intensities are kept constant. Because a weaker stability indicates a higher transition probability, a new geometric concept is introduced to quantify the basin stability of the low concentration region, characterised by the escaping behaviour

Cutoff Thermalization for Ornstein-Uhlenbeck Systems with Small Levy Noise in the Wasserstein Distance : Cutoff Thermalization for Ornstein–Uhlenbeck Systems...

This article establishes cutoff thermalization (also known as the cutoff phenomenon) for a class of generalized Ornstein-Uhlenbeck systems with small additive Lévy noise and any nonzero initial value.Peer reviewe

First-passage properties of asymmetric Lévy flights

Lévy flights are paradigmatic generalised random walk processes, in which the independent stationary increments—the 'jump lengths'—are drawn from an -stable jump length distribution with long-tailed, power-law asymptote. As a result, the variance of Lévy flights diverges and the trajectory is characterised by occasional extremely long jumps. Such long jumps significantly decrease the probability to revisit previous points of visitation, rendering Lévy flights efficient search processes in one and two dimensions. To further quantify their precise property as random search strategies we here study the first-passage time properties of Lévy flights in one-dimensional semi-infinite and bounded domains for symmetric and asymmetric jump length distributions. To obtain the full probability density function of first-passage times for these cases we employ two complementary methods. One approach is based on the space-fractional diffusion equation for the probability density function, from which the survival probability is obtained for different values of the stable index and the skewness (asymmetry) parameter . The other approach is based on the stochastic Langevin equation with -stable driving noise. Both methods have their advantages and disadvantages for explicit calculations and numerical evaluation, and the complementary approach involving both methods will be profitable for concrete applications. We also make use of the Skorokhod theorem for processes with independent increments and demonstrate that the numerical results are in good agreement with the analytical expressions for the probability density function of the first-passage times

Estimating expected first passage times using multilevel Monte Carlo algorithm

In this paper we devise a method of numerically estimating the expected first passage times of stochastic processes. We use Monte Carlo path simulations with Milstein discretisation scheme to approximate the solutions of scalar stochastic differential equations. To further reduce the variance of the estimated expected stopping time and improve computational efficiency, we use the multi-level Monte Carlo algorithm, recently developed by Giles (2008a), and other variance-reduction techniques. Our numerical results show significant improvements over conventional Monte Carlo techniques

Adai: Separating the Effects of Adaptive Learning Rate and Momentum Inertia

Adaptive Momentum Estimation (Adam), which combines Adaptive Learning Rate and Momentum, is the most popular stochastic optimizer for accelerating the training of deep neural networks. However, empirically Adam often generalizes worse than Stochastic Gradient Descent (SGD). We unveil the mystery of this behavior based on the diffusion theoretical framework. Specifically, we disentangle the effects of Adaptive Learning Rate and Momentum of the Adam dynamics on saddle-point escaping and minima selection. We prove that Adaptive Learning Rate can escape saddle points efficiently, but cannot select flat minima as SGD does. In contrast, Momentum provides a drift effect to help the training process pass through saddle points, and almost does not affect flat minima selection. This theoretically explains why SGD (with Momentum) generalizes better, while Adam generalizes worse but converges faster. Furthermore, motivated by the analysis, we design a novel adaptive optimization framework named Adaptive Inertia, which uses parameter-wise adaptive inertia to accelerate the training and provably favors flat minima as well as SGD. Our extensive experiments demonstrate that the proposed adaptive inertia method can generalize significantly better than SGD and conventional adaptive gradient methods.Comment: 28 pages, 11 figures, Adam, Adaptive Inerti