Related papers: Complexity of zigzag sampling algorithm for strongly log-concave distributions

URL: http://arxiv.org/abs/2012.11094v1
Date: Mon, 21 Dec 2020 03:10:21 GMT
Title: Complexity of zigzag sampling algorithm for strongly log-concave distributions
Authors: Jianfeng Lu and Lihan Wang
Abstract summary: We study the computational complexity of zigzag sampling algorithm for strongly log-concave distributions. We prove that the zigzag sampling algorithm achieves $varepsilon$ error in chi-square divergence with a computational cost equivalent to $Obigl.
Score: 6.336005544376984
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
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.

Err

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.