Accelerating Convergence of Stein Variational Gradient Descent via Deep Unfolding
<|reference_start|>Accelerating Convergence of Stein Variational Gradient Descent via Deep Unfolding: Stein variational gradient descent (SVGD) is a prominent particle-based variational inference method used for sampling a target distribution. SVGD has attracted interest for application in machine-learning techniques such as Bayesian inference. In this paper, we propose novel trainable algorithms that incorporate a deep-learning technique called deep unfolding,into SVGD. This approach facilitates the learning of the internal parameters of SVGD, thereby accelerating its convergence speed. To evaluate the proposed trainable SVGD algorithms, we conducted numerical simulations of three tasks: sampling a one-dimensional Gaussian mixture, performing Bayesian logistic regression, and learning Bayesian neural networks. The results show that our proposed algorithms exhibit faster convergence than the conventional variants of SVGD.<|reference_end|>
@article{kawamura2024accelerating,
    title={Accelerating Convergence of Stein Variational Gradient Descent via Deep
  Unfolding},
    author={Yuya Kawamura and Satoshi Takabe},
    journal={arXiv preprint arXiv:2402.15125},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.15125},
    primaryClass={cs.LG stat.ML}
}