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

Trend · papers per month

72144215287 · Jun 202019922001200920172026
48 results for integral kernels

The paper provides consistency results for KDE on manifolds with irregular kernels.

problem Analyzing density estimation on manifolds with complex kernels.
method Strong uniform consistency with rates for KDE on Riemannian manifolds with Riemann integrable kernels.
result Strong uniform consistency with rates for KDE on manifolds.

Study integral kernels on complex symmetric spaces and their Dyson Brownian Motion applications.

problem Analysis of integral kernels on complex symmetric spaces.
method Simple new method of alternating sum formulas to construct WW-invariant kernels and their asymptotic behavior.
result Obtained asymptotic behavior of integral kernels and applied to Dyson Brownian Motion.

A new model DKMPP integrates covariates and uses an integration-free method for spatio-temporal point processes.

problem Training intractable deep spatio-temporal point processes with multimodal covariates.
method DKMPP uses a deep kernel to model complex relationships and an integration-free score matching method.
result DKMPP and score-based estimators outperform baseline models in spatio-temporal point processes.

NKI integrates obfuscated datasets using nonlinear kernels for improved data collaboration.

problem Privacy-preserving data collaboration with reduced reconstruction risk.
method Formulates linear kernel integration, kernelizes it, and introduces graph regularization and centering constraints.
result NKI improves classification accuracy over existing linear integration methods under nonlinear dimensionality reduction.

Proposes a new feature preprocessing method using kernel density integral transformation.

problem Feature preprocessing for tabular data in machine learning and statistics.
method Kernel density integral transformation as a drop-in replacement or improved alternative to min-max scaling and quantile transformation.
result Frequently outperforms min-max scaling and quantile transformation with hyperparameter tuning.

A new simulation method for Volterra processes improves convergence for rough kernels.

problem Simulating Volterra processes with singular kernels.
method iVi (integrated Volterra implicit) scheme based on Inverse Gaussian distribution.
result The iVi scheme achieves weak convergence with few time steps, especially for rough kernels.

The paper studies Lipschitz bounds for integral kernels under differentiability assumptions.

problem Understanding the Lipschitz continuity of feature maps associated with integral kernels.
method Analyzes differentiability assumptions to derive explicit formulas for Lipschitz constants and conditions for non-Lipschitz continuity.
result Explicit formulas and conditions for Lipschitz continuity of feature maps associated with various kernels.

We show that the logarithmic derivatives of the convolution heat kernels on a uni-modular Lie group are exponentially integrable. This result is then used to prove an "integrated" Harnack inequality for these heat kernels. It is shown that this integrated Harnack inequality is equivalent to a version of Wang's Harnack …

2007-11-28abs ↗pdf ↗

We consider the problem of improving kernel approximation via randomized feature maps. These maps arise as Monte Carlo approximation to integral representations of kernel functions and scale up kernel methods for larger datasets. Based on an efficient numerical integration technique, we propose a unifying approach that…

2018-02-11abs ↗pdf ↗

The paper introduces new estimators for multivariate functions using Fourier methods.

problem Estimating multivariate functions like densities and regression functions.
method Monte Carlo estimators based on the Fourier integral theorem.
result Established rates of convergence for new estimators, often superior to existing methods.

Improved estimation of higher order integrals using shrinkage techniques.

problem Estimating higher order Bochner integrals in non-parametric settings.
method Shrinkage of U-statistic towards a target element, considering kernel degeneracy.
result Consistent shrinkage estimators with fast rates of convergence, even for non-degenerate kernels.

Quantitative Sobolev extensions lead to Neumann heat kernel bounds.

problem Bounding Neumann heat kernels for domains with integral Ricci curvature.
method Quantitative Sobolev extension operators and Neumann heat kernel estimates.
result Uniform bounds on Neumann heat kernels and eigenvalues.

Kernel thinning compresses distributions more effectively than i.i.d. sampling or standard thinning.

problem Efficiently compressing distributions for better sampling and integration accuracy.
method Introduces kernel thinning, a procedure that compresses an n-point approximation of a distribution into a sqrt(n)-point approximation with comparable integration error.
result Kernel thinning achieves a maximum discrepancy in integration error of O_d(n^(-1/2) sqrt(log n)) in probability for compactly supported distributions and O_d(n^(-1/2) (log n)^(d+1/2) sqrt(log log n)) for sub-exponential distributions.

