HackerPapers

arXiv:2001.01328cs.LG

Scalable Gradients for Stochastic Differential Equations

Xuechen Li, Ting-Kam Leonard Wong, Ricky T. Q. Chen, David Duvenaud

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The adjoint sensitivity method scalably computes gradients of solutions to ordinary differential equations. We generalize this method to stochastic differential equations, allowing time-efficient and constant-memory computation of gradients with high-order adaptive solvers. Specifically, we derive a stochastic differential equation whose solution is the gradient, a memory-efficient algorithm for caching noise, and conditions under which numerical solutions converge. In addition, we combine our method with gradient-based stochastic variational inference for latent stochastic differential equations. We use our method to fit stochastic dynamics defined by neural networks, achieving competitive performance on a 50-dimensional motion capture dataset.

arXiv comments
AISTATS 2020; 25 pages, 6 figures in main text; clarify notation in appendix
Journal reference
DOI
Subjects
cs.LGMachine Learning math.NANumerical Analysis stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2022 to Dec 2022. Found in 1 HN submission from Jul 2020 to Jul 2020. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Because of criteria 0, 1, 2 these entirely depend on the individual. However, some papers which fit the criteria for me at the time were the following: - Score-Based Generative Modeling through Stochastic Differential Equations https://arxiv.org/abs/2011.13456 - Structured…

      jdeatonView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.