alphaFeedback

WorksMathematics

MiniMMD: Minimization of MMD for Sampling, Inference and Integration

AI contributions
Not recorded for this paper
View details
Ancillary data
3 code links
View

Abstract

Many problems in computational statistics and machine learning can be formulated as approximating a target distribution by minimizing a discrepancy over a restricted class of candidate distributions. This minimum-discrepancy viewpoint appears, for example, in numerical integration, sampling, generative modelling, and statistical inference, but these instances are often studied separately in the literature. This thesis develops the first unified treatment of these many problems through the minimization of the maximum mean discrepancy (MMD), a kernel-based discrepancy between probability measures. The central theme is that MMD is not only a statistically meaningful distance between probability distributions, but also a tractable optimization objective to design practical and efficient algorithms. This thesis summarizes the recent theoretical and empirical advancements of such minimum-MMD based algorithms.

PhD thesis 2026

Acknowledgements

I would like to thank my supervisors, François-Xavier Briol and Arthur Gretton, for their guidance on how to do sound research, how to become an independent researcher, and how to develop good taste in scientific problems. Arthur told me at the start of my PhD that the best way to learn a field is to write a paper on it; this has motivated me to explore many different areas. FX taught me to write with the audience always in mind; this has also become a habit of mine, although I am still working hard to do it as well as he does. Beyond research, I have learned a great deal from both of you about academic life more broadly. You have been the best possible combination of supervisors I could have hoped for. I am also grateful to Zhu Michael Li and Pierre Glaser, who acted as unofficial supervisors at the beginning of my PhD and taught me how to read and write proper proofs, almost hand by hand. Without their tutorials, my understanding of kernel methods are largely limited to linear algebra. I am especially grateful to Zhu Michael Li for his introducing me to many different pubs and restaurants around the Gatsby building. I would also like to thank Anna Korba, Lester Mackey, Chris Oates, Bharath K. Sriperumbudur, and Taiji Suzuki for their advice and support during our collaborations. Although they were not my official supervisors, they have had a substantial influence on my research taste and outlook. My three-month internship at RIKEN in Tokyo was one of the most unforgettable experiences of my PhD. Tokyo is an amazing city, and I hope to visit it again.

I would like to thank my other collaborators, Xiaoyuan Cheng, Ruocheng Guo, Heishiro Kanagawa, Sophia Kang, Toni Karvonen, Yang Liu, Dimitri Meunier, Aratrika Mustafi, Masha Naslidnyk, Atsushi Nitanda, Louis Sharrock, Zikai Steve Shen, Ingo Steinwart, Chenyang Tian, and Jean-François Ton. This thesis would not have been possible without your assistance and contributions. I am grateful to Kevin Han Huang for introducing me to friends from Warwick and for being willing to talk with me during some of my most difficult moments, and to Zhuo Sun, Jiaye Teng, and Zhiheng Zhang for introducing me to many academic friends in Shanghai. I am also grateful to Ben Dai, Fanghui Liu, Lei Shi, Weijie Su, and Lei Wu for giving me valuable advice on academic careers.

I would like to thank William Laplante for many wonderful evenings spent over hotpot and Biangbiang noodles. It has been amazing to meet someone from a completely different cultural background with whom I share so many personal traits. I am also grateful to the many people at the Gatsby Unit, including Hugh Dance, Peter Orbanz, Yedi Zhang, and others whom I did not always have the courage to reach out and talk to. It has been a great pleasure to spend time at the Gatsby Unit. It is a genuinely wonderful place for research, and my time there will remain among my best memories. From the Foundational AI Centre, I would like to thank William Bankes, David Chanin, Boyu Chen, Tiantian He, Shuofei Qiao, Yuxuan Shu, Seongho Son, Jiayi Wang, Lorenz Wolf, Bin Wu, Tianqi Wu, Moucheng Xu, Ziming Xu, Zhuangjian Yang, Ning Zhang, Mingtian Zhang, and Caroline Zhu for the wonderful events, retreats, and time spent together. In particular, I would like to thank Bin Wu, Tianqi Wu, Ning Zhang, Zhuangjian Yang, and Ziming Xu for helping me recover my stolen iPhone. I would like to thank my friends from the Fundamentals of Statistical Machine Learning group (FSML) in the Department of Statistical Science at UCL. The regular Monday group meetings and lunches helped me keep track of my PhD progress and encouraged me to socialize with others. Such an atmosphere is very rare. I would also like to thank my office mates, Wei Bu, Simon Damm, Nicola Gnecco, Zheng He, Christopher Marunoi, and Matthew Tilley, for the inspiring conversations in the visitor office. I would like to thank my friends met in Tokyo, Wei Huang, Zhanpeng Zhou, Tom Wakayama, Sho Sonada, Dake Bu, Bingrui Li, and Charles, for all the interesting conversations during lunch and dinners. I would also like to thank Tim G. J. Ruder and Weizhong Zhang who have taken me all the way to this path of machine learning back in my undergraduate. I would like to thank my roommates, Hengyi Wang, Yuxiang Wu, and Zhengyao Jiang, for their support and for the time we spent together playing VR, Junqi, and watching NBA games. I hope our friendship will last forever.

