Exponential rate of convergence for harmonic heat flow maps.
problem Analyzing the convergence rate of harmonic heat flow maps.
method Proving exponential convergence rate for harmonic heat flow maps.
result Exponential convergence rate of the harmonic heat flow.
This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard t…
Holomorphic cylinders converge to disks joined by flow lines.
problem Convergence of perturbed holomorphic cylinders.
method Exponential estimates and flow line computation.
result Holomorphic cylinders converge to two disks joined by a flow line.
This paper studies stability of the exponential utility maximization when there are small variations on agent's utility function. Two settings are considered. First, in a general semimartingale model where random endowments are present, a sequence of utilities defined on R converges to the exponential utility. Under a …
We prove that for analytic functions in low dimension, the convergence rate of the deep neural network approximation is exponential.
Study proves uniqueness of asymptotic limits for specific manifolds.
problem Proving uniqueness of asymptotic limits for Ricci-flat manifolds with linear volume growth.
method Established using natural curvature and cross section assumptions.
result Uniqueness and exponential convergence rate for complete noncollapsed Ricci-flat manifolds with linear volume growth.
Near-Exponential Convergence Rates for kNN Classification
problem Convergence rates for kNN classification
method Introducing Boltzmann margin
result First near-exponential convergence rates for kNN classification
EM algorithm converges in KL divergence for exponential families via mirror descent.
problem Lack of understanding of EM's non-asymptotic convergence properties.
method Viewing EM as a mirror descent algorithm, showing convergence rates in KL divergence.
result KL divergence rates for EM in exponential families, invariant to parametrization.
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. We present Matrix Krasulina, an algorithm for online k-PCA, by generalizing the classic Krasulina's method (Krasulina, 1969) from vector to matrix case. We show, both theoretically and empirically, that the algorithm naturally adapts to data low-rankness and converges exponentially fast to the ground-truth principal su…
We consider binary classification problems with positive definite kernels and square loss, and study the convergence rates of stochastic gradient methods. We show that while the excess testing loss (squared loss) converges slowly to zero as the number of observations (and thus iterations) goes to infinity, the testing …
Paper shows SVM can achieve super fast convergence rates.
problem Understanding fast convergence rates for SVM.
method Presented a simple mechanism to obtain fast convergence rates for SVM.
result SVM can exhibit exponential convergence rates without hard Tsybakov margin condition.
CAVI converges exponentially fast for Bayesian PCA models.
problem Characterizing the convergence speed of CAVI for BPCA.
method Proved exponential convergence using power iteration analogy and novel lower bounds.
result Exponential convergence of CAVI for BPCA models with any number of principal components.
New algorithm reduces feature count and accelerates error convergence.
problem Exponential error convergence in data classification with optimized random features.
method Optimized random features accelerated by quantum machine learning.
result Achieves exponential error convergence under low-noise condition.
MSGD outperforms SGD in overparametrized settings with faster convergence rates.
problem Optimization of non-convex functions with momentum.
method Momentum Stochastic Gradient Descent (MSGD) with rigorous analysis.
result MSGD converges exponentially faster than SGD in overparametrized settings.
MSTGD optimizes gradient descent with stratified sampling for faster convergence.
problem Fluctuation in gradient expectation and variance between iterations.
method Memory Stochastic Stratified Gradient Descent (MSTGD) with stratified sampling and variance reduction.
result MSTGD achieves an exponential convergence rate independent of dataset size and batch size.
AdaX improves Adam by exponentially accumulating past gradients, leading to better performance in machine learning tasks.
problem Adam's fast convergence can lead to local minimums in non-convex problems.
method AdaX exponentially accumulates past gradients to adaptively tune the learning rate.
result AdaX outperforms Adam in various machine learning tasks, including computer vision and natural language processing.
This work studies clustering in transformer models, proving exponential convergence to a single token state.
problem Understanding the long-term behavior of tokens in transformer models.
method Investigates mean-field transformer models under specific conditions to prove exponential convergence to a single state.
result Transformer models synchronize exponentially fast to a single token state with explicit rates.
The MAP estimate's log-likelihood sub-optimality is hard to bound in general.
problem Bounding the expected log-likelihood sub-optimality of MAP for exponential families.
method Interpreting MAP as stochastic mirror descent and analyzing convergence rates.
result Current convergence results do not apply to standard examples of exponential families.
Study on Langevin dynamics convergence rates and their application to GAN training.
problem Understanding the long-term behavior of Langevin dynamics equations.
method Analytical and numerical methods to study convergence rates of underdamped mean-field Langevin dynamics.
result Exponential convergence rate results for the Langevin dynamics under various conditions.
New stability bounds for Sinkhorn's algorithm in entropic optimal transport.
problem Stability and convergence of Sinkhorn's algorithm for entropic optimal transport.
method Semiconcavity approach to analyze stability and convergence.
result Exponential convergence of Sinkhorn's algorithm under semiconcavity conditions.
In this paper, we study the CR Yamabe flow with zero CR Yamabe invariant. We use the CR Poincaré inequality and a Gagliardo-Nirenberg type interpolation inequality to show that this flow has long time solution and the solution converges to a contact form with flat pseudo-Hermitian scalar curvature exponentially.
Paper proposes an algorithm to recover full supervision from weakly labeled data.
problem Machine learning requires expensive data annotation, motivating the use of weak supervision.
method The paper introduces a disambiguation principle and an empirical disambiguation algorithm for partial labelling.
result The algorithm achieves exponential convergence rates under learnability assumptions.
EM algorithm converges exponentially fast for overspecified Gaussian mixtures.
problem Convergence of EM algorithm in overspecified Gaussian mixtures.
method Structured configuration of means and weights, strong convexity, Polyak-Łojasiewicz inequality, finite-sample analysis.
result Exponential convergence rate of EM algorithm in KL distance.
Tensor networks improve integration accuracy for high-dimensional problems.
problem Integration of high-dimensional functions with exponential convergence.
method Regression-free tensor network representations for integration.
result Exponential convergence achieved for non-analytic integrands.
Kernel estimator optimally recovers function from noisy exponential Radon transform.
problem Inverting noisy exponential Radon transform of a function.
method Proposed a kernel estimator to estimate the true function.
result The estimator converges to the true function at minimax optimal rate.
Decentralized algorithm reduces regret and converges to Nash equilibrium in online congestion games.
problem Online congestion games with exponential action sets and strict Nash equilibria.
method CongestEXP algorithm using exponential weights method.
result CongestEXP achieves O ( k F T ) O(kF\sqrt{T}) O ( k F T ) regret bound and almost exponential convergence to strict Nash equilibrium. Boosting with tempered exponential measures improves AdaBoost's convergence rate.
problem Improving the convergence rate of AdaBoost.
method Introducing tempered exponential measures (TEMs) to generalize AdaBoost's approach.
result t-AdaBoost achieves an improved convergence rate compared to AdaBoost, especially for t ∈ [ 0 , 1 ) t \in [0,1) t ∈ [ 0 , 1 ) . Proves convergence of mean curvature flow on cylinders with unique continuation.
problem Understanding the convergence and uniqueness of mean curvature flow on cylindrical surfaces.
method Proves convergence and provides unique continuation results for mean curvature flow on cylinders.
result Proves that rescaled mean curvature flow on cylinders converging super-exponentially must coincide with the cylinder itself.
Paper provides exponential convergence guarantees for Iterative Markovian Fitting.
problem Addressing the Schrödinger Bridge problem in computational optimal transport and generative modeling.
method Develops non-asymptotic exponential convergence guarantees for Iterative Markovian Fitting.
result First non-asymptotic exponential convergence guarantees for IMF under mild structural assumptions.
Improved averaging method for noisy observations converges strongly.
problem Noisy observations from random dynamical systems require stable estimates.
method Introduced p p p -EMA, a modified exponential moving average with subharmonic weight decay. result Stochastic convergence guarantees for p p p -EMA under mild assumptions. Study shows diffused interface flows to single diffused balls over time.
problem Volume-preserving mean curvature flow in Euclidean space.
method Diffused interface version, exponential convergence proof.
result Exponential convergence to single diffused balls.
The paper proves the stability of a flow in Schwarzschild space.
problem Stability of area preserving mean curvature flow in asymptotic Schwarzschild space.
method Demonstrates existence and exponential convergence of the flow for all time.
result The flow converges to a round sphere or a constant mean curvature surface.
Gradient descent implicitly follows regularization for general losses.
problem The implicit bias of gradient descent methods in machine learning.
method Empirical risk minimization over linear predictors with arbitrary convex, strictly decreasing losses.
result Gradient descent and regularization paths converge to the same direction for non-attained risks.
Ancient flows converge fast with finite curvature and convexity.
problem Understanding ancient mean curvature flows with finite curvature.
method Established exponentially fast convergence and finite curvature properties.
result Ancient flows have finite total curvature and finite mass drop.
Surface diffusion and mean curvature flows converge to stable critical sets in flat tori.
problem Stability of surface diffusion and mean curvature flows in flat tori.
method Existence and convergence of flows starting close to stable critical sets, proven for all times.
result Flows converge exponentially fast to stable critical sets in flat tori.
We study the asymptotic behavior of solutions to the second boundary value problem for a parabolic PDE of Monge-Ampère type arising from optimal mass transport. Our main result is an exponential rate of convergence for solutions of this evolution equation to the stationary solution of the optimal transport problem. We …
Exponentially fast SMF algorithm for multi-class classification.
problem Learning interpretable features from high-dimensional data.
method Novel framework that 'lifts' SMF as a low-rank matrix estimation problem.
result Provable exponential convergence to global minimizer under mild assumptions.
The paper studies a modified scalar curvature flow and proves convergence to a sphere.
problem Analyzing the convergence of a modified scalar curvature flow.
method Flow of starshaped hypersurfaces with a specific speed function, proving existence and convergence.
result The flow converges exponentially fast to a sphere, except for α < 2 α<2 α < 2 . Geometric tempering improves sampling from distributions, with exponential convergence rates.
problem Sampling from probability distributions using gradient flow dynamics.
method Geometric tempering of the target distribution in Wasserstein and Fisher-Rao gradient flows.
result Exponential convergence in continuous and discrete time for geometric tempering.
Study shows how flat flow solutions in 2D converge to disks.
problem Understanding the asymptotics of area-preserving mean curvature flow in 2D.
method Analyzes flat flow solutions starting from bounded sets of finite perimeter.
result Flat flow solutions converge to a union of equally sized disks with exponential rate.
We describe and analyze a simple algorithm for principal component analysis and singular value decomposition, VR-PCA, which uses computationally cheap stochastic iterations, yet converges exponentially fast to the optimal solution. In contrast, existing algorithms suffer either from slow convergence, or computationally…
We consider stochastic gradient descent and its averaging variant for binary classification problems in a reproducing kernel Hilbert space. In the traditional analysis using a consistency property of loss functions, it is known that the expected classification error converges more slowly than the expected risk even whe…
We consider the action of a pseudo-Anosov mapping class on P M L ( S ) \mathcal{PML}(S) P ML ( S ) . This action has north-south dynamics and so, under iteration, laminations converge exponentially to the stable lamination. We study the rate of this convergence and give examples of families of pseudo-Anosov mapping classes where the rate go…
This paper introduces a new potential function using Tsallis entropy for neural network optimization.
problem The challenge of obtaining exponential convergence in neural network optimization.
method Utilizes a linearized potential function based on Csiszár type of Tsallis entropy.
result Derives an exponential convergence result in neural network optimization.
Study of combinatorial Calabi flow on ideal circle patterns.
problem Finding ideal circle patterns with prescribed curvatures.
method Combinatorial Calabi flow in hyperbolic and Euclidean geometry.
result Flow converges exponentially to ideal circle patterns.
Optimization rates improved for manifolds with bounded geometry.
problem Optimizing functions on manifolds with bounded geometry.
method Riemannian gradient descent and dynamic trivialization algorithm.
result Curvature-dependent convergence rates computed explicitly for common manifolds.
A random walk w n w_n w n on a separable, geodesic hyperbolic metric space X X X converges to the boundary ∂ X \partial X ∂ X with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes positive linear progress. Progress is known to be linear with exponential decay when …