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,657 papers · 148 categories

Trend · papers per month

200400600800 · Jun 202019922001200920172026
48 results for Lyapunov optimization

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.

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

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.

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.

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…

2018-05-20abs ↗pdf ↗

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.

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

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.

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.

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…

2015-01-24abs ↗pdf ↗

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.

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 ↗

New algorithm reduces communication time in federated learning.

problem Intermittent connectivity and non-i.i.d. data slow federated learning convergence.
method Lyapunov optimization for efficient device scheduling.
result Significant reduction in communication time with improved convergence rates.

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.

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.

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.

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.

We study continuous action reinforcement learning problems in which it is crucial that the agent interacts with the environment only through safe policies, i.e.,~policies that do not take the agent to undesirable situations. We formulate these problems as constrained Markov decision processes (CMDPs) and present safe p…

2019-01-28abs ↗pdf ↗

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…

2014-12-04abs ↗pdf ↗

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…

2018-10-30abs ↗pdf ↗

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…

2016-09-05abs ↗pdf ↗

RNNs struggle with chaotic dynamics due to exploding gradients, but we found a way to optimize training.

problem Challenging training of RNNs with chaotic dynamics due to exploding gradients.
method Relating loss gradients to Lyapunov spectrum to optimize training on chaotic data.
result RNNs with chaotic dynamics always have diverging gradients, while stable ones have bounded gradients.