Finally, I would like to thank my family. I am deeply grateful to my parents, BinWei Chen and Jun Wu, for their support throughout my childhood. During high school, my obsession with the Mathematical Olympiad placed a considerable financial burden on my family. Although this path was uncertain and, in many ways, unrealistic, my parents continued to support my dream. Without their trust and continuing support, I would not have had the confidence and courage to pursue a PhD. I am also deeply grateful to my grandparents, Guomei Dong and Qifa Wu, for taking such good care of me when I was young. I wish them good health, and I will always remember their love and care.

I would also like to thank my girlfriend Churong Peng, and soon-to-be wife at the time of writing this thesis, who may already be my wife by the time it is submitted. Her support has meant a great deal to me throughout my PhD. Our one-hour WeChat video calls were the happiest part of each day. I believe a happy future is ahead of us.

Chapter 1

Introduction

Comparing two probability distributions P\mathbb{P} and Q\mathbb{Q} is a central problem in computational statistics and machine learning. Historically, such comparisons have been used to test whether two distributions are equal from a collection of finite observations (Gretton et al., 2012; Sejdinovic et al., 2013; Schrab et al., 2023, 2022; Biggs et al., 2023; Schrab and Kim, 2024; Schrab, 2025). In modern applications, however, the goal is often not merely to decide whether two distributions differ, but to quantify and then minimize the discrepancy between a target distribution and a tractable model or approximation. This viewpoint appears in approximate inference (Blei et al., 2017), generative modelling (Arbel et al., 2019; Bi’nkowski et al., 2018), Bayesian computation (Robert and Casella, 2000; Briol et al., 2019a), statistical inference (Basu et al., 2011), and numerical integration (Davis and Rabinowitz, 2007; Briol et al., 2019a). It is also the organizing perspective of this thesis.

Among the many possible choices of divergence or discrepancy DD, one particularly appealing discrepancy measure is the maximum mean discrepancy (MMD) (Gretton et al., 2012), which is attractive for three main reasons: 1) flexibility: different choices of kernel induce different topologies on probability measures (Sriperumbudur et al., 2010; Barp et al., 2024); 2) computability: MMD admits explicit plug-in estimators from finite samples from both distributions (Gretton et al., 2012); 3) sample complexity: for some commonly-used kernels, its sample complexity does not suffer from the curse of dimensionality ((Gretton et al., 2012; Tolstikhin et al., 2016)). Together, these favourable statistical and computational properties make MMD useful for a wide class of algorithms that approximate or model a target distribution by minimizing a computable discrepancy.

