Policy gradient method proves convergence in imperfect-information games.
problem Policy gradient methods in imperfect-information games (EFGs).
method Policy gradient approach with best-iterate convergence.
result Policy gradient leads to provable best-iterate convergence in self-play EFGs.
Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.
problem Solving equations and inclusions using extragradient methods.
method Unified and generalized extragradient methods for a broader class of algorithms, analyzing sublinear convergence rates.
result Unified and improved convergence results for various extragradient variants.
New ODE models show saddle-point optimization methods converge differently, with last-iterate convergence for OGDA.
problem Analyzing convergence properties of saddle-point optimization methods.
method High-Resolution Differential Equations (HRDEs) to design differential equation models for saddle-point optimization methods.
result HRDEs reveal last-iterate convergence for Optimistic Gradient Descent Ascent (OGDA) in bilinear games.
Survey on extragradient methods for solving nonlinear equations and inclusions.
problem Approximating solutions of nonlinear equations and inclusions.
method Unified convergence analysis of extragradient and its variants.
result Sublinear convergence rates for different classes of algorithms.
SGD works well with large learning rates at the edge of stability.
problem Stochasticity at the edge of stability in deep learning.
method Sharp convergence guarantees for SGD with multiclass cross-entropy loss.
result SGD self-stabilizes, ensuring convergence with large learning rates.
Develops new algorithms for solving root-finding problems in large-scale settings.
problem Solving nonlinear equations in large-scale settings.
method Randomized block-coordinate optimistic gradient algorithms.
result Achieves convergence rates of O ( 1 / k ) \mathcal{O}(1/k) O ( 1/ k ) and O ( 1 / k 2 ) \mathcal{O}(1/k^2) O ( 1/ k 2 ) for root-finding problems. Accelerated gradient (AG) methods are breakthroughs in convex optimization, improving the convergence rate of the gradient descent method for optimization with smooth functions. However, the analysis of AG methods for non-convex optimization is still limited. It remains an open question whether AG methods from convex o…
New variance-reduction methods solve stochastic composite inclusions.
problem Solving nonmonotone stochastic composite inclusions.
method Developed unbiased and biased variance-reduced estimators for FRBS method.
result Achieved best oracle complexities for finite-sum and expectation settings.
This paper improves universal sound separation using sound classification.
problem Separating acoustic sources from an open domain, regardless of their class.
method Utilizing semantic embeddings from a sound classifier to condition a separation network.
result Classifier embeddings provide nearly one dB of SNR gain, and iterative models achieve significant performance.
The Efficient Global Optimization (EGO) algorithm uses a conditional Gaus-sian Process (GP) to approximate an objective function known at a finite number of observation points and sequentially adds new points which maximize the Expected Improvement criterion according to the GP. The important factor that controls the e…
Proves weak convergence equals mean convergence in GGC.
problem Proving convergence in GGC distributions.
method Using generalized gamma convolution (GGC) and expected utility maximization.
result Weak convergence implies mean convergence in GGC.
Introduces generalized almost statistical convergence and its properties.
problem Developing a new convergence concept for sequences.
method Introducing generalized almost statistical convergence and proving its properties.
result Existence of a GAS convergent sequence that is neither statistical nor almost convergent.
This is an intuitive survey of extrinsic and intrinsic notions of convergence of manifolds complete with pictures of key examples and a discussion of the properties associated with each notion. We begin with a description of three extrinsic notions which have been applied to study sequences of submanifolds in Euclidean…
The abstract discusses convergence properties of Lipschitz functions and sets defined by equations.
problem Convergence of Lipschitz functions and sets defined by equations.
method Painlevé-Kuratowski convergence applied to Lipschitz functions and sets defined by equations.
result Generalizations and reverses of classical theorems on convergence of functions and sets.
Study shows intrinsic timed Hausdorff convergence leads to Gromov-Hausdorff and big bang convergence.
problem Distance between Lorentzian manifolds.
method Intrinsic timed Hausdorff convergence.
result Intrinsic timed Hausdorff convergence implies Gromov-Hausdorff and big bang convergence.
Studied SGD convergence under weak conditions.
problem Convergence of SGD in nonconvex optimization.
method Analyzed biased nonconvex SGD under mild conditions.
result Provided convergence rates and complexities.
Study on convergence rate of Q Q Q -curvature flow in 6 dimensions.
problem Analyzing the convergence rate of Q Q Q -curvature flow in 6 dimensions. method Provided an example of a slowly converging Q 6 Q_6 Q 6 -curvature flow in dimension 6. result The Q Q Q -curvature flow in 6 dimensions does not always converge exponentially, unlike in 2 dimensions. Establishes geometric convergence of iterative optimization algorithms.
problem Analyzes convergence of iterative optimization algorithms under general assumptions.
method General framework for iterative optimization algorithms, proving asymptotic geometric convergence and providing convergence rates.
result Asymptotic geometric convergence of iterative optimization algorithms with exact rate.
Uniform counting formulas for orthogeodesics in Kleinian groups converge.
problem Counting orthogeodesics in Kleinian groups converging to a limit.
method Spectral gap of the limit manifold and geodesic flow mixing property.
result Asymptotically uniform counting formulas for orthogeodesics.
The paper connects different convergence concepts in geometric analysis.
problem Comparing convergence concepts in geometric analysis.
method Relating L p L^p L p convergence and volume convergence to Intrinsic Flat and Gromov-Hausdorff convergence. result Conditions for convergence of Riemannian manifolds under specific conditions.
The paper explores null distance convergence for warped product spacetimes.
problem Defining convergence for sequences of spacetimes as metric spaces.
method Using the null distance to define convergence of spacetimes.
result Optimal convergence theorem for warped product spacetimes.
New quasi-Newton method guarantees global superlinear convergence.
problem Global convergence and superlinear convergence of quasi-Newton methods.
method Hybrid proximal extragradient method with online learning for Hessian approximation.
result First globally convergent quasi-Newton method with explicit superlinear convergence rate.
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.
The article introduces a new convergence concept for Lorentzian spaces and applies it to generalized cones.
problem Stability of curvature bounds in generalized Lorentzian cones.
method Introduces ℓ \ell ℓ -convergence for Lorentzian pre-length spaces, applies it to generalized cones, and proves stability of curvature bounds. result Sharp timelike curvature and curvature-dimension bounds for generalized cones are established.
AdaBoost's classifier and margins converge to a known value.
problem Convergence properties of AdaBoost algorithm.
method Formal proofs of convergence properties of AdaBoost's classifier and margins.
result AdaBoost's classifier and margins converge to a known value.
Study shows gap between uniform convergence and test error in random feature models.
problem Understanding the gap between uniform convergence and test error in random feature models.
method Analytical expressions for uniform convergence over norm balls, interpolators, and minimum norm interpolator risk derived and proved.
result Uniform convergence over interpolators still gives a non-trivial bound of test error even when classical uniform convergence is vacuous.
The Sinkhorn-Knopp derivatives converge with linear rate.
problem Optimal transport problem with entropic regularization.
method Iterative proportional fitting procedure.
result Derivatives converge with linear rate.
The paper examines convergence of distances in Lipschitz structures on manifolds.
problem Convergence of distances in Lipschitz vector fields and norms on manifolds.
method Analysis of convergence of distances associated to converging structures of Lipschitz vector fields and norms.
result Under mild controllability assumption, distances converge locally uniformly to the limit Carnot-Carathéodory distance.
New approach to geometric quantization for symplectic manifolds.
problem Quantization of symplectic manifolds with non-singular Lagrangian fibrations.
method Using spectral convergence of metric measure spaces, the authors develop a new geometric quantization approach.
result Spectral and quantum Hilbert space convergence results for Kähler and almost Kähler quantizations.
We introduce a natural definition of L p L^p L p -convergence of maps, p ≥ 1 p \ge 1 p ≥ 1 , in the case where the domain is a convergent sequence of measured metric space with respect to the measured Gromov-Hausdorff topology and the target is a Gromov-Hausdorff convergent sequence. With the L p L^p L p -convergence, we establish a theory of …
We prove a criterion of convergence in the augmented Teichmueller space that can be phrased in terms of convergence of the hyperbolic metrics or of quasiconformal convergence away from the nodes.
Sharp convergence theorem for sphere submanifolds proved.
problem Sphere submanifolds in spheres.
method Proved a sharp convergence theorem.
result New differentiable sphere theorem for submanifolds in spheres.
DCDC calculates convergence rates for Markov chains using neural networks.
problem Computing precise convergence rates for Markov chains is hard.
method Developed a neural network-based algorithm (DCDC) to bound convergence rates in Wasserstein distance.
result Demonstrated effective convergence bounds for real-world Markov chains.
Proves curvature tensor convergence for smoothable spaces.
problem Curvature tensor behavior in smoothable Alexandrov spaces.
method Weak convergence of curvature tensors in noncollapsing sequences.
result Proves convergence of curvature tensors in smoothable Alexandrov spaces.
Study utility maximization with costs, proving convergence and strategies.
problem Utility maximization with proportional transaction costs.
method Extended weak convergence theory and Meyer--Zheng topology.
result Prove convergence of utility maximization problems and optimal trading strategies.
Develops clustering methods based on likelihood and convergence proved.
problem Hard clustering based on likelihood.
method k-MLE, k-Bregman, k-VARs approaches.
result Convergence proved for clustering methods.
New technique explains convergence in ML models with data modifications.
problem Understanding convergence of ML models under data changes.
method Analogue of Fatou's lemma and gamma-convergence.
result Relevance and applications in general ML tasks and domain adaptation.
Characterizes problems solvable via linear convergence algorithms.
problem Optimization problems solvable with linear convergence.
method Riemannian gradient descent.
result Characterized problems solvable via linear convergence.
The paper provides convergence guarantees for multicalibration gradient boosting.
problem Understanding the convergence properties of multicalibration gradient boosting.
method Computational guarantees for multicalibration gradient boosting algorithms, including adaptive variants.
result The magnitude of successive prediction updates decays at O ( 1 / T ) O(1/\sqrt{T}) O ( 1/ T ) , leading to convergence in empirical multicalibration error. Equivalence shown between two mathematical concepts for hyperbolic surfaces.
problem None explicitly stated, but related to mathematical equivalence of concepts.
method Benjamini-Schramm convergence and zeta functions equivalence demonstration.
result Equivalence of Benjamini-Schramm convergence and zeta functions for compact hyperbolic surfaces.
Study Gromov-Hausdorff convergence of metric pairs and tuples.
problem Understanding convergence in metric spaces.
method Prove equivalence of definitions, embedding, completeness, and compactness theorems.
result Relative version of Fukaya's theorem and finiteness theorem for stratified spaces.
Study on convergence rate of Bergman metrics on Kähler manifolds.
problem Analyzing convergence rate of Bergman metrics on Kähler manifolds.
method Using Tian's peak section method to show uniform C 1 , α C^{1,α} C 1 , α convergence. result Uniform C 1 , α C^{1,α} C 1 , α convergence of Bergman metrics is demonstrated. New proof shows coupling-based flows converge linearly to diagonalize data covariance.
problem Understanding convergence of coupling-based normalizing flows to arbitrary data distributions.
method Proved linear convergence rate for whitening of data distribution.
result Coupling-based flows achieve linear convergence to diagonalize data covariance.
Proof given for SGD convergence in a concise manner.
problem Convergence of Stochastic Gradient Descent (SGD)
method Self-contained proof
result SGD convergence proven
Study on slow convergence in geometric variational problems.
problem Slow convergence of solutions in geometric variational problems.
method Identifying necessary conditions for slowly converging solutions and characterizing their convergence rate and direction.
result Characterization of the rate and direction of convergence for slowly converging solutions.
Study on the convergence rate of prescribed scalar curvature flow.
problem Prescribing scalar curvature on manifolds.
method Inspired by Yamabe flow convergence rate study, analyze the prescribed scalar curvature flow convergence rate.
result Determine the convergence rate of the prescribed scalar curvature flow.
Hamiltonian Monte Carlo converges to target distributions under mild conditions.
problem Establishing convergence of Hamiltonian Monte Carlo algorithms.
method Analyzing L q L^q L q convergence for Hamiltonian Monte Carlo under mild conditions. result Outputs converge to target distributions under specified conditions.
Study approximates sub-Riemannian structures with Riemannian metrics and analyzes spectral convergence.
problem Approximating sub-Riemannian structures for analysis.
method Constructing Riemannian metrics tailored to sub-Riemannian structures and studying spectral convergence.
result Riemannian volumes converge to Popp's volume and spectral convergence of Laplace operators is studied.