This paper analyzes MCMC algorithms on large graphs using Dirichlet forms.
problem Analyzing the behavior of MCMC algorithms in high-dimensional problems.
method Utilizes Mosco convergence of Dirichlet forms to study RWM algorithm on large graphs.
result Demonstrates the advantages of Dirichlet form approach over standard diffusion methods.
Study limits of manifolds with Kato bound Ricci curvature, proving volume convergence.
problem Understanding structure of limits of manifolds with Ricci curvature bounds.
method Mosco convergence of Dirichlet energies to Cheeger energy, introduction of monotone quantities, volume convergence.
result Volume convergence to Hausdorff n-measure in limits of manifolds.
Aim of this paper is to discuss convergence of pointed metric measure spaces in absence of any compactness condition. We propose various definitions, show that all of them are equivalent and that for doubling spaces these are also equivalent to the well known measured-Gromov-Hausdorff convergence. Then we show that the…
Study on extremizers for Sobolev inequality on curved manifolds.
problem Existence of extremizers for the sharp p p p -Sobolev inequality on Riemannian manifolds with nonnegative curvature. method Nonsmooth concentration compactness methods and Mosco-convergence results for Cheeger energy.
result Almost extremal functions are close to radial Euclidean bubbles and almost zero globally under nonnegative curvature.
The paper studies Hodge Laplacians from point clouds, proving spectral convergence and harmonic form consistency.
problem Analyzing Riemannian submanifolds from point cloud data.
method Constructing deformed Hodge Laplacians and empirical operators from point clouds, proving convergence properties.
result Empirical spectral cluster contains the k k k -th Betti number and converges to harmonic k k k -forms. The aim of this paper is to provide new stability results for sequences of metric measure spaces ( X i , d i , m i ) (X_i,d_i,m_i) ( X i , d i , m i ) convergent in the measured Gromov-Hausdorff sense. By adopting the so-called extrinsic approach of embedding all metric spaces into a common one ( X , d ) (X,d) ( X , d ) , we extend the results of Gigli-Mondino-Savaré by prov…
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.
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. The objective of this paper is to introduce the notion of generalized almost statistical (briefly, GAS) convergence of bounded real sequences, which generalizes the notion of almost convergence as well as statistical convergence of bounded real sequences. As a special kind of Banach limit functional, we also introduce …
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 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.
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.
We develop a new approach to geometric quantization using the theory of convergence of metric measure spaces. Given a family of Kähler polarizations converging to a non-singular real polarization on a prequantized symplectic manifold, we show the spectral convergence result of ∂ ˉ \bar{\partial} ∂ ˉ -Laplacians, as well as th…
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.
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.
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.
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. 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.
We relate L p L^p L p convergence of metric tensors or volume convergence to a given smooth metric to Intrinsic Flat and Gromov-Hausdorff convergence for sequences of Riemannian manifolds. We present many examples of sequences of conformal metrics which demonstrate that these notions of convergence do not agree in general ev…
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.
Neural networks trained with actor-critic algorithms converge to ODEs under weak convergence analysis.
problem Challenges in convergence analysis due to changing data distributions in online learning.
method Geometric ergodicity of data samples, Poisson equation, weak convergence techniques.
result Actor and critic networks converge to solutions of ODEs with random initial conditions.
The paper proves a convergence theorem for Wiener measures on holonomy groups.
problem Understanding convergence of Wiener measures on holonomy groups.
method Using stochastic parallel transports along convergent metric connections.
result Proves a convergence theorem for push-forward Wiener measures on holonomy groups.
Study on convergence rate of weighted Yamabe flow.
problem Weighted Yamabe problem on smooth metric measure spaces.
method Weighted Yamabe flow and its convergence rate analysis.
result Study and analysis of convergence rate of the weighted Yamabe flow.
Gradient descent achieves exact linear convergence rate for symmetric matrix completion.
problem Low-rank symmetric matrix completion using gradient descent.
method Local analysis of gradient descent for symmetric matrices without additional assumptions.
result Closed-form expression of exact linear convergence rate matches practice.
Survey on strong convergence in random matrices and its applications.
problem Understanding convergence of random matrices to operators.
method Analysis of operator norms of noncommutative polynomials.
result New insights and applications in random graphs, geometry, and operator algebras.