arXiv Statistics ML

MiNCE: Nonparametric, Strongly Consistent Confidence Envelopes for Band-Limited Functions and their Smoothed Spectra

The paper introduces MiNCE, a nonparametric framework for constructing minimum‑norm confidence envelopes that provide nonasymptotic, simultaneous confidence regions for band‑limited functions using Reproducing Kernel Hilbert Spaces. It proves strong uniform consistency of these envelopes for both noise‑free and noisy data under mild noise assumptions, and extends the results to the frequency domain to yield consistent confidence bands for smoothed spectra. Numerical experiments in nonparametric regression and spectral estimation confirm the theoretical findings, showing the envelopes contract toward the target function as sample size grows.

arXiv Machine Learning
Jul 28

Minimax Lower Bounds of Kernel Discrepancy Estimation: MMD, HSIC, KSD

arXiv:2607. 24235v1 Announce Type: cross Abstract: Over the past 20 years, kernel discrepancies have been leveraged as a highly powerful tool for quantifying the disagreement of distributions, with numerous successful applications in two-sample, goodness-of-fit, and independence testing, among others.

By Jose Cribeiro-Ramallo, Florian Kalinke, Zolt\'an Szab\'o
arXiv Machine Learning
Aug 28

Gaussian Processes and Reproducing Kernel Hilbert Spaces: Connections and Equivalences

The monograph explores the relationships between Gaussian processes and reproducing kernel Hilbert spaces (RKHS), two widely used approaches that rely on positive definite kernels. It examines how these frameworks connect and are equivalent across key topics such as regression, interpolation, numerical integration, distributional discrepancies, statistical dependence, and Gaussian process sample path properties. By establishing a unifying perspective based on the equivalence between the Gaussian Hilbert space and the RKHS, the work aims to bridge methods developed independently by the machine learning, statistics, and numerical analysis communities.

By Motonobu Kanagawa, Philipp Hennig, Dino Sejdinovic, Bharath K. Sriperumbudur
arXiv Machine Learning
Jul 9

Approximate full conformal prediction in an RKHS

arXiv:2601. 13102v3 Announce Type: replace-cross Abstract: Full conformal prediction is a framework that implicitly formulates distribution-free confidence prediction regions for a wide range of estimators.

By Davidson Lova Razafindrakoto, Alain Celisse, J\'er\^ome Lacaille