Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

213426639852 · Jun 202019922001200920172026
48 results for stochastic Lyapunov functions

Study on convergence of SDEs using entropy methods.

problem Analyzing convergence of stochastic differential equations.
method Applied Lyapunov method to Fokker-Planck equation with weighted relative Fisher information.
result Exponential convergence of probability density function to invariant distribution in L1L_1 distance.

Unified analysis of stochastic iterative algorithms using Lyapunov functions.

problem Analyzing convergence of stochastic iterative algorithms for fixed-point equations.
method Lyapunov-based techniques for finite-time analysis of stochastic approximation algorithms.
result Unified mean-square convergence guarantees for various algorithms.

The paper guarantees global stability for stochastic subgradient methods in nonsmooth nonconvex optimization.

problem Minimizing nonsmooth nonconvex functions with convergence guarantees.
method Developed a framework for stochastic subgradient methods with global stability guarantees.
result Iterates are uniformly bounded and asymptotically stabilize around the stable set of the differential inclusion.

Study on convergence rates of degenerate SDEs using Fisher information and generalized Bochner's formula.

problem Analysis of dynamical behaviors of degenerate stochastic differential equations.
method Use of Fisher information as Lyapunov functional, generalized Gamma calculus, and generalized Bochner's formula.
result Derivation of convergence rate conditions and examples in specific sub-Riemannian structures.

Paper analyzes biased stochastic approximation with a novel multistep Lyapunov function.

problem Finite-time analysis of biased stochastic approximation algorithms.
method Developed a multistep Lyapunov function to analyze convergence and error bounds.
result First finite-time error bounds for TD- and Q-learning with linear function approximation.

Short note on soft-max and policy gradients in bandit problems using Lyapunov functions.

problem Analyzing soft-max and policy gradient methods in bandit problems.
method Lyapunov function argument for soft-max and differential equations for policy gradient algorithms.
result Regret bounds for soft-max and a different policy gradient algorithm in bandit problems.

Paper analyzes SA for fixed-point equations with noise, establishing convergence rates.

problem Solving fixed-point equations with noisy data.
method Uses smooth convex envelopes to construct Lyapunov functions and show negative drift.
result Establishes first-known convergence rate for V-trace algorithm in RL.

Overview of non-stochastic-gradient SA algorithms in signal processing and ML.

problem Dealing with large data sets and uncertainties in signal processing and machine learning.
method General framework of SA algorithms using Lyapunov functions.
result Unified convergence properties of non-stochastic-gradient algorithms.

Finite-time bounds on error for linear stochastic approximation and TD learning.

problem Finite-time bounds on error for linear stochastic approximation and TD learning.
method Finite-time bounds derived using Lyapunov functions and Stein's method.
result Finite-time bounds on the moments of the error, including lower-order and higher-order moments.

Paper proves convergence of SA algorithm via martingale and converse Lyapunov methods.

problem Proves convergence of stochastic approximation algorithm.
method Uses martingale and converse Lyapunov methods to prove convergence.
result Provides alternate proof of convergence for SA algorithm.

The paper analyzes convergence of Langevin dynamics with time-dependent metrics.

problem Analyzing convergence of Langevin dynamics with time-dependent metrics.
method Formulated a modified gradient flow of the Kullback-Leibler divergence, selected a time-dependent relative Fisher information functional, and developed a time-dependent Hessian matrix condition.
result Proved convergence conditions for various Langevin dynamics.

Investigates optimal consumption and investment strategies with constraints in incomplete markets.

problem Optimal consumption and investment under constraints in incomplete markets.
method Characterizes optimal strategies via a quadratic BSDE, using martingale optimality criterion and Lyapunov functions.
result Obtains the verification theorem for optimal strategies in unbounded cases.

The paper refines optimization algorithms using Lyapunov functions and differential equations.

problem Improving convergence rates of optimization algorithms.
method Revisiting Fazylab's framework, relaxing conditions, and introducing new differential equations.
result Improved convergence rates for optimization algorithms, including Nesterov and Polyak algorithms.