This thesis studies this optimization problem for the squared MMD discrepancy, MMD⁡2(P,Q)\operatorname{MMD}^{2}(\mathbb{P}, \mathbb{Q}), minimizing with respect to P\mathbb{P} while Q\mathbb{Q} is a fixed but typically unknown target distribution. This discrepancy-minimization viewpoint appears in several recurring forms:

  • Numerical integration: suppose we wish to approximate an intractable integral ∫f(x)Q(dx)\int f(x)\mathbb{Q}(\mathrm{d}x), where Q\mathbb{Q} is a probability measure, using function evaluations at a fixed collection of points {xi}i=1N\{x_i\}_{i=1}^{N}. The question is how to choose weights {wi}i=1N\{w_i\}_{i=1}^{N} so that the weighted average ∑n=1Nwnf(xn)\sum_{n=1}^{N} w_n f(x_n) is accurate for a broad class of integrands ff. From a discrepancy-minimization perspective, this means choosing the weighted empirical measure ∑i=1Nwiδxi\sum_{i=1}^{N} w_i\delta_{x_i} to minimize its MMD distance from the integration measure Q\mathbb{Q} ((Karvonen and Särkkä, 2018b; Briol et al., 2019a)). Weights chosen in this way can yield integration errors that are much smaller than those of standard Monte Carlo, which uses uniform weights w1=⋯=wN=1/Nw_1 = \cdots= w_N = 1/N, for smooth integrands in low-to-moderate dimensions; this improvement is supported by both theory and empirical evidence ((Sommariva and Vianello, 2006; Briol et al., 2015, 2019b)). This weighted integration rule is known as kernel quadrature or Bayesian quadrature ((O’Hagan, 1991; Rasmussen and Ghahramani, 2002; Hennig et al., 2022)).

Numerical Integration

min⁡w1,…,wN∈RNMMD⁡2(∑i=1Nwiδxi,Q)\min_{w_1,\ldots,w_N\in\mathbb{R}^{N}} \operatorname{MMD}^{2}\left(\sum_{i=1}^{N} w_i\delta_{x_i},\mathbb{Q}\right)
  • Sampling, generative modelling, and coreset selection: the goal is to construct samples {xi}i=1N\{x_i\}_{i=1}^{N} whose empirical distribution 1N∑i=1Nδxi\frac{1}{N}\sum_{i=1}^{N}\delta_{x_i} approximates the target distribution Q\mathbb{Q}. From a discrepancy-minimization

perspective, this amounts to choosing the empirical measure 1N∑i=1Nδxi\frac{1}{N}\sum_{i=1}^{N}\delta_{x_i} to minimize its MMD discrepancy from Q\mathbb{Q}. When Q\mathbb{Q} is known up to its normalizing constant, this task is referred to as sampling (Chewi, 2026; Liu and Wang, 2016; Korba et al., 2020; Li et al., 2023b); when Q\mathbb{Q} is available only through i.i.d. samples, it is referred to as generative modelling (Li et al., 2017; Bi’nkowski et al., 2018; Arbel et al., 2019; Song et al., 2021) or coreset selection (Bachem et al., 2017; Chen et al., 2010; Mak and Joseph, 2018; Teymur et al., 2021; Shetty et al., 2022; Dwivedi and Mackey, 2024; Zhang et al., 2023a).

Sampling / Generative Modelling

min⁡x1,…,xNMMD⁡2(1N∑i=1Nδxi,Q)\min_{x_1,\ldots,x_N}\operatorname{MMD}^{2}\left(\frac{1}{N}\sum_{i=1}^{N}\delta_{x_i},\mathbb{Q}\right)
  • Statistical inference: given a model family {Pθ:θ∈Θ}\{\mathbb{P}_{\theta}:\theta\in\Theta\}, the goal is to estimate θ\theta by matching the model distribution Pθ\mathbb{P}_{\theta} to the data-generating distribution Q\mathbb{Q}. Classical maximum likelihood inference can be viewed as minimizing the Kullback–Leibler divergence between Pθ\mathbb{P}_{\theta} and Q\mathbb{Q} (Wolfowitz, 1957; Basu et al., 2011; van der Vaart, 2000). Replacing this divergence by the squared MMD leads to the minimum MMD estimator (Gretton et al., 2012; Muandet et al., 2017; Briol et al., 2019a). This estimator is statistically attractive because it can be robust to model misspecification, including outlier contamination and covariate shift (Briol et al., 2019a; Chérief-Abdellatif and Alquier, 2020). It is also computationally useful because it remains well defined when the likelihood is unavailable or intractable, as in likelihood-free inference (Niu et al., 2023b; Dellaporta et al., 2022; Bharti et al., 2023a).

Statistical Inference

min⁡θ∈ΘMMD⁡2(Pθ,Q)\min_{\theta\in\Theta}\operatorname{MMD}^{2}(\mathbb{P}_{\theta},\mathbb{Q})

My contributions

