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

Trend · papers per month

74148222296 · Jun 202019922001200920172026
48 results for Finite-time Convergence

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.

Paper analyzes convergence rates for multi-agent learning in games.

problem Convergence rates for multi-agent learning in games.
method Characterizes finite-time convergence rates for joint OGD learning on λλ-cocoercive games and develops adaptive algorithms.
result Adaptive algorithms achieve same convergence rates as non-adaptive counterparts.

We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.

problem Achieving decoupled convergence in nonlinear two-time-scale stochastic approximation.
method Nested local linearity assumption, suitable step size selection, convergence analysis of matrix cross term, fourth-order moment convergence rates.
result Finite-time decoupled convergence rates can be achieved in nonlinear two-time-scale stochastic approximation with proper step size selection.

First-order method solves stochastic bilevel optimization with linear constraints.

problem Stochastic bilevel optimization with linear constraints and noise.
method Developed a novel framework using gradient-based techniques and smoothed penalty functions.
result Achieved finite-time convergence guarantees for (δ,ε)(δ, ε)-Goldstein stationary points.

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

Paper analyzes convergence of dynamic policy gradient for MDPs, improving performance in finite-time problems.

problem Optimal policies in finite-time MDPs are not stationary and require epoch-specific training.
method Introduces dynamic policy gradient combining dynamic programming and policy gradient, analyzes convergence for softmax parametrisation.
result Dynamic policy gradient training exploits finite-time structure, leading to better convergence bounds.

Given any embedded Lagrangian on a four dimensional compact Calabi-Yau, we find another Lagrangian in the same Hamiltonian isotopy class which develops a finite time singularity under mean curvature flow. This contradicts a weaker version of the Thomas-Yau conjecture regarding long time existence and convergence of Lag…

2010-09-06abs ↗pdf ↗

We study finite-time collapsing limits of the continuity method. When the continuity method starting from a rational initial Kähler metric on a projective manifold encounters a finite-time volume collapsing, this projective manifold admits a Fano fibration over a lower dimensional base. In this case, we prove the conti…

2016-12-05abs ↗pdf ↗

This work analyzes QQ-learning with adaptive stepsizes for finite-time convergence.

problem Finite-time convergence analysis for average-reward QQ-learning with adaptive stepsizes.
method Adaptive stepsizes as local clocks, time-inhomogeneous Markovian reformulation, almost-sure time-varying bounds, conditioning arguments, and Markov chain concentration inequalities.
result Convergence rates of ildeO(1/k) ilde{\mathcal{O}}(1/k) for mean-square and pointwise mean-square convergence.

The Kähler-Ricci flow's singularities are analyzed with bounds and convergence results.

problem Understanding the singularities and behavior of the Kähler-Ricci flow.
method Li-Yau type and Harnack estimates for weighted Ricci potential functions.
result Finite time singularities are shown to sub-converge to ancient solutions on analytic normal varieties.

Improved TD learning with tail averaging and regularization achieves optimal convergence rates.

problem Convergence analysis of TD learning with linear function approximation.
method Tail-averaging and regularization applied to TD learning algorithm.
result Achieves optimal O(1/t)O(1/t) convergence rate in expectation and with high probability.

The article explores Helfrich flow with spontaneous curvature, finding singularities and convergence behaviors.

problem Understanding the long-time behavior of Helfrich flow with spontaneous curvature.
method Analyzing the gradient flow of a locally area- and volume-constrained Willmore flow, and applying it to the Helfrich flow.
result For negative spontaneous curvature, the Helfrich flow exhibits finite-time singularities; for positive spontaneous curvature, it converges globally.

New scalable MARL framework for dynamic networked systems.

problem Scalability in multi-agent reinforcement learning with dynamic dependencies.
method Scalable Actor Critic framework for non-local and stochastic dependencies.
result Finite-time error bound showing convergence rate dependence on information spread speed.

Study on SA with heavy-tailed and LRD noise, establishing finite-time bounds.

problem Analyzing stochastic approximation under heavy-tailed and LRD noise.
method Noise-averaging argument to regularize impact of non-classical noise.
result Established first finite-time moment bounds for SA under heavy-tailed and LRD noise.

Constructing eigenfunctions for finite-time singularities in Lagrangian mean curvature flow

problem Constructing eigenfunctions for finite-time singularities in Lagrangian mean curvature flow
method Constructing eigenfunctions for finite-time singularities in Lagrangian mean curvature flow
result Identifying the lowest eigenfunction with the scaling mode of the special Lagrangian desingularization

We show some results for the L2L^2 curvature flow linked by the theme of addressing collapsing phenomena. First we show long time existence and convergence of the flow for SO(3)SO(3)-invariant initial data on S3S^3, as well as a long time existence and convergence statement for three-manifolds with initial L2L^2 norm of c…

