Study shows link determinant densities converge to Mahler measure.
problem Determinant densities of infinite links and their convergence.
method Folner convergence of finite links to infinite biperiodic alternating link L, Mahler measure of characteristic polynomial.
result Determinant densities of finite links converge to Mahler measure of L.
We study the bottom of the spectrum in Hilbert geometries, we show that it is zero if and only if the geometry is amenable, in other words if and only if it admits a Fölner sequence. We also show that the bottom of the spectrum admits an upper bound, which depends only on the dimension and which is the bottom of the sp…
Paper shows convergence types match for almost minimal sets.
problem Matching convergence types for almost minimal sets.
method Hausdorff and varifold convergence comparison on almost minimal sets.
result Hausdorff and varifold convergence coincide on almost minimal sets.
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.
Benjamini-Schramm convergence equals spectral convergence for lattices.
problem Equivalence of convergence notions for lattices.
method Extending conditions to locally compact groups and using relative L2-theory.
result Equivalence of Benjamini-Schramm and spectral convergence under mild conditions.
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.
Conditions for local spectral convergence in RCD*(K,N) spaces are identified.
problem Conditions for local spectral convergence in RCD*(K,N) spaces.
method Identifying necessary and sufficient conditions for local spectral convergence.
result Necessary and sufficient conditions for local spectral convergence in balls of RCD*(K,N) spaces are established.
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 paper contrasts different convergence notions in geometric analysis.
problem Exploring discrepancies between various convergence concepts in geometric analysis.
method Examples and proof of a theorem requiring specific bounds on warping functions.
result Warped product manifolds can have different convergence limits even if the warping functions converge in L p L^p L p . 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.
Momentum improves federated learning convergence.
problem Accelerating convergence in federated learning.
method Integrates momentum into federated learning via momentum gradient descent.
result Momentum federated learning accelerates convergence compared to standard federated learning.
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.
Random walks on convergence groups are studied, extending properties from hyperbolic groups.
problem Properties of random walks on hyperbolic groups are extended to convergence groups.
method Extending properties of random walks from hyperbolic groups to convergence groups with specific conditions.
result Random walks on convergence groups can be analyzed with a compact topology, leading to new insights into the Poisson boundary.
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.
Study on normalized Betti numbers in non-positively curved manifolds.
problem Convergence of normalized Betti numbers in non-positively curved manifolds.
method Benjamini-Schramm convergence, volume-normalization, irreducible symmetric spaces of noncompact type.
result Normalized Betti numbers converge for non-compact manifolds.
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.
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. New algorithms prove fast convergence in complex min-max problems.
problem Proving fast convergence in nonconvex min-max optimization.
method Hamiltonian Gradient Descent (HGD) and Consensus Optimization (CO) algorithms.
result HGD and CO achieve linear convergence in various settings.
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.
Study shows G-H and intrinsic flat convergence for manifolds with Ricci curvature.
problem Analyzing convergence of manifolds with Ricci curvature constraints.
method Noncollapsing sequence of manifolds with Ricci curvature and diameter bounds.
result Gromov-Hausdorff convergence matches intrinsic flat 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.
A distributed deep learning method that converges and scales well.
problem Training deep neural networks efficiently with multiple machines.
method Distributed training approach with theoretical convergence guarantees.
result Empirically shows close to 6x speedup on ImageNet with 6 machines.
Totally geodesic limit of quasi-Fuchsian groups with converging critical exponent.
problem Understanding convergence of quasi-Fuchsian groups.
method Critical exponent convergence analysis.
result Convergence of quasi-Fuchsian groups to totally geodesic representations.
Study non-symmetric diffusions on RCD spaces, proving their convergence.
problem Analyzing non-symmetric diffusion processes on RCD spaces.
method Constructing diffusion processes with Dirichlet forms, investigating conservativeness and weak convergence.
result Established convergence of diffusion laws under geometric and coefficient convergences.
Paper improves convergence rates and step sizes for gradient algorithms.
problem Limited convergence rates and step sizes in existing algorithms.
method General proximal incremental aggregated gradient algorithm.
result Better and novel convergence results under general scheme.
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.
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.