This thesis develops new methods and theory for MMD minimization in the three settings described above.

  1. For numerical integration, arg min⁡w1,…,wNMMD⁡2(∑i=1Nwiδxi,Q)\operatorname*{arg\,min}_{w_1,\ldots,w_N} \operatorname{MMD}^{2}\left(\sum_{i=1}^{N} w_i\delta_{x_i},\mathbb{Q}\right) give rise to the optimal weights, which are known to admit a closed-form expression. In Chapter 3, I show that this closed-form weighting principle extends to nested expectations, and that the resulting estimators inherit the smoothness-dependent fast convergence rates of kernel quadrature. This chapter is based on a published paper in International Conference on Machine Learning, 2025 (Chen et al., 2025d).

  1. For sampling and generative modelling, the finite-dimensional problem arg min⁡x1,…,xNMMD⁡2(1N∑i=1Nδxi,Q)\operatorname*{arg\,min}_{x_1,\ldots,x_N} \operatorname{MMD}^{2}\left(\frac{1}{N}\sum_{i=1}^{N}\delta_{x_i},\mathbb{Q}\right) can be viewed as a particle approximation of the lifted optimization problem over the space of probability measures P\mathcal{P}, namely arg min⁡P∈PMMD⁡2(P,Q)\operatorname*{arg\,min}_{\mathbb{P}\in\mathcal{P}} \operatorname{MMD}^{2}\left(\mathbb{P},\mathbb{Q}\right). This lifted problem admits a natural optimization dynamics, given by the Wasserstein gradient flow of the MMD objective (Ambrosio et al., 2005; Arbel et al., 2019). The main technical challenge herein is that the map P↦MMD⁡2(P,Q)\mathbb{P}\mapsto\operatorname{MMD}^{2}\left(\mathbb{P},\mathbb{Q}\right) is generally non-convex along Wasserstein geodesics (Arbel et al., 2019; Chen et al., 2024b), even for log-concave targets Q\mathbb{Q}, such as Gaussian distributions. In Chapter 4, I show that, with suitable regularization, the resulting Wasserstein gradient flow enjoys global convergence for a broad class of target distributions. This chapter is based on a published paper in the Journal of Machine Learning Research, 2025 (Chen et al., 2024b).

  1. For statistical inference, despite the growing popularity of minimum MMD estimators, comparatively little work has addressed the optimization problem, arg min⁡θ∈ΘMMD⁡2(Pθ,Q)\operatorname*{arg\,min}_{\theta\in\Theta} \operatorname{MMD}^{2}\left(\mathbb{P}_{\theta},\mathbb{Q}\right), itself. Existing methods typically rely on gradient descent on the parameter θ\theta (Briol et al., 2019a; Chérief-Abdellatif and Alquier, 2020), including the recent R-package implementation of Alquier and Gerber (2025); due to the non-convexity of the objective, these

gradient-based methods can at best be expected to converge to stationary points. In Chapter 5, I propose a new descent scheme for minimizing the parametric MMD objective, and prove that it can converge to a (not necessarily unique) global minimizer under explicit assumptions. This chapter is based on a recently arXived manuscript (Kang et al., 2026).

Beyond the chapters above, I have also contributed as a primary author to the following publications or archival papers, during the course of the PhD:

  • Z. Chen, T. Karvonen, H. Kanagawa, F.-X. Briol, and C. Oates. Stationary MMD Points for Cubature. Proceedings of the 43rd International Conference on Machine Learning, 2026 (Chen et al., 2025b);

  • Z. Chen, H. Kanagawa, F.-X. Briol, C. J. Oates, and L. Mackey. Thinned Mean Field Langevin Dynamics. Proceedings of the 43rd International Conference on Machine Learning, 2026 (Chen et al., 2026);

  • C. Tian, B. K. Sriperumbudur, A. Gretton, and Z. Chen. Sobolev Regularized MMD Gradient Flow. arXiv, 2026 (Tian et al., 2026);

  • Z. Chen, R. Guo, J.-F. Ton, and Y. Liu. Conformal Counterfactual Inference under Hidden Confounding. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024 (Chen et al., 2024a);

  • Z. Chen, A. Nitanda, A. Gretton, and T. Suzuki. Towards a Unified Analysis of Neural Networks in Nonparametric Instrumental Variable Regression: Optimization and Generalization. arXiv, 2025 (Chen et al., 2025e);

  • Z. Shen, Z. Chen, D. Meunier, I. Steinwart, A. Gretton, and Z. Li. Nonparametric Instrumental Variable Regression with Observed Covariates. arXiv, 2025 (Shen et al., 2025b);

  • S. S. Kang, F.-X. Briol, T. Karvonen, and Z. Chen. BayesSum: Bayesian Quadrature in Discrete Spaces. Proceedings of the Second International Conference on Probabilistic Numerics, 2026 (Kang et al., 2025).

