Related papers: Convergence analysis for minimum action methods co…
In this work, we address the convergence of a finite element approximation of the minimizer of the Freidlin-Wentzell (F-W) action functional for non-gradient dynamical systems perturbed by small noise. The F-W theory of large deviations is…
The minimum action method (MAM) is to calculate the most probable transition path in randomly perturbed stochastic dynamics, based on the idea of action minimization in the path space. The accuracy of the numerical path between different…
A method is presented to compute minimizers (instantons) of action functionals using arclength parametrization of Hamilton's equations. This method can be interpreted as a local variant of the geometric minimum action method (gMAM)…
Using the geometric minimum action method, we compute minimizers of the Freidlin-Wentzell functional for the dissipative linear and nonlinear Schroedinger equation. For the particular case of transitions between solitary waves of different…
We apply a numerical minimum action method derived from the Wentzell-Freidlin theory of large deviations to the Kardar-Parisi-Zhang equation for a growing interface. In one dimension we find that the switching scenario is determined by the…
This paper presents the convergence analysis of the spatial finite difference method (FDM) for the stochastic Cahn--Hilliard equation with Lipschitz nonlinearity and multiplicative noise. Based on fine estimates of the discrete Green…
The alternating minimization (AM) method is a fundamental method for minimizing convex functions whose variable consists of two blocks. How to efficiently solve each subproblems when applying the AM method is the most concerned task. In…
We develop a divergence-minimization (DM) framework for robust and efficient inference in latent-mixture models. By optimizing a residual-adjusted divergence, the DM approach recovers EM as a special case and yields robust alternatives…
This paper introduces the Fej\'er-monotone hybrid steepest descent method (FM-HSDM), a new member to the HSDM family of algorithms, for solving affinely constrained minimization tasks in real Hilbert spaces, where convex smooth and…
This paper considers a class of structured fractional minimization problems. The numerator consists of a differentiable function, a simple nonconvex nonsmooth function, a concave nonsmooth function, and a convex nonsmooth function composed…
Minimizing finite sums of functions is a central problem in optimization, arising in numerous practical applications. Such problems are commonly addressed using first-order optimization methods. However, these procedures cannot be used in…
Fine-grained action recognition is attracting increasing attention due to the emerging demand of specific action understanding in real-world applications, whereas the data of rare fine-grained categories is very limited. Therefore, we…
We consider the problem of finding the minimizer of a convex function $F: \mathbb R^d \rightarrow \mathbb R$ of the form $F(w) := \sum_{i=1}^n f_i(w) + R(w)$ where a low-rank factorization of $\nabla^2 f_i(w)$ is readily available. We…
This paper is devoted to the numerical analysis of a fully discrete finite element approximation for the stochastic Benjamin-Bona-Mahony equation driven by multiplicative noise. We first establish the existence and uniqueness of solutions…
A common approach for minimizing a smooth nonlinear function is to employ finite-difference approximations to the gradient. While this can be easily performed when no error is present within the function evaluations, when the function is…
The stochastic composition optimization proposed recently by Wang et al. [2014] minimizes the objective with the compositional expectation form: $\min_x~(\mathbb{E}_iF_i \circ \mathbb{E}_j G_j)(x).$ It summarizes many important applications…
Predicting the occurence of rare and extreme events in complex systems is a well-known problem in non-equilibrium physics. These events can have huge impacts on human societies. New approaches have emerged in the last ten years, which…
We present a numerical method for solving the Monge-Ampere equation based on the characterization of the solution of the Dirichlet problem as the minimizer of a convex functional of the gradient and under convexity and nonlinear…
The Homotopy Analysis Method (HAM) is a powerful technique which allows to derive approximate solutions of both ordinary and partial differential equations. We propose to use a variational approach based on the Least Action Principle (LAP)…
We pose the approximation problem for scalar nonnegative input-output systems via impulse response convolutions of finite order, i.e. finite order moving averages, based on repeated observations of input/output signal pairs. The problem is…