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…
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,695 papers · 148 categories
Trend · papers per month
48 results for “Lyapunov analysis”
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.
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 distance.
We determine the Lyapunov spectrum of ball quotients arising from cyclic coverings. The computations are performed by rewriting the sum of Lyapunov exponents as ratios of intersection numbers and by the analysis of the period map near boundary divisors. As a corollary, we complete the classification of commensurability…
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.
Lyapunov-based analysis shows polynomial sample complexity for WCMDPs and RBs.
problem Learning in WCMDPs and RBs under a generative model.
method Lyapunov-based analysis framework.
result Near-optimal policies can be learned with polynomial complexity.
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.
A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regressionstat.ML
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.
On Lyapunov Exponents for RNNs: Understanding Information Propagation Using Dynamical Systems Toolscs.LG
Lyapunov exponents help understand RNN stability.
problem Optimizing RNNs is sensitive to various parameters.
method Use Lyapunov exponents as dynamical system tools.
result Lyapunov spectrum measures training stability.
A Lyapunov Theory for Finite-Sample Guarantees of Asynchronous Q-Learning and TD-Learning Variantscs.LG
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 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.
Lyapunov 1-forms on orbifolds help understand flows on compact spaces.
problem Understanding flows on orbifolds using Lyapunov 1-forms.
method Introducing Lyapunov 1-forms, using asymptotic cycles and chain-recurrent sets.
result Existence of a Lyapunov 1-form in a prescribed cohomology class for compact orbifolds.
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.
New bounds show SGD can match deterministic gradient descent's convergence rate.
problem Optimizing SGD convergence rate under strong convexity and smoothness.
method Computer-aided Lyapunov analysis, focusing on bias-optimal bounds.
result SGD achieves optimal convergence rate in bias terms for a wide range of step-sizes.
In this paper, following J. Franks' work on Lyapunov graphs of nonsingular Smale flows on , we study Lyapunov graphs of nonsingular Smale flows on . More precisely, we determine necessary and sufficient conditions on an abstract Lyapunov graph to be associated with a nonsingular Smale flow on $S^1 …
This paper analyzes and improves monotonic accelerated algorithms like M-NAG and M-FISTA.
problem Establishing linear convergence of M-NAG and M-FISTA under strong convexity.
method Lyapunov analysis and modified Lyapunov functions.
result Linear convergence of M-NAG and M-FISTA is guaranteed without full NAG iterates.
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.
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.
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.
We study the dynamical behaviors of degenerate stochastic differential equations (SDEs). We select an auxiliary Fisher information functional as the Lyapunov functional. Using generalized Fisher information, we conduct the Lyapunov exponential convergence analysis of degenerate SDEs. We derive the convergence rate cond…
Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimizationmath.OC
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.
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.…
Policy gradient algorithm with variable learning rates achieves near-optimal performance in multi-arm bandit problems.
problem Optimizing a policy gradient algorithm for multi-arm bandit problems with variable learning rates.
method Applied Foster-Lyapunov techniques to analyze a Markov chain formed by the state of the algorithm.
result The policy gradient algorithm converges to the optimal arm with logarithmic or poly-logarithmic regret.
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.
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.
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.
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…
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…
The paper analyzes deep neural networks using control theory to set a time limit for their convergence.
problem Understanding the finite-time convergence of deep neural networks.
method Lyapunov based analysis of the loss function, control theory framework, finite-time control of non-linear systems.
result A priori guarantees of finite-time convergence for deep neural networks are provided.
New neural methods for stable control with provable guarantees.
problem Designing stable control policies for nonlinear systems.
method Neural network Lyapunov functions and a falsifier to guide learning.
result Provable stability of controlled nonlinear systems.
Neural Lyapunov Redesigneess.SY
Combines Lyapunov functions with controller synthesis for safe control policies.
problem Ensuring safety in controller design for nonlinear systems.
method Iterative algorithm combining Lyapunov function estimation and controller synthesis.
result Effective control policies with large safe regions are derived.
On positive Lyapunov exponents along and non-uniformly expanding for partially hyperbolic systemsmath.DS
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.
This paper introduces a novel framework to construct the region of attraction (ROA) of a power system centered around a stable equilibrium by using stable state trajectories of system dynamics. Most existing works on estimating ROA rely on analytical Lyapunov functions, which are subject to two limitations: the analyti…
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 …
Invariant Subvarieties of Minimal Homological Dimension, Zero Lyapunov Exponents, and Monodromymath.DS
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.
We show that for many strata of Abelian differentials in low genus the sum of Lyapunov exponents for the Teichmueller geodesic flow is the same for all Teichmueller curves in that stratum, hence equal to the sum of Lyapunov exponents for the whole stratum. This behavior is due to the disjointness property of Teichmuell…
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 -open and -dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.
Finite-time Lyapunov exponents of deep neural networkscond-mat.dis-nn
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.
Consider a family of K3 surfaces over a hyperbolic curve (i.e. Riemann surface). Their second cohomology groups form a local system, and we show that its top Lyapunov exponent is a rational number. One proof uses the Kuga-Satake construction, which reduces the question to Hodge structures of weight 1. A second proof us…
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.
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…
We study several new invariants associated to a holomorphic projective structure on a Riemann surface of finite analytic type: the Lyapunov exponent of its holonomy which is of probabilistic/dynamical nature and was introduced in our previous work; the degree which measures the asymptotic covering rate of the developin…
Consider a flat bundle over a complex curve. We prove a conjecture of Fei Yu that the sum of the top k Lyapunov exponents of the flat bundle is always greater or equal to the degree of any rank k holomorphic subbundle. We generalize the original context from Teichmueller curves to any local system over a curve with non…
This paper uses dynamical systems to analyze and ensure convergence of the Bayesian EM algorithm.
problem Ensuring convergence of the Bayesian EM algorithm in incomplete-data scenarios.
method Applying Lyapunov stability theory to discrete-time dynamical systems.
result Conditions for convergence and potential for fast convergence of MAP-EM are established.
We consider the dynamics of a linear stochastic approximation algorithm driven by Markovian noise, and derive finite-time bounds on the moments of the error, i.e., deviation of the output of the algorithm from the equilibrium point of an associated ordinary differential equation (ODE). We obtain finite-time bounds on t…
New findings on diffusion rates in wind-tree model with rational parameters.
problem Understanding diffusion rates in the wind-tree model with rational parameters.
method Analyzing real numbers in [0,1) as diffusion rates and providing a criterion for Lyapunov spectrum.
result Exhibit an infinite family of wind-tree billiards with the interior of the Lyapunov spectrum being the full square (0,1)^2.
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.
We construct a Teichmueller curve uniformized by the Fuchsian triangle group (m,n,\infty) for every m<n. Our construction includes the Teichmueller curves constructed by Veech and Ward as special cases. The construction essentially relies on properties of hypergeometric differential operators. For small m, we find Bill…