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,742 papers · 148 categories

Trend · papers per month

147293440586 · Jun 202019922001200920172026
48 results for H^(-2) convergence

New examples of mean curvature flow converge to minimal surfaces with multiplicity 2.

problem Constructing mean curvature flow examples in closed manifolds.
method Constructing new examples of mean curvature flow with convergence to minimal surfaces with multiplicity 2.
result Mean curvature flow examples converge to minimal surfaces with multiplicity 2.

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.

The paper proves spectral convergence rates for graph Laplacian to manifold Laplace-Beltrami operator.

problem Spectral convergence of graph Laplacian to manifold Laplace-Beltrami operator.
method Analysis of Dirichlet form convergence and construction of approximate eigenfunctions via manifold heat kernel.
result Proves spectral convergence rates for Gaussian kernelized graph Laplacian.

Proves convergence groups on a 2-sphere are Kleinian groups.

problem Proving convergence groups on a 2-sphere are Kleinian groups.
method Analyzing relatively hyperbolic groups with planar boundaries and applying to various versions of the Cannon conjecture.
result Proves relatively hyperbolic groups with planar boundaries are virtually Kleinian.

Study convergence and approximations of entropic regularized Wasserstein distances for Gaussian and RKHS measures.

problem Convergence and approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings.
method Analysis of convergence and finite sample approximations of entropic regularized Wasserstein distances in Gaussian and RKHS settings.
result Strictly weaker convergence in 2-Sinkhorn divergence for Gaussian measures compared to exact 2-Wasserstein distance.

We prove that, starting at an initial metric g(0)=e2u0(dx2+dy2)g(0)=e^{2u_0}(dx^2+dy^2) on R2\mathbb{R}^2 with bounded scalar curvature and bounded u0u_0, the Ricci flow tg(t)=Rg(t)g(t)\partial_t g(t)=-R_{g(t)}g(t) converges to a flat metric on R2\mathbb{R}^2.

2009-08-16abs ↗pdf ↗

Polynomial networks converge to Gaussian processes at a rate of O(n^(-1/2)).

problem Understanding the convergence rate of polynomial networks to Gaussian processes.
method Examined one-hidden-layer neural networks with random weights, focusing on polynomial activations and their convergence rate in the 2-Wasserstein metric.
result The rate of convergence for polynomial networks to Gaussian processes is $O(n^{- rac{1}{2}})$.

The paper constructs non-convergent solutions to Vafa-Witten equations with specific harmonic 2-form limits.

problem Constructing solutions to Vafa-Witten equations with non-zero mass term.
method Constructs divergent sequences of solutions, renormalizes them, and defines harmonic 2-form data sets.
result Defines an 'interesting' harmonic 2-form data set with specific properties.

