← Back to all news
arXiv Machine Learning By Martin Rouault, R\'emi Bardenet, Myl\`ene Ma\"ida

Monte Carlo with kernel-based Gibbs measures: Guarantees for probabilistic herding

Read the original on arXiv Machine Learning →

arXiv:2402. 11736v3 Announce Type: replace Abstract: Kernel herding belongs to a family of deterministic quadratures that seek to minimize the maximum mean discrepancy (MMD), that is, the worst-case integration error over a reproducing kernel Hilbert space (RKHS).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jun 16

Amortized mean-shift interacting particles

arXiv:2606. 15871v1 Announce Type: cross Abstract: Bayesian inference for inverse problems is run to evaluate integrals -- posterior expectations, tail probabilities, and risks -- across a stream of observations.

By Ali Siahkoohi
More like this →
arXiv Statistics ML
Aug 26

A Non-asymptotic Analysis for Learning and Applying a Preconditioner in MCMC

The paper presents a non‑asymptotic analysis of Markov chain Monte Carlo (MCMC) algorithms that learn and apply a preconditioner based on either the target covariance or the expected Hessian of the target potential. It compares the finite‑time computational costs of these preconditioned schemes with unpreconditioned counterparts, providing guarantees for algorithms such as the Unadjusted Langevin Algorithm (ULA) and the proximal sampler. The analysis relies on a contraction assumption in the Wasserstein‑2 distance to formalize approximate independence and bridge modern MCMC theory with classical effective sample size heuristics.

By Max Hird, Florian Maire, Jeffrey Negrea
More like this →