NotationMeaning
N\mathbb{N}Natural numbers, {0,1,…}\{0,1,\ldots\}.
Id⁡\operatorname{Id} or Id⁡d\operatorname{Id}_{d}Identity operator or identity matrix, depending on context; Id⁡d\operatorname{Id}_{d} denotes the d×dd \times d identity matrix.
x1:N∈RN×dx_{1:N} \in\mathbb{R}^{N \times d}Vector when d=1d=1, or matrix [x1 x2 … xN]T[x_{1}\ x_{2}\ \ldots\ x_{N}]^{\mathsf{T}}, for x1,…,xN∈X⊆Rdx_{1},\ldots,x_{N} \in\mathcal{X} \subseteq\mathbb{R}^{d}.
T#PT_{\#}\mathbb{P}Pushforward of P\mathbb{P} under a measurable map TT, defined by (T#P)(A)=P(T−1(A))(T_{\#}\mathbb{P})(A)=\mathbb{P}(T^{-1}(A)) for measurable sets AA.
L2(P)L_{2}(\mathbb{P})Hilbert space of square-integrable functions under the probability measure P\mathbb{P}, with norm ∥f∥L2(P)2=∫∣f(x)∣2 dP(x)\lVert f\rVert_{L_{2}(\mathbb{P})}^{2}=\int\lvert f(x)\rvert^{2}\,\mathrm{d}\mathbb{P}(x).
L2d(P)L_{2}^{d}(\mathbb{P})Vector-valued L2L_{2} space of functions f=(f1,…,fd)f=(f_{1},\ldots,f_{d}) with fi∈L2(P)f_{i}\in L_{2}(\mathbb{P}), equipped with ⟨f,g⟩L2d(P)=∑i=1d∫fi(x)gi(x) dP(x)\langle f,g\rangle_{L_{2}^{d}(\mathbb{P})}=\sum_{i=1}^{d}\int f_{i}(x)g_{i}(x)\,\mathrm{d}\mathbb{P}(x).
P2(Rd)\mathcal{P}_{2}(\mathbb{R}^{d})Probability measures on Rd\mathbb{R}^{d} with finite second moment, equipped with the Wasserstein-2 geometry when a metric is needed.
Hk\mathcal{H}_{k}RKHS associated with the kernel kk.
Hd\mathcal{H}^{d}Cartesian product RKHS of vector fields f=(f1,…,fd)f=(f_{1},\ldots,f_{d}) with fi∈Hf_{i}\in\mathcal{H}, equipped with ⟨f,g⟩Hd=∑i=1d⟨fi,gi⟩H\langle f,g\rangle_{\mathcal{H}^{d}}=\sum_{i=1}^{d}\langle f_{i},g_{i}\rangle_{\mathcal{H}}.
W2s(X)W_{2}^{s}(\mathcal{X})Sobolev space of order ss; see Theorem 2.1.
Cβ(X)C^{\beta}(\mathcal{X})Hölder space of regularity β\beta: functions with ⌊β⌋\lfloor\beta\rfloor continuous derivatives whose highest-order derivatives are (β−⌊β⌋)(\beta-\lfloor\beta\rfloor)-Hölder continuous.
mPm_{\mathbb{P}}Kernel mean embedding of P\mathbb{P}, given by ∫k(x,⋅) dP(x)\int k(x,\cdot)\,\mathrm{d}\mathbb{P}(x) when the integral is well-defined.

Table 1.1. Table 1.1: Frequently used function spaces and probability-measure notation.

References

  1. [1]Katznelson (2004), Chapter VI, Section 2, pp. 144–145
  2. [2]Bach, 2024

Paper details

vlnc:W_xfystq85
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents