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

306090120 · May 202619922001200920172026
48 results for polynomial decay

Study on scalar curvature decay on non-compact manifolds linked at infinity.

problem Understanding scalar curvature decay on non-compact manifolds with topological linking at infinity.
method Analyzing polynomial decay, developing obstruction theory, using μμ--bubble exhaustions, and index theory.
result Topological linking at infinity forces polynomial decay of scalar curvature on manifolds of weakly bounded geometry.

Study on massless Vlasov equation on Reissner-Nordström spacetimes, showing decay rates and non-decay phenomena.

problem Analyzing decay and non-decay rates of solutions to the massless Vlasov equation on Reissner-Nordström spacetimes.
method Quantitative analysis of geodesic flow and comparison to wave equation instability results.
result Exponential decay rates in subextremal cases and polynomial rates in extremal cases, with non-decay of transversal derivatives in extremal cases.

Study on Kähler manifolds connects curvature decay with growth of holomorphic functions.

problem Analyzing properties of Kähler manifolds with nonnegative bisectional curvature.
method Established precise relations among minimal degree, volume growth, and scalar curvature decay.
result Unified understanding of Kähler-Ricci flow through polynomial growth holomorphic functions.

New bounds for KRR condition number reveal overfitting phenomena.

problem Characterizing overfitting in KRR with varying kernel spectral decay.
method Derived new bounds for kernel matrices, enhanced test error bounds, and identified feature independence role.
result Identified tempered and catastrophic overfitting phenomena.

Riemannian stochastic gradient descent converges faster with increasing batch size.

problem Improving convergence rate of Riemannian stochastic gradient descent.
method Theoretical analysis and numerical investigation of increasing batch size effects.
result Riemannian stochastic gradient descent converges faster with increasing batch size.

We study the geodesic X-ray transform on Cartan-Hadamard manifolds, and prove solenoidal injectivity of this transform acting on functions and tensor fields of any order. The functions are assumed to be exponentially decaying if the sectional curvature is bounded, and polynomially decaying if the sectional curvature de…

2017-05-29abs ↗pdf ↗

Paper shows existence of vortex solutions with specific decay properties.

problem Existence of solutions to Seiberg-Witten equations with specific decay properties.
method Dimensional reduction of Seiberg-Witten equations on the plane.
result Contains both exponentially decayed and polynomial growth solutions.

Develops exact convex optimization formulations for neural networks.

problem Training two-layer neural networks with rectified linear units.
method Uses semi-infinite duality and minimum norm regularization to develop exact convex optimization formulations.
result Shows equivalence of ReLU networks trained with weight decay to block 1\ell_1 penalized convex models.

Last SGD iterate bounds for overparameterized linear regression.

problem Analyzing the last iterate risk bounds of SGD with decaying stepsize for overparameterized linear regression.
method Problem-dependent analysis of last iterate risk bounds of SGD with geometrically decaying stepsize.
result Proved nearly matching upper and lower bounds on the excess risk for last iterate SGD with geometrically decaying stepsize.

In this paper, we prove the linear stability to gravitational and electromagnetic perturbations of the Reissner-Nordström family of charged black holes with small charge. Solutions to the linearized Einstein-Maxwell equations around a Reissner-Nordström solution arising from regular initial data remain globally bounded…

2019-04-09abs ↗pdf ↗

Study shows neural networks trained with GD converge to Gaussian processes with polynomial decay.

problem Understanding convergence of neural networks to Gaussian processes during training.
method Explicit upper bounds on quadratic Wasserstein distance between trained networks and Gaussian approximations.
result Polynomial decay of approximation error with network width and training time.

The paper extends Bonnet-Myers theorem for manifolds with nonnegative Ricci curvature.

problem Compactness and diameter estimation for manifolds with nonnegative Ricci curvature.
method General curvature conditions for estimating diameter and compactness criteria.
result Established compactness theorems for manifolds with polynomial or exponential Ricci curvature decay.

Paper develops an online learning algorithm for functional data models.

problem Recovering slope functions or predictors in functional data models.
method Online regularized learning algorithm in reproducing kernel Hilbert spaces with polynomially decaying step-size.
result Established fast convergence rates for estimation error without capacity assumption.

Study on instability of extreme Reissner-Nordström spacetime perturbations.

problem Linear stability of gravitational and electromagnetic perturbations in extreme Reissner-Nordström spacetime.
method Extends Giorgi's framework to prove instability results for a set of gauge invariant quantities along the event horizon.
result Proves decay, non-decay, and polynomial blow-up estimates for certain quantities along the event horizon, depending on the number of derivatives.

