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

58116174232 · May 202619922001200920172026
48 results for exponential decay kernel

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.

Study on U-statistics with heavy-tailed samples, providing tail bounds and LDP.

problem Deviation of U-statistics with heavy-tailed samples.
method Exponential tail bounds and Large Deviation Principle (LDP) for U-statistics.
result Obtained an exponential upper bound for U-statistics tail decay, showing two regions of decay.

Study on biharmonic heat equation on manifolds with curvature constraints.

problem Analyzing entire solutions of biharmonic heat equation on manifolds.
method Exponential decay estimates for biharmonic heat kernel under Ricci curvature and noncollapsing conditions. Proving uniqueness criteria for Cauchy problem.
result Conservation law for biharmonic heat kernel and uniform L-infinity estimate for entire solutions.

Parameterized state space models in the form of recurrent networks are often used in machine learning to learn from data streams exhibiting temporal dependencies. To break the black box nature of such models it is important to understand the dynamical features of the input driving time series that are formed in the sta…

2019-07-15abs ↗pdf ↗

Given two sets of independent samples from unknown distributions PP and QQ, a two-sample test decides whether to reject the null hypothesis that P=QP=Q. Recent attention has focused on kernel two-sample tests as the test statistics are easy to compute, converge fast, and have low bias with their finite sample estimate…

2018-02-23abs ↗pdf ↗

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.

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.

We study the asymptotic behavior of the generalized Bergman kernel of the renormalized Bochner-Laplacian on high tensor powers of a positive line bundle on a symplectic manifold of bounded geometry. First, we establish the off-diagonal exponential estimate for the generalized Bergman kernel. As an application, we obtai…

2018-06-17abs ↗pdf ↗

We show that under very general assumptions the partial Bergman kernel function of sections vanishing along an analytic hypersurface has exponential decay in a neighborhood of the vanishing locus. Considering an ample line bundle, we obtain a uniform estimate of the Bergman kernel function associated to a singular metr…

2016-01-03abs ↗pdf ↗

We develop heat kernel and Green's function estimates for manifolds with positive bottom spectrum. The results are then used to establish existence and sharp estimates of the solution to the Poisson equation on such manifolds with Ricci curvature bounded below. As an application, we show that the curvature of a steady …

2017-01-11abs ↗pdf ↗

The study analyzes prediction errors in systems with memory kernels, providing bounds and stability results.

problem Prediction errors in stochastic dynamical systems with memory kernels.
method Analysis of generalized Langevin equations (GLEs) with Volterra equations, integrating synchronized noise coupling and weighted norms.
result Prediction discrepancies decay at a rate determined by the memory kernel's decay, quantitatively bounded by kernel estimation errors.

Global stability proved for Navier-Stokes equations on hyperbolic space.

problem Stability of the Navier-Stokes equations on hyperbolic space.
method Proved global stability with exponential decay rate for small initial data.
result Exponential decay rate of $μλ_\Def^{(3)}$ for Navier-Stokes equations on hyperbolic space.

Paper analyzes SGD in kernel regression, showing it outperforms offline methods.

problem Performance of SGD in kernel regression compared to offline methods.
method Analyzes Stochastic Gradient Descent (SGD) in kernel regression under misspecified models.
result SGD achieves min-max optimal rates up to constants, avoiding saturation.

Two new algorithms reduce online kernel regression's computational cost while maintaining optimal regret bounds.

problem Trade-off between regret and computational cost in online kernel regression.
method AOGD-ALD and NONS-ALD algorithms dynamically maintain nearly orthogonal basis to approximate kernel mapping and control approximate error.
result Achieves nearly optimal regret bounds at sublinear computational complexity.

We discover scaling laws for kernel regression loss under various learning rate schedules.

problem Understanding loss dynamics and learning rate schedules in kernel regression.
method Theoretical analysis of stochastic gradient descent on a power-law kernel regression model.
result Established a Functional Scaling Law (FSL) capturing the full loss trajectory under arbitrary learning rate schedules.

This paper studies the optimality of kernel methods in high-dimensional data clustering. Recent works have studied the large sample performance of kernel clustering in the high-dimensional regime, where Euclidean distance becomes less informative. However, it is unknown whether popular methods, such as kernel k-means, …

2019-12-01abs ↗pdf ↗

LOBRM model recreates limit order books from trade and quote data.

problem Lack of LOB data and limitations in LOBRM model.
method Extended LOBRM with time-weighted z-score standardization and exponential decay kernel, conducted in chronological order.
result LOBRM with decay kernel outperforms traditional models and module ensembling is effective.

