Optimally-weighted Estimators of the Maximum Mean Discrepancy for Likelihood-Free Inference

Ayush Bharti, Masha Naslidnyk, Oscar Key, Samuel Kaski, F. Briol
2/12/2026

No official code found. Best implementation: bharti-ayush/optimally-weighted_MMD (5 stars, last commit 2023-02-02).

Abstract

Likelihood-free inference methods typically make use of a distance between simulated and real data. A common example is the maximum mean discrepancy (MMD), which has previously been used for approximate Bayesian computation, minimum distance estimation, generalised Bayesian inference, and within the nonparametric learning framework. The MMD is commonly estimated at a root-$m$ rate, where $m$ is the number of simulated samples. This can lead to significant computational challenges since a large $m$ is required to obtain an accurate estimate, which is crucial for parameter estimation. In this paper, we propose a novel estimator for the MMD with significantly improved sample complexity. The estimator is particularly well suited for computationally expensive smooth simulators with low- to mid-dimensional inputs. This claim is supported through both theoretical results and an extensive simulation study on benchmark simulators.

View on arXivView PDF

Code Implementations(1)

50Python, Jupyter NotebookJan 30, 20233 years agoNOASSERTION

Similar Papers

Cite this paper

@article{bharti2026optimallyweighted,
  title  = {Optimally-weighted Estimators of the Maximum Mean Discrepancy for Likelihood-Free Inference},
  author = {Ayush Bharti and Masha Naslidnyk and Oscar Key and Samuel Kaski and F. Briol},
  year   = {2026},
  eprint = {2301.11674},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2301.11674},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.11674.svg)](https://codeofpaper.com/paper/2301.11674)

Discussion