New polynomial-time solutions found for training ReLU networks, mirroring Max-Cut complexity.

problem Training two-layer ReLU neural networks with weight decay regularization.
method Developed a convex formulation and randomized algorithm to find approximate global optimizers.
result First polynomial-time approximation guarantees and hardness of approximation results for regularized ReLU networks.

In this paper, we study the online learning algorithm without explicit regularization terms. This algorithm is essentially a stochastic gradient descent scheme in a reproducing kernel Hilbert space (RKHS). The polynomially decaying step size in each iteration can play a role of regularization to ensure the generalizati…

2017-10-10abs ↗pdf ↗

Study analyzes learnability of RKHS under L∞ norm for kernel methods.

problem Understand performance of kernel methods and random feature models.
method Relate L∞ learnability to kernel spectrum decay and establish sample complexity bounds.
result Conditions for efficient L∞ learning of RKHS identified.

The authors prove that the logarithmic Monge-Ampère flow with uniformly bound and convex initial data satisfies uniform decay estimates away from time t=0t=0. Then applying the decay estimates, we conclude that every entire classical strictly convex solution of the equation {equation*} \det D^{2}u=\exp\{n(-u+1/2\sum_{i=…

2009-11-15abs ↗pdf ↗

New theory sharpens Q-learning with LDTZ rate, proving it's best of both worlds.

problem Improving Q-learning's theoretical and practical performance.
method Developed a sharp non-asymptotic error bound and central limit theory for Q-learning with PD2Z-ν schedule.
result Q-learning with LDTZ schedule achieves rapid decay and asymptotic convergence guarantees.

Adaptive algorithm identifies best arm with abstention, showing phase transition from polynomial to exponential error probability.

problem Bayesian best-arm identification with abstention to reduce undetected error.
method Adaptive algorithm PGWS that optimally uses abstention budget.
result Introducing any positive abstention budget induces an exponential decay in undetected error probability.

Study efficient neural operator learning using variation spaces.

problem Operator learning using encoder-decoder neural networks.
method Introduce variation space for nonlinear operators, establish approximation bounds.
result Algebraic approximation and learning rates for polynomially decaying input and output encoding errors.

The paper establishes curvature estimates for solitons in higher dimensions.

problem Curvature estimates for steady and expanding solitons in higher dimensions.
method Curvature estimates using gradient Ricci solitons and integral estimates.
result Curvature operator decays at specific rates for different cases of solitons.

Unified analysis of kernel-based and locally adaptive bandit optimization methods.

problem Performance of bandit optimization algorithms in RKHS functions.
method Investigates the relationship between kernel regularity and algorithmic performance, characterizing spectral properties of various kernels.
result Unified framework for analyzing kernel-based and locally adaptive bandit algorithms, deriving explicit regret bounds.

This work improves polynomial approximations for functions with asymmetric behavior.

problem Efficiently approximating functions with asymmetric behavior, especially those growing unbounded on one side.
method Introduces weighted deep polynomial approximants that combine learnable deep polynomials with one-sided weights.
result Weighted deep polynomial approximants outperform existing methods in approximating functions with asymmetric behavior.

New method models fat-tailed distributions with anisotropic tail-adaptive flows.

problem Gaussian-based variational inference fails to accurately capture tail decay in fat-tailed distributions.
method Improved theory on tails of flows, developed anisotropic tail-adaptive flows (ATAF).
result ATAF models tail-anisotropy, outperforming prior work on synthetic and real-world targets.

We consider solutions to the linear wave equation gφ=0\Box_gφ=0 on a non-extremal maximally extended Schwarzschild-de Sitter spacetime arising from arbitrary smooth initial data prescribed on an arbitrary Cauchy hypersurface. (In particular, no symmetry is assumed on initial data, and the support of the solutions may con…

2007-09-18abs ↗pdf ↗

We prove boundedness and polynomial decay statements for solutions to the spin ±1\pm1 Teukolsky-type equation projected to the =1\ell=1 spherical harmonic on Reissner-Nordström spacetime. The equation is verified by a gauge-invariant quantity which we identify and which involves the electromagnetic and curvature tensor…

2018-12-06abs ↗pdf ↗

As the success of deep learning reaches more grounds, one would like to also envision the potential limits of deep learning. This paper gives a first set of results proving that certain deep learning algorithms fail at learning certain efficiently learnable functions. The results put forward a notion of cross-predictab…

2018-12-16abs ↗pdf ↗