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

Trend · papers per month

73147220293 · Jun 202019922001200920172026
48 results for convergence radius

Given a positive function uW1,nu\in W^{1,n}, we define its John-Nirenberg radius at point xx to be the supreme of the radius such that Btlogun<ε0n\int_{B_t}|\nabla\log u|^n<ε_0^n when n>2n>2, and Btu2<ε02\int_{B_t}|\nabla u|^2<ε_0^2 when n=2n=2. We will show that for a collapsing sequence in a fixed conformal class under some curvature c…

2017-08-07abs ↗pdf ↗

Random translation surfaces converge to a Poisson plane as genus grows.

problem Understanding the geometric behavior of high genus translation surfaces.
method Proving convergence of random translation surfaces to a Poisson plane using statistical local geometric properties.
result The radius-rr neighborhood of a random point in an MSV-distributed random translation surface converges in distribution to the radius rr neighborhood of the root in a Poisson translation plane.

Local limit theorem for random walks on hyperbolic groups with parabolic subgroups.

problem Analyzing the behavior of random walks on relatively hyperbolic groups.
method Study of convergent random walks with finite derivative of Green function at spectral radius.
result Proves a local limit theorem for the probability of returning to the origin.

Study circular foliations and shear-radius coordinates on hyperbolic cone surfaces.

problem Characterize Teichmüller spaces of hyperbolic cone surfaces.
method Construct circular foliations and shear-radius coordinates on Teichmüller spaces of hyperbolic cone surfaces.
result Shear-radius coordinates provide global coordinates on Teichmüller spaces and converge to specific metrics.

Polyak step size GD reaches final radius of convergence after log iterations.

problem Statistical and computational complexities of Polyak step size GD.
method Generalized smoothness and Lojasiewicz conditions, stability of gradients.
result Polyak step size GD reaches final statistical radius of convergence after logarithmic number of iterations.

The paper interprets learned step sizes in deep-unfolded gradient descent.

problem Intuitive interpretation of learned non-constant step sizes in deep-unfolded gradient descent.
method Theoretical analysis and optimization of spectral radius.
result Chebyshev steps achieve the lower bound of convergence rate for first-order methods.

Paper proves unique tangent flow at infinity for entropy-limited curve shortening.

problem Proving uniqueness of tangent flows for finite-entropy curve shortening.
method Rescaled backward convergence to a line, entropy analysis, and geometric properties.
result Ancient smooth curve shortening flow has a unique tangent flow at infinity.

Graph Laplacian approximates manifold eigenvalues with controlled curvature bounds.

problem Approximating eigenvalues of Laplace-Beltrami on manifolds with bounded Ricci curvature.
method Graph discretization of Riemannian manifolds with (ε,ρ)(ε,ρ)-approximation, proving eigenvalue convergence.
result Graph Laplacian eigenvalues converge uniformly to manifold Laplacian eigenvalues as parameters approach zero.

The paper studies a flow of spacelike curves in a Lorentz-Minkowski plane, showing convergence to a constant function.

problem Evolution of spacelike graphic curves in Lorentz-Minkowski plane.
method Anisotropic inverse mean curvature flow with vanishing Neumann boundary condition.
result The evolving curves converge to a constant function as time tends to infinity.

BMM algorithm improves convergence for nonconvex optimization problems.

problem Constrained nonsmooth nonconvex optimization problems.
method Block majorization-minimization with diminishing radius.
result Improved convergence rate for nonconvex optimization problems.

We show that there exist hyperbolic knots in the 3-sphere such that the set of points of large injectivity radius in the complement take up the bulk of the volume. More precisely, given a finite volume hyperbolic manifold, for any bound R>0 on injectivity radius, consider the set of points with injectivity radius at le…

2016-10-25abs ↗pdf ↗

The paper studies a flow of spacelike surfaces in Lorentz-Minkowski space, proving convergence to a hyperbolic plane.

problem Evolution of spacelike graphic hypersurfaces in Lorentz-Minkowski space.
method Anisotropic inverse mean curvature flow with Neumann boundary condition.
result The flow converges to a hyperbolic plane as time tends to infinity.

Spheres' spectral structure converges to Gaussian space's as dimensions grow.

problem Understanding spectral convergence between high-dimensional spheres and Gaussian spaces.
method Proving spectral convergence using projections and eigenvalues.
result Spectral structure on high-dimensional spheres converges to Gaussian space's as dimensions increase.

