We present a novel variation of the well-known infomax algorithm of blind source separation. Under natural gradient descent, the infomax algorithm converges to a stationary point of a limiting ordinary differential equation. However, due to the presence of saddle points or local minima of the corresponding likelihood function, the algorithm may be trapped around these bad stationary points for a long time, especially if the initial data are near them. To speed up convergence, we propose to add a sequence of random perturbations to the infomax algorithm to shake the iterating sequence so that it is captured by a path descending to a more stable stationary point. We analyze the convergence of the randomly perturbed algorithm, and illustrate its fast convergence through numerical examples on blind demixing of stochastic signals. The examples have analytical structures so that saddle points or local minima of the likelihood functions are explicit. The results may have implications for online learning algorithms in dissimilar problems.
We consider diffusivity of random walks with transition probabilities depending on the number of consecutive traversals of the last traversed edge, the so called senile reinforced random walk (SeRW). In one dimension, the walk is known to be sub-diffusive with identity reinforcement function. We perturb the model by introducing a small probability \delta of escaping the last traversed edge at each step. The perturbed SeRW model is diffusive for any \delta , with enhanced diffusivity (\delta ) in the small \delta regime. We further study stochastically perturbed SeRW models by having the last edge escape probability of the form \delta with \delta 's being independent random variables. Enhanced diffusivity in such models are logarithmically close to the so called residual diffusivity (positive in the zero \delta limit), with diffusivity between \delta and \delta . Finally, we generalize our results to higher dimensions where the unperturbed model is already diffusive. The enhanced diffusivity can be as much as \delta .
We study a system of semilinear hyperbolic equations passively advected by smooth white noise in time random velocity fields. Such a system arises in modelling non-premixed isothermal turbulent flames under single-step kinetics of fuel and oxidizer. We derive closed equations for one-point and multi-point probability distribution functions (PDFs) and closed-form analytical formulae for the one-point PDF function, as well as the two-point PDF function under homogeneity and isotropy. Exact solution formulae allow us to analyse the ensemble-averaged fuel/oxidizer concentrations and the motion of their level curves. We recover the empirical formulae of combustion in the thin reaction zone limit and show that these approximate formulae can either underestimate or overestimate average concentrations when the reaction zone is not tending to zero. We show that the averaged reaction rate slows down locally in
We study the enhanced diffusivity in the so called elephant random walk model with stops (ERWS) by including symmetric random walk steps at small probability \epsilon . At any \epsilon , the large time behavior transitions from sub-diffusive at \epsilon to diffusive in a wedge shaped parameter regime where the diffusivity is strictly above that in the un-perturbed ERWS model in the \epsilon limit. The perturbed ERWS model is shown to be solvable with the first two moments and their asymptotics calculated exactly in both one and two space dimensions. The model provides a discrete analytical setting of the residual diffusion phenomenon known for the passive scalar transport in chaotic flows (eg generated by time periodic cellular flows and statistically sub-diffusive) as molecular diffusivity tends to zero.