In this survey article, we review the relation between heat kernels and path integrals. In particular, we review recent results on the approximation of the Wiener measure on compact manifold by measures on (finite-dimensional) spaces of piece-wise geodesics.

2018-10-18abs ↗pdf ↗

Enhanced kernel ridgeless regression improves performance with LAB RBF kernels.

problem Lack of flexibility in kernel ridgeless regression.
method Locally-Adaptive-Bandwidths (LAB) RBF kernels and kernel learning techniques.
result Functions learned from LAB RBF kernels belong to an integral space of RKHSs, demonstrating robust generalization.

Kernel methods summarize and integrate posterior similarity matrices from Bayesian clustering.

problem Summarizing and integrating posterior similarity matrices from Bayesian clustering.
method Positive semi-definite PSMs, kernel matrices, kernel methods, combining kernels.
result Kernel methods effectively summarize and integrate posterior similarity matrices.

Study examines boundedness of oscillating singular integrals on specific Lie groups.

problem Investigating boundedness of oscillating singular integrals on Lie groups of polynomial growth.
method Presented kernel criteria in terms of sub-Riemannian structure and Fourier analysis.
result Extended classical oscillating conditions for boundedness of oscillating convolution operators.

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.

Coercivity condition ensures learning of interacting particle systems.

problem Ensuring identifiability of interaction functions in learning systems of interacting particles.
method Equivalence of coercivity condition to strictly positive definiteness of an integral kernel.
result For ergodic systems, the integral kernel is strictly positive definite, satisfying the coercivity condition.

Deep kernel learning refers to a Gaussian process that incorporates neural networks to improve the modelling of complex functions. We present a method that makes this approach feasible for problems where the data consists of line integral measurements of the target function. The performance is illustrated on computed t…

2019-09-04abs ↗pdf ↗

Paper proposes adaptive parameter selection for KGD algorithms.

problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.

We propose a representation of Gaussian processes (GPs) based on powers of the integral operator defined by a kernel function, we call these stochastic processes integral Gaussian processes (IGPs). Sample paths from IGPs are functions contained within the reproducing kernel Hilbert space (RKHS) defined by the kernel fu…

2018-02-21abs ↗pdf ↗

Kernel method embeds noisy datasets, capturing shared structures.

problem Limited power in capturing nonlinear structures, noisiness, high-dimensionality, and interpretability issues.
method Kernel spectral joint embeddings using duo-landmark integral operators.
result Consistent recovery of low-dimensional noiseless signals and convergence to eigenfunctions of integral operators.

Study small-time CLTs for stochastic Volterra equations with various kernels.

problem Understanding the behavior of stochastic Volterra equations with different kernels.
method Proved convergence of finite-dimensional distributions, functional CLT, and limit theorems for smooth transformations.
result Derived asymptotic pricing formulae for digital calls in rough volatility models.

New method interpolates high-dimensional scattered data using kernel theory.

problem Scattered data in high-dimensional spaces defy traditional distributional assumptions.
method Kernel interpolation framework based on integral operator theory.
result Spectra of kernel matrices predict performance of interpolation methods.

This thesis improves kernel-based distances for statistical inference and integration.

problem Efficiently measuring distances between probability distributions for robust and smooth modeling.
method Kernel-based distances, focusing on maximum mean discrepancy (MMD) and novel kernel quantile discrepancies.
result Improved MMD estimators for simulation-based inference and conditional expectations.

TAKDE optimizes kernel density estimation for real-time dynamic processes.

problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.

The paper improves probabilistic herding methods using Gibbs distributions.

problem Improving integration accuracy over Monte Carlo quadrature in infinite-dimensional RKHS.
method Developed a Gibbs distribution over quadrature nodes to minimize MMD.
result The Gibbs distribution outperforms i.i.d. Monte Carlo in integration accuracy.

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.

Paper provides unbiased spectral moment estimates from finite data.

problem Challenges in estimating spectral moments from limited data.
method Dynamic programming approach to estimate spectral moments of kernel integral operator.
result Demonstrates consistency with theoretical spectra and practical utility in neural networks.

Study proves optimal controls for stochastic Volterra equations with singular kernels.

problem Existence of optimal controls for stochastic Volterra equations with singular kernels.
method Sufficient conditions based on integrability and growth hypotheses.
result Existence of optimal relaxed and strict controls under classical convexity assumptions.