2019
DOI: 10.3934/jcd.2019019
|View full text |Cite
|
Sign up to set email alerts
|

Discrete gradients for computational Bayesian inference

Abstract: In this paper, we exploit the gradient flow structure of continuoustime formulations of Bayesian inference in terms of their numerical time-stepping. We focus on two particular examples, namely, the continuous-time ensemble Kalman-Bucy filter and a particle discretisation of the Fokker-Planck equation associated to Brownian dynamics. Both formulations can lead to stiff differential equations which require special numerical methods for their efficient numerical implementation. We compare discrete gradient metho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
21
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(21 citation statements)
references
References 30 publications
0
21
0
Order By: Relevance
“…In the linear setting, ensemble Kalman based methods may be viewed as Monte Carlo approximations of the Kalman filter; in the nonlinear case ensemble Kalman based methods do not converge to the filtering or posterior distribution in the large particle limit (Ernst, Sprungk and Starkloff, 2015). Related interacting particle based methodologies of current interest include Stein variational gradient descent (Lu, Lu and Nolen, 2018;Liu and Wang, 2016;Detommaso et al, 2018) and the Fokker-Planck particle dynamics of Reich (Reich, 2018;Pathiraja and Reich, 2019), both of which map an arbitrary initial measure into the desired posterior measure over an infinite time horizon s ∈ [0, ∞). A related approach is to introduce an artificial time s ∈ [0, 1] and a homotopy between the prior at time s = 0 and the posterior measure at time s = 1 and write an evolution equation for the measures (Daum and Huang, 2011;Reich, 2011;El Moselhy and Marzouk, 2012;Laugesen et al, 2015); this evolution equation can be approximated by particle methods.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…In the linear setting, ensemble Kalman based methods may be viewed as Monte Carlo approximations of the Kalman filter; in the nonlinear case ensemble Kalman based methods do not converge to the filtering or posterior distribution in the large particle limit (Ernst, Sprungk and Starkloff, 2015). Related interacting particle based methodologies of current interest include Stein variational gradient descent (Lu, Lu and Nolen, 2018;Liu and Wang, 2016;Detommaso et al, 2018) and the Fokker-Planck particle dynamics of Reich (Reich, 2018;Pathiraja and Reich, 2019), both of which map an arbitrary initial measure into the desired posterior measure over an infinite time horizon s ∈ [0, ∞). A related approach is to introduce an artificial time s ∈ [0, 1] and a homotopy between the prior at time s = 0 and the posterior measure at time s = 1 and write an evolution equation for the measures (Daum and Huang, 2011;Reich, 2011;El Moselhy and Marzouk, 2012;Laugesen et al, 2015); this evolution equation can be approximated by particle methods.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Solutions to the Fokker-Planck equation are gradient flows of the relative entropy in the density manifold (Otto, 2001;Jordan, Kinderlehrer and Otto, 1998). Designing time-stepping methods which preserve gradient structure is also of current interest: see (Pathiraja and Reich, 2019) and, within the context of Wasserstein gradient flows, (Li and Montufar, 2018;Tong Lin et al, 2018;Li, Lin and Montúfar, 2019). The subject of discrete gradients for time-integration of gradient and Hamiltonian systems is developed in (Humphries and Stuart, 1994;Gonzalez, 1996;McLachlan, Quispel and Robidoux, 1999;Hairer and Lubich, 2013).…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…which constitutes the desired particle approximation to the Fokker-Planck equation (29) with drift term (145). Time-stepping methods for such gradient flow systems have been discussed by Pathiraja and Reich (2019). We also remark that an alternative interacting particle system, approximating the same asymptotic PDF π * in the limit s → ∞, has been proposed recently by Liu and Wang (2016) under the notion of Stein variational descent.…”
Section: Discussionmentioning
confidence: 90%
“…Benning, Celledoni, Ehrhardt, Owren, and Schönlieb [2] apply partitioned symplectic Runge-Kutta methods to an ODE formulation of deep learning; the time steps are regarded as parameters to be learned. Likewise, Pathiraja and Reich [20] apply discrete gradient methods to a gradient ODE formulation of Bayesian inference. Here we are moving into the realm of data analysis via geometric numerical techniques.…”
mentioning
confidence: 99%