arXiv Machine Learning
On the Optimisation Landscape of Overparameterised Weighted MMD
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Statistics ML
Oct 2
Muon meets Tamed Langevin: Momentum Preconditioning beyond Convex and gradient-Lipschitz Potentials
The paper introduces a new underdamped Langevin system for sampling Gibbs distributions on matrix spaces where the potential energy is neither convex nor globally gradient‑Lipschitz. By employing non‑quadratic kinetic energies, the authors achieve momentum preconditioning that smooths the momentum via a spectral taming of its gradient. They prove that this dynamics preserves the target Gibbs measure, converges exponentially fast in a weighted total variation distance, and that its Euler–Maruyama discretization remains stable with uniform moment bounds over time.
Hugging Face Trending Papers
Aug 6
The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity
We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.
arXiv Machine Learning
6d ago
A Jump-Modified Wasserstein Gradient Flow for Maximum Mean Discrepancy with Energy Kernels
arXiv:2610. 29007v1 Announce Type: cross Abstract: We study a jump-modified Wasserstein gradient flow of the squared maximum mean discrepancy generated by the energy kernels $K(z)=-|z|^q$, $0<q<2$, in every dimension $d\ge2$ as well as the one-dimensional range $1\le q<2$.
arXiv Machine Learning
Oct 3
Polylogarithmic Sparsity of Randomly Reweighted NPMLEs for Gaussian Mixtures
arXiv:2610. 01088v1 Announce Type: cross Abstract: The nonparametric maximum likelihood estimator (NPMLE) of a Gaussian location mixture maximizes the likelihood over the infinite-dimensional space of mixing distributions.
arXiv Machine Learning
Jun 30
A Deterministic Sampling Method via Maximum Mean Discrepancy Flow with Adaptive Kernel
arXiv:2111. 10722v4 Announce Type: replace-cross Abstract: We propose a novel deterministic sampling method, EVI-MMD, to approximate a target distribution $\rho^*$ by minimizing the kernel discrepancy, also known as the Maximum Mean Discrepancy (MMD).
arXiv Machine Learning
Aug 7
The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity
arXiv:2608. 06283v1 Announce Type: new Abstract: We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex.