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.

168,742 papers · 148 categories

Trend · papers per month

316293124 · May 202619922001200920172026
48 results for Lyapunov equation

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.

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 ↗

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.

Uniformizes Hodge structures, proving Lyapunov exponents and log-Anosov monodromy.

problem Analyzing weight 3 variations of Hodge structures and their Lyapunov exponents.
method Developed uniformizations and used analytic properties to prove conjectures and properties of monodromy representations.
result Proved log-Anosov property and established strong Torelli theorem for the VHS.

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.

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.

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.

Refines geometric center of mass analysis for Einstein field equations.

problem Analyzing the geometric center of mass of Willmore surfaces in initial data for Einstein field equations.
method Refined Lyapunov-Schmidt analysis to study geometric center of mass of area-constrained Willmore surfaces.
result The geometric center of mass agrees with the Hamiltonian center of mass under specific conditions.

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.

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.

AROS uses Lyapunov-stabilized embeddings to improve out-of-distribution detection robustness against adversarial attacks.

problem Robust out-of-distribution (OOD) detection against adversarial attacks.
method Neural Ordinary Differential Equations (NODEs) with Lyapunov stability theory for generating robust embeddings.
result Improves robust detection performance significantly, e.g., from 37.8% to 80.1% on CIFAR-10 vs. CIFAR-100.

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.

Momentum speeds up evolutionary processes in machine learning.

problem Accelerating convergence in evolutionary dynamics.
method Combining momentum from machine learning with evolutionary dynamics using information divergences as Lyapunov functions.
result Momentum accelerates convergence of evolutionary dynamics, including the replicator equation and Euclidean gradient descent.

Unified framework for solving fixed-point equations in deterministic and stochastic settings.

problem Solving fixed-point equations for seminorm-contractive operators in both deterministic and stochastic contexts.
method Fixed-point theorem and stochastic approximation analysis.
result Unified finite-sample bounds for various reinforcement learning algorithms.

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.

A family of replicator-like dynamics, called the escort replicator equation, is constructed using information-geometric concepts and generalized information entropies and diverenges from statistical thermodynamics. Lyapunov functions and escort generalizations of basic concepts and constructions in evolutionary game th…

2009-11-09abs ↗pdf ↗

We study the asymptotic behavior of the Lyapunov exponent in a meromorphic family of random products of matrices in SL(2, C), as the parameter converges to a pole. We show that the blow-up of the Lyapunov exponent is governed by a quantity which can be interpreted as the non-Archimedean Lyapunov exponent of the family.…

2018-03-20abs ↗pdf ↗

Lyapunov analysis improves RNN performance prediction.

problem Uncertainty in RNN performance prediction due to hyperparameters and architecture.
method Lyapunov spectral analysis of RNNs and Autoencoder-Lyapunov Embedding Learning (AeLLE).
result AeLLE successfully correlates RNN Lyapunov spectrum with accuracy and predicts performance.

New method stabilizes deep neural networks by setting Lyapunov exponent to zero.

problem Stability issues in deep neural networks with low width.
method Lyapunov initialization method to set Lyapunov exponent to zero.
result Lyapunov exponent governs stability of deep networks; standard methods fail for low width.

Study approximates top Lyapunov exponents for surface mapping classes.

problem Approximating topological Lyapunov exponents for surface mapping classes.
method Periodic approximation and joint spectral radius extension.
result Top Lyapunov exponents can be approximated by periodic orbits.

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.

We study the relationship between the Lyapunov exponents of the geodesic flow of a closed negatively curved manifold and the geometry of the manifold. We show that if each periodic orbit of the geodesic flow has exactly one Lyapunov exponent on the unstable bundle then the manifold has constant negative curvature. We a…

2015-01-24abs ↗pdf ↗

In previous work, the author fully classified orbit closures in genus three with maximally many (four) zero Lyapunov exponents of the Kontsevich-Zorich cocycle. In this paper, we prove that there are no higher dimensional orbit closures in genus three with any zero Lyapunov exponents. Furthermore, if a Teichmüller curv…

2014-09-18abs ↗pdf ↗

We study harmonic and totally invariant measures in a foliated compact Riemannian manifold isometrically embedded in an Euclidean space. We introduce geometrical techniques for stochastic calculus in this space. In particular, using these techniques we can construct explicitely an Stratonovich equation for the foliated…

2012-08-02abs ↗pdf ↗

The paper proves conditions for non-uniform expansion in partially hyperbolic systems.

problem Conditions for non-uniform expansion in partially hyperbolic systems.
method Analysis of Lyapunov exponents and dominated splittings.
result Existence of physical SRB measure under specific conditions.

We consider actions of Z^k, k \ge 2, by Anosov diffeomorphisms which are uniformly quasiconformal on each coarse Lyapunov distribution. These actions generalize Cartan actions for which coarse Lyapunov distributions are one-dimensional. We show that, under certain non-resonance assumptions on the Lyapunov exponents, a …

2006-08-23abs ↗pdf ↗

Classifies GL(2,R)-invariant subvarieties with zero Lyapunov exponents.

problem Classifying GL(2,R)-invariant subvarieties with specific properties.
method Classification based on homological dimensions and Lyapunov exponents.
result Explicit exceptions list for GL(2,R)-invariant subvarieties with zero Lyapunov exponents.

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

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}).

Study of deep neural networks using finite-time Lyapunov exponents.

problem Understanding the geometric structures in input space formed by deep neural networks.
method Analogy with dynamical systems, computing finite-time Lyapunov exponents.
result Ridges of large positive exponents divide input space into regions associated with different classes.

Energy companies need efficient procedures to perform market calibration of stochastic models for commodities. If the Black framework is chosen for option pricing, the bottleneck of the market calibration is the computation of the variance of the asset. Energy commodities are commonly represented by multi-factor linear…

2018-09-11abs ↗pdf ↗

We consider the multi-bump solutions of the following fractional Nirenberg problem \begin{equation}\label{01} (-Δ)^s u=K(x)u^{\frac{n+2s}{n-2s}}, \;\;\;\;u>0\;\;\text{ in }\mathbb{R}^n, \end{equation} where s(0,1)s\in (0,1) and n>2+2sn>2+2s. If KK is a periodic function in some kk variables with 1k<n2s21\leq k<\frac{n-2s}2, we pr…

2016-12-13abs ↗pdf ↗