Skip to content

Author

Jian-Feng Lu

7 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Entropy hypocoercivity and query complexity for the bouncy particle sampler

We study convergence in relative entropy of the bouncy particle sampler with Gaussian velocity refreshment, for a target $e^{-U}$ on $\mathbb R^d$ with $U$ $m$-strongly convex and $L$-smooth, and condition number $\kappa=L/m$. For initial laws with bounded density relative to equilibrium, we show that the relative entr...

Jian-Feng Lu, Yin-Chen Luo · 2 citations
#machine learning Preprint Oct 2026

Sharp dimensional analysis of midpoint methods for Langevin sampling

The proofs exploit cancellation at stationarity and smoothing using techniques from Malliavin calculus, outperforming previous upper bounds based on standard couplings and shows surprisingly that in high dimensions, deterministic discretizations can outperform their random counterparts.

Fan Chen, Sinho Chewi, Jian-Feng Lu et al. · 0 citations
Preprint Sep 2026

High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction

The Gaussian cloud sampler is introduced and the algorithm uses first-order rejection sampling (FORS) to correct the law of smoothed Picard HMC trajectories and a suite of likelihood correction gadgets which only use samples from this indirect cloud representation are developed.

Fan Chen, Sinho Chewi, Jian-Feng Lu et al. · 1 citation · ⚡1
Preprint Sep 2026

Sharp Gaussian divergence and Bernstein-Markov inequalities

We prove two dimension-free estimates in Gaussian space. The first is an optimal Meyer-type inequality for the Gaussian divergence: for $p\geq2$, \[ \|\delta V\|_{L^p(\gamma_d)} \leq \sqrt p\,|\mathbb E V| +Cp\,\|DV\|_{L^p(\gamma_d;\mathrm{HS}_d)}\, . \] Here $\mathrm{HS}_d$ is the space of $d\times d$ matrices with it...

Fan Chen, Sinho Chewi, Jian-Feng Lu et al. · 1 citation
#machine learning Preprint Sep 2026

Smoothed Picard Hamiltonian Monte Carlo

We develop a new low-accuracy sampler, called smoothed Picard Hamiltonian Monte Carlo, which combines Gaussian smoothing, Picard iteration, and higher-order discretization. For a log-concave target $\pi \propto \exp(-V)$ in dimension $d$ satisfying $0 \prec \alpha I \preceq \nabla^2 V \preceq \beta I$, with condition n...

Fan Chen, Sinho Chewi, Jian-Feng Lu et al. · 2 citations
#machine learning Preprint Sep 2026

Accelerated High-Accuracy Sampling from a Warm Start via the Proximal Bouncy Particle Sampler

The Proximal Bouncy Particle Sampler is a new sampler that combines ideas from the proximal sampler and the bouncy particle sampler that returns a sample whose law is $\varepsilon$-close to $\mu$ in total variation distance using gradient queries in expectation.

Fan Chen, Sinho Chewi, Jian-Feng Lu et al. · 0 citations

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

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. We consider windowed thinning, an exact simulation method for the bouncy particle sampler and the coordinate Zigzag process. The method divides a trajectory into deterministic...

Jian-Feng Lu, Yin-Chen Luo · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.