We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that if traces converge `horocyclically' to 2 then associated linear slices converge…

2013-03-29abs ↗pdf ↗

This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-1/2}$ (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold Laplacian when the sampling become infinitely dense. The convergence rate with …

2011-01-07abs ↗pdf ↗

Improved convergence rates for Stein Variational Gradient Descent in finite-particle settings.

problem Improving convergence rates for Stein Variational Gradient Descent in finite-particle settings.
method Analyzing the time derivative of relative entropy and splitting it into dominant and smaller parts.
result Finite-particle convergence rates of order 1/\sqrt{N} for Kernelized Stein Discrepancy and Wasserstein-2 metrics.

Compactness theorems for G2G_2-solitons established with scalar curvature and potential function constraints.

problem Establishing compactness theorems for G2G_2-solitons under specific conditions.
method Proved Gromov-Hausdorff convergence and derived epsilon-regularity estimates.
result Smooth convergence of G2G_2-solitons under uniform energy bounds at half the dimension.

In this note we give a simple proof for the convergence of stochastic gradient (SGD) methods on μμ-convex functions under a (milder than standard) LL-smoothness assumption. We show that for carefully chosen stepsizes SGD converges after TT iterations as $O\left( LR^2 \exp \bigl[-\fracμ{4L}T\bigr] + \frac{σ^2}{μT} \r…

2019-07-09abs ↗pdf ↗

Paper analyzes convergence of DDPM for general distributions.

problem Theoretical understanding of DDPM's convergence properties remains limited.
method Introduced a relaxed smoothness condition and proved near-optimal convergence rates.
result Established a convergence rate of \( \widetilde{O}\left(\frac{d\min\{d,L^2\}}{T^2} ight) \) in Kullback-Leibler divergence.

In this paper we study the family of embeddings ΦtΦ_t of a compact RCD(K,N)RCD^*(K,N) space (X,d,m)(X,d,m) into L2(X,m)L^2(X,m) via eigenmaps. Extending part of the classical results by Bérard, Bérard-Besson-Gallot, known for closed Riemannian manifolds, we prove convergence as t0t\downarrow 0 of the rescaled pull-back metrics $Φ_t^*g…

2018-12-10abs ↗pdf ↗

For the class of approximate harmonic maps uW1,2(Σ,N)u\in W^{1,2}(Σ,N) from a closed Riemmanian surface (Σ,g)(Σ,g) to a compact Riemannian manifold (N,h)(N, h), we show that (i) the so-called energy identity holds for weakly convergent approximate harmonic maps {un}:ΣN\{u_n\}:Σ\to N, with tension fields τ(un)τ(u_n) bounded in the Morrey spa…

2016-04-20abs ↗pdf ↗

Deep neural networks without regularization can achieve consistent estimates with good convergence rates.

problem The necessity of regularization in deep neural networks for consistent estimates.
method Gradient descent on an over-parametrized neural network without regularization, with specific initialization, step size, and number of steps.
result An estimate without regularization is universally consistent and achieves good convergence rates.

Uniform convergence of metrics on surfaces with bounded curvature measures proved.

problem Proving uniform convergence of metrics on Alexandrov surfaces with bounded integral curvature.
method Weak convergence of measures and analytic approximation of metrics.
result Uniform convergence of metrics on Alexandrov surfaces proved.

The paper studies curvature flows of star-shaped hypersurfaces and proves convergence to spheres.

problem Analyzing the convergence of a class of anisotropic curvature flows.
method Using new auxiliary functions, the paper studies a class of flows with specific speed and proves convergence under certain conditions.
result The kk-convex solution to the flow converges smoothly to a sphere after normalization for specific values of kk, αα, and ββ.

The paper analyzes how over-parameterization affects GD convergence in matrix sensing problems.

problem Matrix sensing problem with over-parameterized gradient descent.
method Analyzes symmetric and asymmetric parameterizations, provides lower bounds and convergence rates.
result Over-parameterization slows down GD convergence, but asymmetric parameterization can speed up convergence.

We prove the hypersymplectic flow of simple type on standard torus T4\mathbb{T}^4 exists for all time and converges to the standard flat structure modulo diffeomorphisms. This result in particular gives the first example of a cohomogeneity-one G2G_2-Laplacian flow on a compact 77-manifold which exists for all time and…

2017-09-07abs ↗pdf ↗

The paper studies algebraic integer relations and sequences converging to 4.

problem Investigating algebraic integer relations and convergence of sequences.
method Constructing a generalized Farey graph for the subgroup GαG_α and analyzing its properties.
result A sequence of algebraic integers converges to 4, each corresponding to a non-free group of rank 2.

The paper shows how Yang-Mills-Higgs energies converge to the (n2)(n-2)-area functional.

problem Understanding the convergence of Yang-Mills-Higgs energies to the (n2)(n-2)-area functional.
method Analyzing the convergence of critical points of Yang-Mills-Higgs energies to minimal submanifolds and proving ΓΓ-convergence.
result Yang-Mills-Higgs energies converge to the (n2)(n-2)-area functional as εo0ε o 0.

We study the flow MtM_t of a smooth, strictly convex hypersurface by its mean curvature in Rn+1\mathrm{R}^{n+1}. The surface remains smooth and convex, shrinking monotonically until it disappears at a critical time TT and point xx^* (which is due to Huisken). This is equivalent to saying that the corresponding rescaled…

2005-02-25abs ↗pdf ↗

GD converges faster to flatter minima than gradient flow in shallow networks.

problem Understanding the dynamics of gradient descent in shallow linear networks.
method Analyzing the convergence rate and solution of gradient descent in depth-2 linear neural networks.
result GD converges linearly to flatter minima than gradient flow, even with large step sizes.

The study finds counterexamples to curvature estimates for minimizing surfaces.

problem Curvature estimates for minimizing surfaces in metric convergence.
method Constructing sequences of smooth minimizing surfaces in metrics converging to Euclidean.
result Found counterexamples with diverging L2L^2 norm of second fundamental form.

Paper develops MMOT framework for financial applications with neural acceleration.

problem Financial optimization and calibration under multi-period martingale constraints.
method Theoretical analysis, incremental updates, adaptive sparse grids, hybrid neural-projection solver.
result Neural solver achieves 1597x speedup for real-time applications.