arXiv Machine Learning By Jianfeng Lu, Yinchen Luo

Windowed thinning and query complexity for the bouncy particle and Zigzag samplers

Read the original on arXiv Machine Learning →

arXiv:2607. 28413v1 Announce Type: cross Abstract: Let $\mu(d x)\propto e^{-U(x)} d x$ on $\R^d$, where $U$ is $m$-strongly convex and $L$-smooth, and denote by $\kappa=L/m$ the condition number.

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.

arXiv Machine Learning
Sep 10

Smoothed Picard Hamiltonian Monte Carlo

arXiv:2609.06906v1 Announce Type: cross Abstract: We develop a new low-accuracy sampler, called \emph{smoothed Picard Hamiltonian Monte Carlo}, which combines Gaussian smoothing, Picard iteration, an...

By Fan Chen, Sinho Chewi, Jianfeng Lu, Matthew S Zhang
arXiv AI
Jun 8

A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space

arXiv:2606. 07325v1 Announce Type: cross Abstract: We study the minimax rate of estimating a future value $\mu_{t_n+h}$ of a curve $t\mapsto\mu_t$ in the $2$-Wasserstein space $\mathcal{P}_2(\mathbb{R}^d)$ from finitely many noisy snapshots of its past, under an adiabatic bound $\|\nabla_t^k v\|\le\varepsilon$ on the $k$-th covariant derivative of the velocity field.

By Munsik Kim