The Hidden Markov Model (HMM) is one of the mainstays of statistical modeling of discrete time series, with applications including speech recognition, computational biology, computer vision and econometrics. Estimating an HMM from its observation process is often addressed via the Baum-Welch algorithm, which is known t…

2015-12-27abs ↗pdf ↗

The paper studies how certain spacelike surfaces evolve over time in a specific space.

problem Evolution of spacelike graphic hypersurfaces in Lorentz-Minkowski space.
method Inverse mean curvature flow with vanishing Neumann boundary condition.
result The evolving surfaces converge to a hyperbolic plane as time goes to infinity.

Optimal financial strategies minimize risk under uncertain models.

problem Maximizing utility in financial markets with model uncertainty.
method Optimized strategies converge to those with minimal norm as uncertainty increases.
result Optimal strategies with minimal norm emerge as uncertainty grows.

We study a form of cyclic pursuit on Riemannian manifolds with positive injectivity radius. We conjecture that on a compact manifold, the piecewise geodesic loop formed by connecting consecutive pursuit agents either collapses in finite time or converges to a closed geodesic. The main result is that this conjecture is …

2016-02-10abs ↗pdf ↗

We construct hyperbolic integer homology 3-spheres where the injectivity radius is arbitrarily large for nearly all points of the manifold. As a consequence, there exists a sequence of closed hyperbolic 3-manifolds which Benjamini-Schramm converge to H^3 whose normalized Ray-Singer analytic torsions do not converge to …

2013-04-01abs ↗pdf ↗

New similarity measure for covariate shift improves nonparametric regression rates.

problem Improving nonparametric regression under covariate shift.
method Introducing a new similarity measure based on probability ratios.
result Shows a sharper rate of convergence compared to transfer exponent.

Study on critical faces convergence in a Poisson point process.

problem Convergence of point processes associated with critical faces in a Čech filtration.
method Established convergence in M0\mathcal M_0-topology for critical faces above vanishing threshold.
result Obtained limit theorems for positive and negative critical faces.

The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with focal points but no conjugate points. The approach is suggested by a characteriz…

2014-12-01abs ↗pdf ↗

Develops an online Gaussian process method that maintains convergence guarantees without sample complexity issues.

problem The computational intractability of Gaussian processes with streaming data.
method Parsimonious Online Gaussian Processes (POG) that maintains asymptotic consistency with bounded memory.
result POG preserves convergence guarantees to the population posterior with finite memory, even for constant error radius.

Uniform curvature bounds for regularized metrics with bounds on Ricci tensor and injectivity radius.

problem Bounding curvature of regularized metrics with constraints on Ricci tensor and injectivity radius.
method Mollification of riemannian metrics, uniform W2,pW^{2,p}-harmonic radius bounds, Ricci tensor bounds, injectivity radius bounds.
result Uniform estimate on the change of sectional curvature for regularized metrics.

This paper analyzes how periodic and soft target updates stabilize linear Q-learning.

problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.

Upper bound for conjugate radius in open manifolds with scalar curvature and spectrum constraints.

problem Bounding the conjugate radius of open manifolds with specific curvature and spectrum conditions.
method Established an upper bound using scalar curvature and bottom-of-spectrum constraints.
result For certain conditions, the conjugate radius is no more than π.

ELU algorithm improves on EM for over-specified Gaussian mixtures.

problem Slow convergence of EM in over-specified Gaussian mixtures.
method Developed ELU algorithm for two-component mixtures, combining exponential location update and gradient descent.
result ELU converges to final statistical radius after logarithmic iterations, resolving open question.

The paper investigates learning conditional distributions on multi-dimensional spaces using clustering and neural networks.

problem Learning conditional distributions on multi-dimensional spaces with varying dimensions.
method The approach involves clustering data near varying query points in the feature space to create empirical measures in the target space using two clustering schemes: fixed-radius ball and nearest neighbors. The convergence rates of both methods are analyzed, and the nearest neighbors method is incorporated into neural network training.
result The empirical analysis shows that the nearest neighbors method has better performance in practice and can adapt to a suitable level of Lipschitz continuity locally.

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the…

2015-08-08abs ↗pdf ↗

Improved computational complexity in statistical models using second-order information.

problem Polynomial convergence of gradient descent in singular statistical models.
method Normalized Gradient Descent (NormGD) algorithm with second-order information.
result NormGD reaches final statistical radius in logarithmic iterations of nn.