Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

93185278370 · Jun 202019922001200920172026
48 results for geometric convergence

We show that for a strongly convergent sequence of geometrically finite Kleinian groups with geometrically finite limit, the Cannon-Thurston maps of limit sets converge uniformly. If however the algebraic and geometric limits differ, as in the well known examples due to Kerckhoff and Thurston, then provided the geometr…

2011-07-05abs ↗pdf ↗

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.

Geometric tempering fails for Langevin dynamics, proving convergence limits.

problem Proving convergence and limitations of geometric tempering for Langevin dynamics.
method Theoretical investigation of geometric tempering using Langevin dynamics.
result Geometric tempering can lead to exponential time convergence and poor functional inequalities.

Geometric analysis improves convergence of variational inference.

problem Challenges in analyzing convergence of variational inference due to non-convexity and non-smoothness.
method Exploits exponential family structure and Bregman divergences to geometrically analyze the optimization landscape.
result Establishes non-asymptotic convergence rates for gradient descent algorithms.

The paper proves spectral convergence for a specific type of geometric quantization.

problem Spectral convergence of \overline{\partial}-Laplacians on toric symplectic manifolds.
method Study of a family of compatible complex structures converging to the large complex structure limit.
result Spectral convergence of \overline{\partial}-Laplacians acting on LkL^k.

This work proves a strong convergence result for a geometric EM scheme on Riemannian manifolds.

problem Convergence of numerical schemes for manifold-valued SDEs.
method Geometric Euler-Maruyama scheme for Riemannian manifolds.
result Strong convergence of order 1/2 for the geometric EM scheme on Riemannian manifolds.

Study equidistribution for flows on geometrically finite convergence group actions.

problem Counting, mixing and equidistribution for flows on geometrically finite convergence group actions.
method Establishing results for finite BMS measures on flow spaces associated to geometrically finite convergence group actions.
result Results apply to flow spaces associated to relatively Anosov groups.

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.

The paper examines convergence of currents and forms under smooth diffeomorphisms.

problem Analyzing convergence of currents and forms under C0C^0-limits of diffeomorphisms.
method Geometric analysis, measure theory, homotopy theory.
result Pushforwards of rectifiable currents converge in the flat norm.

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.

Paper studies convergence of nonnegative scalar curvature metrics to a specific limit space.

problem Understanding convergence of nonnegative scalar curvature metrics.
method Analyzes a sequence of warped product metrics on $\Sph^2 imes \Sph^1$.
result Sequence converges to an extreme limit space in specific senses.

New HMC method uses asymmetrical momentum distributions and improves performance.

problem Rigorous convergence guarantees for HMC with Gaussian momentum distributions.
method New convergence analysis for HMC with general asymmetrical momentum distributions, proposing AD-HMC.
result AD-HMC exhibits geometric convergence in Wasserstein distance under certain conditions.

This paper uses combinatorial Ricci flow to tackle Thurston's triangulation conjecture.

problem Thurston's triangulation conjecture for hyperbolic 3-manifolds.
method Combinatorial Ricci flow approach to prove convergence and geometric decompositions.
result Combinatorial Ricci flow converges if and only if the triangulation is geometric.

The paper studies degenerations of rational maps and their limits as geometrically finite rational maps.

problem Understanding the limits of quasi post-critically finite degenerations of rational maps.
method Constructing limits as geometrically finite rational maps on a tree of Riemann spheres, proving boundedness, and giving convergence criteria.
result Progress towards Thurston's compactness theorem and double limit theorem in complex dynamics.

Study geometric structure of Ricci shrinker ends without global curvature assumptions.

problem Understand the geometric structure of Ricci shrinker ends without global curvature constraints.
method Analyze blow-up sequences of Ricci shrinkers at points with Type I scalar curvature bound, extending F-convergence theory.
result Limits of Ricci shrinkers at points with Type I scalar curvature bound split a line in four dimensions.

Yau's Affine Normal Descent optimizes smooth unconstrained problems with geometrically adapted directions.

problem Optimizing smooth unconstrained problems with geometrically adapted directions.
method Yau's Affine Normal Descent (YAND) uses the equi-affine normal of level-set hypersurfaces as search directions.
result YAND converges globally under standard smoothness assumptions and locally quadratically near nondegenerate minimizers.

This paper proposes a geometric estimator of dependency between a pair of multivariate samples. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples. This estimator converges to a quantity that we call the geometric mutual inf…

2019-05-21abs ↗pdf ↗

Unified geometric flows improve deep learning efficiency and simplify neural network topologies.

problem Improving deep learning performance and simplifying neural network structures.
method Proposes a thermodynamically coupled Ricci flow that dynamically adapts parameter space geometry to loss landscape topology, enabling automated singularity resolution and providing entanglement entropy bounds.
result Demonstrates 2.1× convergence acceleration and 63% topological simplification while maintaining O(NlogN)\mathcal{O}(N\log N) complexity, outperforming Riemannian baselines by 15.2% in few-shot accuracy.

