Department of Mathematics
 Search | Help | Login

Math @ Duke





.......................

.......................


Publications [#361585] of Jianfeng Lu

Papers Published

  1. Lu, J; Wang, L, Complexity of zigzag sampling algorithm for strongly log-concave distributions, Stat Comput, vol. 32 (December, 2020), pp. 48
    (last updated on 2026/01/15)

    Abstract:
    We study the computational complexity of zigzag sampling algorithm for strongly log-concave distributions. The zigzag process has the advantage of not requiring time discretization for implementation, and that each proposed bouncing event requires only one evaluation of partial derivative of the potential, while its convergence rate is dimension independent. Using these properties, we prove that the zigzag sampling algorithm achieves $\varepsilon$ error in chi-square divergence with a computational cost equivalent to $O\bigl(\kappa^2 d^\frac{1}{2}(\log\frac{1}{\varepsilon})^{\frac{3}{2}}\bigr)$ gradient evaluations in the regime $\kappa \ll \frac{d}{\log d}$ under a warm start assumption, where $\kappa$ is the condition number and $d$ is the dimension.

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320


x