Study mini-batch SGD noise and its limits, proving complexity guarantees.

problem Analyzing the noise in mini-batch SGD and its impact on optimization.
method Examined the conditional covariance and diffusion limits of SGD under different sampling designs.
result Proved mean-square upper bounds and Fisher van Trees lower bounds for SGD, linking them to effective dimension and condition number.

New analysis improves SGD for robust and quantile regression with sub-quadratic convergence.

problem Improving SGD for robust and quantile regression with sub-quadratic convergence.
method Piecewise Lyapunov function for first-order differentiable functions.
result First geometrical convergence result for sub-quadratic SGD.

In this paper, we consider the stochastic iterative counterpart of the value iteration scheme wherein only noisy and possibly biased approximations of the Bellman operator are available. We call this counterpart as the approximate value iteration (AVI) scheme. Neural networks are often used as function approximators, i…

2017-09-14abs ↗pdf ↗

This paper uses Gaussian Process and converse Lyapunov function to estimate power system ROA.

problem Estimating the region of attraction (ROA) for power systems with conservative and limited analytical methods.
method Combining converse Lyapunov theorem and Gaussian Process to estimate ROA without needing an analytic Lyapunov function.
result The approach can significantly enlarge the estimated ROA compared to analytical methods.

Operator calculus for population-based optimization provides a unified framework for analyzing convergence of various methods.

problem Convergence analysis of population-based optimization methods
method Introduce an operator calculus for describing composite mean-field algorithms as compositions of elementary operators acting on probability measures.
result Establish a modular Lyapunov principle for certifying exponential decay of state-space Lyapunov function and search errors.

Lyapunov's second theorem is an essential tool for stability analysis of differential equations. The paper provides an analog theorem for incremental stability analysis by lifting the Lyapunov function to the tangent bundle. The Lyapunov function endows the state-space with a Finsler structure. Incremental stability is…

2012-08-14abs ↗pdf ↗

New algorithm reduces regret and constraint violation in constrained bandit problems.

problem Optimizing under budget and stochastic constraints in resource-constrained settings.
method Lyapunov optimization methodology, tLyOn{ t LyOn} algorithm.
result Achieves O(KBlogB)O(\sqrt{K B\log B}) regret and zero constraint-violation for large BB.

The paper analyzes convergence of Riemannian SA schemes for stochastic optimization.

problem Stochastic optimization problems on Riemannian manifolds.
method Analyzes convergence of Riemannian stochastic approximation schemes using exponential map or retraction functions.
result Shows Riemannian SA schemes find an O(b+logn/n){\mathcal{O}}(b_\infty + \log n / \sqrt{n})-stationary point within O(n){\mathcal{O}}(n) iterations.

Unified framework for finite-sample RL algorithms using Lyapunov theory.

problem Finite-sample convergence guarantees of asynchronous RL algorithms.
method Reformulate RL algorithms as Markovian SA, develop Lyapunov analysis.
result Mean-square error bounds and convergence for various RL algorithms.

Functional portfolio generation, initiated by E.R. Fernholz almost twenty years ago, is a methodology for constructing trading strategies with controlled behavior. It is based on very weak and descriptive assumptions on the covariation structure of the underlying market model, and needs no estimation of model parameter…

2016-03-27abs ↗pdf ↗

Optimal algorithms for Riemannian optimization with reduced complexity.

problem Stochastic optimization on Riemannian manifolds with limited data.
method Zeroth-order Riemannian Averaging Stochastic Approximation algorithms using Riemannian moving-average estimators and novel geometric conditions.
result Achieves optimal sample complexities for generating approximate first-order stationary solutions.

Stabilizes complex systems using diffusion models trained on Lyapunov functions.

