Convergence Analysis
Overview
Convergence analysis asks whether repeated updates in optimization, learning, sampling, and dynamical systems approach a solution, and how fast. Common tools include Lyapunov functions, contraction and coupling arguments, potential functions, and finite-time error bounds, often paired with lower bounds to identify what rates are achievable. Guarantees are studied in settings such as stochastic gradient methods, reinforcement learning, game dynamics, Langevin and Markov-chain sampling, and neural-network training. A central tension is that strong rates can depend on restrictive assumptions, while practical concerns such as noise, dimension, delayed information, and last-iterate behavior can change what is provable.
Latest papers
43 papers1 paper in the last four weeks, down 80% on the four weeks before. 0.0% of all new papers.