New quantization methods improve accuracy of Random Fourier Features.

problem Improving accuracy of Random Fourier Features for machine learning.
method Sigma-Delta and distributed noise-shaping quantization methods for 1-bit and low bit-depth quantization.
result Quantized RFFs allow high accuracy approximation of underlying kernels with polynomial error decay.

A random walk wnw_n on a separable, geodesic hyperbolic metric space XX converges to the boundary X\partial 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 …

2017-10-14abs ↗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.

We show that the probability that a finitely supported random walk on a non-elementary subgroup of the the mapping class group gives a non-pseudo-Anosov element decays exponentially in the length of the random walk. More generally, we show that if R is a set of mapping class group elements with an upper bound on their …

2011-04-29abs ↗pdf ↗

Study Hilbert's projective metric for bounded growth functions leading to Sinkhorn's algorithm convergence.

problem Optimal transport in unbounded settings with heavy-tailed distributions.
method Hilbert's projective metric for integrable functions of bounded growth, kernel integral operators as contractions.
result Exponential convergence of Sinkhorn's algorithm for light-tailed marginal distributions.

This work studies nonnegativity-preserving kernels for stochastic equations and their applications.

problem Nonnegativity preservation in stochastic Volterra equations and related processes.
method Characterization and application of completely monotone kernels; approximation schemes for weak error.
result Positive linear combinations of decaying exponentials can be used for second-order approximation schemes.

AdamNX improves Adam's stability by adjusting its learning rate.

problem Adam's tendency to converge to non-flat minima in large-scale models.
method Proposes a novel exponential decay mechanism for Adam's second-order moment estimate.
result AdamNX outperforms Adam and its variants in stability and performance.

Paper calculates eigenvalue decay rates for neural network kernels on general domains.

problem Determining eigenvalue decay rates for neural network kernels on arbitrary domains.
method Proved dynamics of wide neural networks approximates NTK on general domains, used minimax optimality and interpolation spaces.
result Provided strategy to calculate eigenvalue decay rates for neural network kernels.

Kernel Density Estimation is a very popular technique of approximating a density function from samples. The accuracy is generally well-understood and depends, roughly speaking, on the kernel decay and local smoothness of the true density. However concrete statements in the literature are often invoked in very specific …

2019-01-02abs ↗pdf ↗

Laplace kernel and Neural Tangent Kernels are shown to be nearly identical for normalized data.

problem Understanding the similarity between Laplace and Neural Tangent Kernels.
method Theoretical analysis and experiments on normalized data.
result Laplace kernel and Neural Tangent Kernels have nearly identical eigenfunctions and RKHS for normalized data.

Unified framework for analyzing gradient flows of measures with exponential decay of entropy.

problem Analyzing exponential decay of entropy functionals in gradient flows of measures.
method Characterization of global exponential decay behaviors using Hellinger-Kantorovich geometry, shape-mass decomposition, and Polyak-Łojasiewicz-type inequalities.
result Unified theoretical framework for gradient flows with complete analysis of exponential decay behaviors.

Study on Wasserstein gradient flow for MMD between Coulomb measures.

problem Analyzing the long-time behavior of MMD between probability and target measures using Coulomb kernels.
method Existence of global weak solutions, ultracontractive estimate, regularity analysis, exponential decay proof, defective Polyak-Lojasiewicz inequality.
result Exponential decay of squared MMD toward a uniformly positive target measure on flat torus.

New exponential decay estimate for Hermitian Yang-Mills metrics near branch points.

problem Understanding the behavior of Hermitian Yang-Mills metrics near branch points.
method Local radial solutions, global gluing construction, exponential estimate near branch points.
result Exponential decay estimate for local radial solutions near branch points.

Estimates covariance matrices with correlations between samples.

problem Estimating large-dimensional covariance matrices with correlated samples.
method Generalized Marcenko-Pastur equation and Ledoit-Peche shrinkage estimator using random matrix theory and free probability. Developed an efficient algorithm based on Ledoit-Wolf kernel estimation.
result Efficient algorithm for estimating large covariance matrices with correlations.

We consider Hitchin's hyperkähler metric gL2g_{L^2} on the SU(n)SU(n)-Hitchin moduli space moduli space over a compact Riemann surface. We prove that the difference between the metric gL2g_{L^2} and a simpler "semiflat" hyperkähler metric gsfg_{\mathrm{sf}} is exponentially-decaying along generic rays in the Hitchin moduli s…

2018-10-03abs ↗pdf ↗

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.