problem Generating stabilizing controllers for complex dynamical systems.
method Trains a diffusion model on pairs of asymptotically stable vector fields and their Lyapunov functions to identify the closest stable field and adjust control functions.
result Efficient and rapid stabilization of unseen systems, showcasing generalizability.

Improved reinforcement learning with adaptive learning rates.

problem Enhancing the convergence rate of reinforcement learning algorithms.
method Two time-scale linear stochastic approximation algorithms, using Lyapunov functions and adaptive learning rates.
result Adaptive learning rate scheme significantly improves convergence rate over fixed learning rates.

Maximal concentration bounds for stochastic approximation with heavy-tailed noise.

problem Analyzing the convergence of stochastic approximation algorithms under heavy-tailed Markovian noise.
method Novel Lyapunov function and black-box truncation argument.
result Tail behavior of the error can be sub-Gaussian, sub-Weibull, or lighter than any Pareto but heavier than any Weibull.

Double Q-learning has the same mean-squared error as Q-learning under certain conditions.

problem Comparing the mean-squared error of Double Q-learning and Q-learning.
method Theoretical analysis based on Lyapunov equations for both tabular and linear function approximation settings.
result The asymptotic mean-squared error of Double Q-learning is exactly equal to that of Q-learning under specific conditions.

Study the topology of stable vector fields and Lyapunov functions on R^n.

problem Topology of stable vector fields and Lyapunov functions on R^n.
method Differential topology, Lyapunov theory, and results on diffeomorphism groups of discs.
result Path-connected and simply connected spaces of stable vector fields for n≠4,5 and weakly contractible for n≤3.

New insights into using momentum for non-convex optimization.

problem Improving training of non-convex models like deep neural networks.
method Developed a Lyapunov analysis of SGD with momentum using stochastic primal averaging.
result Precise conditions under which SGD+M outperforms SGD and optimal hyper-parameter schedules.

According to Pixton, there are Morse-Smale diffeomorphisms of the 3-sphere which have no energy function, that is a Lyapunov function whose critical points are all periodic points of the diffeomorphism. We introduce the concept of quasi-energy function for a Morse-Smale diffeomorphism as a Lyapunov function with the le…

2008-10-23abs ↗pdf ↗

We describe, in the general setting of closed cone fields, the set of causal functions which can be approximated by smooth Lyapunov. We derive several consequences on causality theory. Dans le contexte général des champs de cones fermés, on décrit l'ensemble des fonctions causales qui peuvent être approchées par des fo…

2017-11-10abs ↗pdf ↗

Study on bias of constant-step stochastic approximation with Markovian noise.

problem Understanding the bias in stochastic approximation algorithms with Markovian noise.
method Infinitesimal generator comparisons to analyze bias, Lyapunov equation for time-averaged bias, Richardson-Romberg extrapolation for bias reduction.
result Bias of the algorithm is of order O(α)O(α) and time-averaged bias is αV+O(α2)αV + O(α^2), where VV is a constant.

New methods accelerate gradient descent for convex and strongly convex functions.

problem Improving convergence rates of gradient-based optimization methods.
method Formulated two classes of first-order algorithms with Lyapunov analyses and Hamiltonian assisted gradient method.
result Achieved accelerated convergence rates matching Nesterov's methods in strongly and general convex settings.

The paper analyzes convergence rates for stochastic approximation and reinforcement learning.

problem Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise.
method A novel Lyapunov drift construction that applies a Poisson-equation based correction for Markovian noise to the Moreau-envelope smoothing for contractive mappings.
result Almost sure convergence rates for specific learning rates are derived, with rates arbitrarily close to o(n12η)o(n^{1 - 2η}) and o(n1)o(n^{-1}).

We consider Lyapunov exponents for flat bundles over hyperbolic curves defined via parallel transport over the geodesic flow. We refine a lower bound obtained by Eskin, Kontsevich, Moeller and Zorich showing that the sum of the first k exponents is greater or equal than the sum of the degree of any rank k holomorphic s…

2018-10-30abs ↗pdf ↗

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.