BBVI with STL converges geometrically under perfect specification, with quadratic variance bound.

problem Convergence rate of BBVI with STL estimator.
method Proved geometric convergence rate with quadratic variance bound for BBVI with STL estimator.
result BBVI with STL converges geometrically under perfect variational family specification.

This research smooths out fluid equations to avoid sudden shocks.

problem Formation of shock singularities in compressible fluid equations.
method Information geometric regularization of unidimensional pressureless Euler equations.
result Smooth global solutions without artificial viscosity.

The principle of convergence stability for geometric flows is the combination of the continuous dependence of the flow on initial conditions, with the stability of fixed points. It implies that if the flow from an initial state g0g_0 exists for all time and converges to a stable fixed point, then the flows of solutions…

2018-05-01abs ↗pdf ↗

Elliptical slice sampling converges geometrically, providing reliable sampling for Bayesian learning.

problem Sampling from posterior distributions in Bayesian learning.
method Elliptical slice sampling, geometric ergodicity.
result Elliptical slice sampling yields geometric convergence guarantees under weak regularity assumptions.

Generalized Tanaka prolongation ensures convergence of formal embeddings of complex manifolds.

problem Ensuring convergence of formal embeddings of complex manifolds under weaker conditions.
method Formulated and proved generalized Tanaka prolongation for geometric structures.
result Convergence of formal embeddings holds under weaker semi-positive normal bundle conditions.

Gradient descent converges to perfect classification in neural nets for non-separable data.

problem Classifying linearly non-separable data using neural networks.
method Analysis of gradient descent dynamics in neural networks with sufficient but not large number of neurons.
result Gradient descent converges to global minima with perfect classification in the landscape of minimization problems.

SGD and stochastic gradient descent converge at optimal rates for certain non-convex functions.

problem Optimal convergence rates for non-convex functions under gradient noise.
method Geometric interpretation of the PL-condition to analyze convergence rates.
result Convergence rates of SGD and stochastic gradient descent match those of strongly convex quadratics.

New rates for GLD and SGLD in infinite-dimensional spaces without dimensionality issues.

problem Gradient Langevin dynamics and SGLD convergence rates in high-dimensional spaces.
method Analysis of GLD and SGLD in infinite-dimensional Hilbert spaces, using stochastic differential equations and Markov chains.
result Derivation of dimension-free convergence rates for GLD and SGLD.

We show that for a strongly convergent sequence of purely loxodromic finitely generated Kleinian groups with incompressible ends, Cannon-Thurston maps, viewed as maps from a fixed base limit set to the Riemann sphere, converge uniformly. For algebraically convergent sequences we show that there exist examples where eve…

2013-06-13abs ↗pdf ↗

SGD converges with perturbed forward-backward passes, explained by geometric amplification.

problem Analyzing convergence of SGD with perturbed forward-backward passes in composite optimization.
method Characterized propagation and amplification of perturbations, derived convergence guarantees for non-convex and PL objectives.
result Perturbations cascade through the computational graph, affecting convergence order under specific conditions.

A lightweight framework improves convergence and stability of PINNs for complex PDEs.

problem Training instability and reduced accuracy in PINNs for complex PDEs.
method Adaptive curvature correction using secant information to optimize first-order optimizers.
result Consistent improvements in convergence speed, stability, and accuracy over standard optimizers.

The rate of convergence of weighted kernel herding (WKH) and sequential Bayesian quadrature (SBQ), two kernel-based sampling algorithms for estimating integrals with respect to some target probability measure, is investigated. Under verifiable conditions on the chosen kernel and target measure, we establish a near-geom…

2019-07-19abs ↗pdf ↗

The paper explains how ReLU nets converge globally in high dimensions without strict assumptions.

problem Understanding global convergence of ReLU nets in very high dimensions.
method Fine-grained analysis of random activation matrices and detailed gradient norm and curvature analysis.
result Empirical loss function has favorable geometrical properties in the overparameterized setting.

We study the quantization of coupled Kähler-Einstein (CKE) metrics, namely we approximate CKE metrics by means of the canonical Bergman metrics, so called the ``balanced metrics''. We prove the existence and weak convergence of balanced metrics for the negative first Chern class, while for the positive first Chern clas…

2019-04-29abs ↗pdf ↗

GCNs converge and remain stable on large random graphs, revealing geometric insights.

problem Understanding the behavior of GCNs on large, sparse random graphs.
method Analysis of GCNs on random graph models with latent variables and geometric edge probabilities.
result GCNs converge to their continuous counterparts as graph size increases, and are stable to small graph deformations.