Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herding
<|reference_start|>Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herding: Kernel herding belongs to a family of deterministic quadratures that seek to minimize the worst-case integration error over a reproducing kernel Hilbert space (RKHS). In spite of strong experimental support, it has revealed difficult to prove that this worst-case error decreases at a faster rate than the standard square root of the number of quadrature nodes, at least in the usual case where the RKHS is infinite-dimensional. In this theoretical paper, we study a joint probability distribution over quadrature nodes, whose support tends to minimize the same worst-case error as kernel herding. We prove that it does outperform i.i.d. Monte Carlo, in the sense of coming with a tighter concentration inequality on the worst-case integration error. While not improving the rate yet, this demonstrates that the mathematical tools of the study of Gibbs measures can help understand to what extent kernel herding and its variants improve on computationally cheaper methods. Moreover, we provide early experimental evidence that a faster rate of convergence, though not worst-case, is likely.<|reference_end|>
@article{rouault2024monte,
    title={Monte Carlo with kernel-based Gibbs measures: Guarantees for
  probabilistic herding},
    author={Martin Rouault, R'emi Bardenet, Myl`ene Ma"ida},
    journal={arXiv preprint arXiv:2402.11736},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.11736},
    primaryClass={cs.LG math.PR stat.ML}
}