# Subsampling for supervised learning in reproducing kernel Hilbert spaces

arXiv: https://arxiv.org/abs/2606.21260 · HTML: https://mlsanity.com/paper/2606.21260/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 50 references that are in the map.
- First posted on arXiv 19 Jun 2026.

## Abstract (arXiv)

In the era of big data, subsampling became a common practice in statistical learning. By selecting a subgroup of individuals based on which the learner is trained, subsampling aims at reducing the computational cost and time of the estimation step, and ideally leads to a decrease of its energy consumption and carbon footprint. This work focuses on a nonparametric setting, in which the hypotheses set lies in a reproducing kernel Hilbert space, and the estimator is a minimizer of an empirical risk reweighted `a la Horvitz-Thompson. By studying the asymptotic properties of this estimator, we reveal an optimal subsampling scheme (regarding the trace of the covariance operator) and show that it can be used via plug-in. A numerical study on synthetic and real-world datasets shows the practicability and the benefit of the proposed approach.