We consider a model for linear transient price impact for multiple assets that takes cross-asset impact into account. Our main goal is to single out properties that need to be imposed on the decay kernel so that the model admits well-behaved optimal trade execution strategies. We first show that the existence of such s…
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
48 results for “Decaying kernel”
Constructs index for elliptic operators using rapidly decaying kernels.
problem Index of elliptic operators in Fréchet algebra.
method Uses heat operators and heat kernel asymptotics.
result Index can be represented by an idempotent involving heat operators.
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 …
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.
Estimates kernel eigenvalues for compositional dot-product kernels.
problem Improving estimates for kernel eigenvalues.
method Eigenvalue decay estimates of integral operators associated with dot-product kernels.
result Improved estimates for kernel volumes in reproducing kernel Hilbert spaces.
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.
Generalization Error Rates in Kernel Regression: The Crossover from the Noiseless to Noisy Regimestat.ML
The study examines Kernel Ridge Regression error rates across noiseless and noisy conditions.
problem Characterizing Kernel Ridge Regression error rates in different noise levels.
method Unified analysis of Kernel Ridge Regression under various noise and regularization conditions.
result A crossover from noiseless to noisy error rates is observed as sample complexity increases.
Generalizes neural tangent kernel analysis for two-layer networks with noise and regularization.
problem Limitations of NTK analysis in deep learning practice.
method Generalized NTK analysis for two-layer neural networks with weight decay and gradient noise.
result Noisy gradient descent with weight decay exhibits 'kernel-like' behavior and converges linearly.
The paper proves existence and growth estimates for inverse mean curvature flow and related -Laplacian Green kernel decay.
problem Existence and growth estimates for inverse mean curvature flow.
method Proving new decay estimates for the Green kernel of the -Laplacian.
result Existence and optimal growth estimates for the weak inverse mean curvature flow.
Deep ReLU networks approximate as well as shallow ones in kernel regimes.
problem Understanding the limitations of kernel methods for deep ReLU networks.
method Characterizing eigenvalue decays of kernels derived from deep ReLU networks.
result Deep ReLU networks and shallow two-layer networks have equivalent approximation properties in kernel regimes.
New method for spectral and Bergman kernels under local spectral gap condition.
problem Analyzing spectral and Bergman kernels for complex manifolds.
method Developed a new scaling method to study spectral and Bergman kernels.
result Established pointwise asymptotics of spectral and Bergman kernels.
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.
We investigate if kernel regularization methods can achieve minimax convergence rates over a source condition regularity assumption for the target function. These questions have been considered in past literature, but only under specific assumptions about the decay, typically polynomial, of the spectrum of the the kern…
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.
Study derives error decay rates for kernel classification under source and capacity conditions.
problem Understanding prediction error decay rates for real data sets.
method Derived decay rates for misclassification error under Gaussian design for SVM and ridge classification.
result Rates accurately describe learning curves for data sets satisfying source and capacity conditions.
High-dimensional kernel regression struggles due to rotational invariance.
problem Kernel ridge regression struggles in high dimensions due to rotational invariance.
method Analysis of kernel properties and their impact on high-dimensional data.
result Lower bound on generalization error for high-dimensional kernel regression.
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.
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…
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.
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.
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 give a purely complex geometric proof of the existence of the Bergman kernel expansion. Our method provides a sharper estimate, and in the case that the metrics are real analytic, we prove that the remainder decays faster than any polynomial.
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.
Approximation beats concentration? An approximation view on inference with smooth radial kernelscs.LG
Positive definite kernels and their associated Reproducing Kernel Hilbert Spaces provide a mathematically compelling and practically competitive framework for learning from data. In this paper we take the approximation theory point of view to explore various aspects of smooth kernels related to their inferential proper…
Explicit formula for Bergman kernel of abelian varieties proved.
problem Explicit formula for Bergman kernel of polarized abelian varieties.
method Explicit formula for Bergman kernel of polarized abelian varieties.
result Explicit formula for Bergman kernel of polarized abelian varieties.
New framework estimates eigenvalues of kernel matrices without full matrix construction.
problem Estimating eigenvalues of large kernel matrices efficiently.
method Eigenvalue quantile estimation framework for kernel matrices with quick decay.
result Validates framework with empirical evidence and proves interlacing theorem.
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…
Given two sets of independent samples from unknown distributions and , a two-sample test decides whether to reject the null hypothesis that . 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…
SKI speeds up Toeplitz Neural Networks by avoiding explicit decay bias and using frequency response.
problem Efficiently compute and update Toeplitz matrices in neural networks.
method Sparse plus low-rank decomposition, asymmetric SKI, frequency response modeling.
result Achieved significant speedup with minimal performance loss.
In this paper, we give a new sharp generalization bound of lp-MKL which is a generalized framework of multiple kernel learning (MKL) and imposes lp-mixed-norm regularization instead of l1-mixed-norm regularization. We utilize localization techniques to obtain the sharp learning rate. The bound is characterized by the d…
Kernel interpolation is inconsistent for norms with smoothness above a constant.
problem Inconsistency of kernel interpolation in reproducing kernel Hilbert spaces.
method Lower bounds for generalization error in Sobolev norms.
result Kernel interpolation is always inconsistent for norms with smoothness above a constant.
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 …
We give a short proof of a strong version of the short time asymptotic expansion of heat kernels associated to Laplace type operators acting on sections of vector bundles over compact Riemannian manifolds, including exponential decay of the difference of the approximate heat kernel and the true heat kernel. We use this…
Empirical study compares wide neural networks to kernel methods, resolving open questions.
problem Understanding the relationship between wide neural networks and kernel methods.
method Large-scale empirical study using various neural network architectures and kernel methods.
result Wide neural networks outperform fully-connected finite-width networks in some cases, but underperform convolutional finite-width networks.
We characterize the asymptotic performance of nonparametric goodness of fit testing. The exponential decay rate of the type-II error probability is used as the asymptotic performance metric, and a test is optimal if it achieves the maximum rate subject to a constant level constraint on the type-I error probability. We …
We give upper bounds for the Bergman kernels associated to tensor powers of a smooth positive line bundle in terms of the rate of growth of the Taylor coefficients of the Kähler potential. As applications, we obtain improved off-diagonal rate of decay for the classes of analytic, quasi-analytic, and more generally Gevr…
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.
Paper uses DDPG to learn optimal execution strategies in dynamic markets.
problem Learning non-Markovian optimal execution strategies in dynamic financial markets.
method Introduces a novel actor-critic algorithm based on DDPG for transient price impact modeling.
result Successfully approximates optimal execution strategy through numerical experiments.
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.
We analyze the size of the dictionary constructed from online kernel sparsification, using a novel formula that expresses the expected determinant of the kernel Gram matrix in terms of the eigenvalues of the covariance operator. Using this formula, we are able to connect the cardinality of the dictionary with the eigen…
The Tick library simulates and learns Hawkes processes with latency effects.
problem Correctly modeling causality in order book events with latency.
method Exponential kernels shifted by latency, derived log-likelihood expressions.
result Latency determines most decays in real data, showing decay relationships.
One-shot algorithm for feature-distributed kernel PCA reduces communication costs.
problem Efficiently perform kernel PCA in distributed computing environments.
method Inspired by dual relationship between sample-distributed and feature-distributed scenarios, proposes a one-shot algorithm for feature-distributed kernel PCA.
result The algorithm provides high-quality results with low communication costs, especially when eigenvalues decay fast.
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…
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.
In the absence of explicit regularization, Kernel "Ridgeless" Regression with nonlinear kernels has the potential to fit the training data perfectly. It has been observed empirically, however, that such interpolated solutions can still generalize well on test data. We isolate a phenomenon of implicit regularization for…
We derive an upper bound on the local Rademacher complexity of -norm multiple kernel learning, which yields a tighter excess risk bound than global approaches. Previous local approaches aimed at analyzed the case only while our analysis covers all cases , assuming the different feature …
Novel heat flow estimates on ALE manifolds for Schrödinger operators.
problem Estimating heat flows on ALE manifolds with non-trivial -kernel.
method Combining Fredholm theory for Dirac type operators and heat kernel advances.
result Established decay estimates for heat flows.