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,657 papers · 148 categories
Trend · papers per month
48 results for “Lyapunov function”
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.
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.
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…
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.
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.
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.
Differential topology of the spaces of asymptotically stable vector fields and Lyapunov functionsmath.DS
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.
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…
Smoothing causal functionsmath.DG
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…
We prove diffeomorphisms of polygonal linkage moduli spaces to Euclidean spaces.
problem Moduli spaces of self-avoiding polygonal linkages and configurations.
method Construct Lyapunov-Reeb functions to show diffeomorphisms.
result Moduli spaces are diffeomorphic to Euclidean spaces.
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.
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.
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 RL policy for unbounded state space with stability guarantee.
problem Traditional RL methods fail for unbounded state space.
method Proposes stability as performance metric, uses Sparse-Sampling-based Monte Carlo Oracle.
result Proposed policy ensures state dynamics remain bounded with high probability.
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.
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…
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.
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.
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.
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.
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 …
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.
In many real-world reinforcement learning (RL) problems, besides optimizing the main objective function, an agent must concurrently avoid violating a number of constraints. In particular, besides optimizing performance it is crucial to guarantee the safety of an agent during training as well as deployment (e.g. a robot…
We study the behaviour of a Hilbert geometry when going to infinity along a geodesic line. We prove that all the information is contained in the shape of the boundary at the endpoint of this geodesic line and have to introduce a regularity property of convex functions to make this link precise. The point of view is a d…
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.
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.…
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.
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…
Paper proves convergence of Gini index to equilibrium in Wasserstein distance.
problem Proving convergence of Gini index to equilibrium in Wasserstein distance.
method Analyzes Gini index as Lyapunov functional and proves convergence in Wasserstein distance.
result Proves convergence of Gini index to equilibrium in Wasserstein distance.
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 on Kähler manifolds connects curvature decay with growth of holomorphic functions.
problem Analyzing properties of Kähler manifolds with nonnegative bisectional curvature.
method Established precise relations among minimal degree, volume growth, and scalar curvature decay.
result Unified understanding of Kähler-Ricci flow through polynomial growth holomorphic functions.
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.
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…
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 recovers contact forms from boundary data using vector fields and Lyapunov functions.
problem Recovering contact forms from boundary data.
method Using vector fields and Lyapunov functions, the paper describes boundary data and proves reconstruction of up to diffeomorphism.
result Boundary data allow for the reconstruction of up to a diffeomorphism of .
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…
In this paper, we propose a dynamical systems perspective of the Expectation-Maximization (EM) algorithm. More precisely, we can analyze the EM algorithm as a nonlinear state-space dynamical system. The EM algorithm is widely adopted for data clustering and density estimation in statistics, control systems, and machine…
Identifies a gradient flow to solve kernel learning problems with noise reduction.
problem Kernel learning problem with Gaussian noise.
method Riemannian gradient flow with continuous Lyapunov functionals.
result Flow reduces noise and finds stationary points.
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…
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.
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.
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.
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.
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…
Optimal consumption and portfolio selection with Epstein-Zin utility under general constraintsq-fin.MF
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.
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…