2012-01-05abs ↗pdf ↗

New analysis shows actor-critic method converges efficiently in practical settings.

problem Understanding finite-time convergence of single-timescale actor-critic methods.
method Investigated online single-timescale actor-critic algorithm with linear function approximation and Markovian sampling.
result Proved convergence to ε-approximate stationary point with sample complexity of O(ε^(-2)).

This work analyzes actor-critic methods for faster convergence.

problem Finite-time analysis and sample complexity of two-time-scale actor-critic methods.
method Non-asymptotic analysis under non-i.i.d. setting, proving convergence to first-order stationary point.
result Actor-critic method finds a first-order stationary point with ildeO(ε2.5)\mathcal{ ilde{O}}(ε^{-2.5}) sample complexity.

A submanifold in space forms is isoparametric if the normal bundle is flat and principal curvatures along any parallel normal fields are constant. We study the mean curvature flow with initial data an isoparametric submanifold in Euclidean space and sphere. We show that the mean curvature flow preserves the isoparametr…

2007-06-25abs ↗pdf ↗

Paper analyzes SVGD algorithm for non-asymptotic convergence.

problem Optimizing a set of particles to approximate a target probability distribution.
method Finite time analysis of SVGD algorithm, providing descent lemma and convergence rates.
result SVGD algorithm decreases the objective at each iteration and converges to the target distribution.

Paper analyzes convergence of decentralized algorithms with noise and bias.

problem Finite time convergence analysis of decentralized stochastic approximation schemes.
method Separated iterates into consensual parts and consensus error; bounded consensus error in terms of stationarity.
result Decentralized SA scheme converges at O(logT/T){\cal O}(\log T/ \sqrt{T} ) rate.

We show that strictly convex surfaces contracting with normal velocity equal to |A|^2 shrink to a point in finite time. After appropriate rescaling, they converge to spheres. We indicate how we used a computer to find the main test function.

2004-09-21abs ↗pdf ↗

We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance comparison principle for curve shortening flow for initial curves whose local total cu…

2018-09-23abs ↗pdf ↗

NSGLD improves SGLD for non-convex optimization problems.

problem Optimizing non-convex objectives efficiently.
method Introducing non-reversible SGLD by adding an anti-symmetric matrix to the drift term of the Langevin diffusion.
result NSGLD converges faster to the same stationary distribution with non-asymptotic guarantees.

In this work, convergence of evolving Finslerian metrics first in a general flow next under Finslerian Ricci flow is studied. More intuitively it is proved that a family of Finslerian metrics g(t)g(t) which are solutions to the Finslerian Ricci flow converge in CC^{\infty} to a smooth limit Finslerian metric as t t ap…

2015-07-14abs ↗pdf ↗

Several results on existence and convergence of the Yang-Mills flow in dimension four are given. We show that a singularity modeled on an instanton cannot form within finite time. Given low initial self-dual energy, we then study convergence of the flow at infinite time. If an Uhlenbeck limit is anti-self-dual and has …

2014-02-13abs ↗pdf ↗

We study the behaviour of the Kähler-Ricci flow on projective bundles. We show that if the initial metric is in a suitable Kähler class, then the fibers collapse in finite time and the metrics converge subsequentially in the Gromov-Hausdorff sense to a metric on the base.

2011-07-11abs ↗pdf ↗

Classifies self-similar solutions for heat equations with positive speed.

problem Classifying self-similar solutions for semilinear heat equations.
method Analyzes the semilinear heat equation ut=Δu+up1uu_t=Δu+|u|^{p-1}u for p>1p>1.
result Finite time blowing up solutions converge to a positive constant after rescaling.

New method improves generalization in deep learning models.

problem Improving generalization in overparameterized deep neural networks.
method Stochastic Gauss-Newton method with Levenberg-Marquardt damping and mini-batch sampling.
result Established finite-time convergence and non-asymptotic generalization bounds.

The paper studies how convex hypersurfaces evolve under curvature flows in space forms.

problem Understanding the evolution of convex hypersurfaces under curvature flows in different space forms.
method Flow by powers of the Gauss curvature in space forms.
result Convex hypersurfaces under the flow by powers of the Gauss curvature in space forms contract to a point in finite time or converge to geodesic spheres.

In this paper we investigate the convergence for the mean curvature flow of closed submanifolds with arbitrary codimension in space forms. Particularly, we prove that the mean curvature flow deforms a closed submanifold satisfying a pinching condition in a hyperbolic space form to a round point in finite time.

2011-05-28abs ↗pdf ↗