资源论文Pathwise Derivatives Beyond the Reparameterization Trick

Pathwise Derivatives Beyond the Reparameterization Trick

2020-03-11 | |  66 |   41 |   0

Abstract

We observe that gradients computed via the reparameterization trick are in direct correspondence with solutions of the transport equation in the for malism of optimal transport. We use this perspective to compute (approximate) pathwise gradients for probability distributions not directly amenable to the reparameterization trick: Gamma, Beta, and Dirichlet. We further observe that when the reparameterization trick is applied to the Choleskyfactorized multivariate Normal distribution, the resulting gradients are suboptimal in the sense of optimal transport. We derive the optimal gradients and show that they have reduced variance in a Gaussian Process regression task. We demonstrate with a variety of synthetic experiments and stochastic variational inference tasks that our pat wise gradients are competitive with other methods.

上一篇:Approximate message passing for amplitude based optimization

下一篇:Towards More Efficient Stochastic Decentralized Learning: Faster Convergence and Sparse Communication

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...