Minimum Stein discrepancy estimators
File(s)9457-minimum-stein-discrepancy-estimators.pdf (485.33 KB)
Published version
Author(s)
Barp, Alessandro
Briol, Francois Xavier
Duncan, Andrew
Girolami, Mark
Mackey, Lester
Type
Conference Paper
Abstract
When maximum likelihood estimation is infeasible, one often turns to score matching, contrastive divergence, or minimum probability flow to obtain tractable parameter estimates. We provide a unifying perspective of these techniques as minimum Stein discrepancy estimators, and use this lens to design new diffusion kernel Stein discrepancy (DKSD) and diffusion score matching (DSM) estimators with complementary strengths. We establish the consistency, asymptotic normality, and robustness of DKSD and DSM estimators, then derive stochastic Riemannian gradient descent algorithms for their efficient optimisation. The main strength of our methodology is its flexibility, which allows us to design estimators with desirable properties for specific models at hand by carefully selecting a Stein discrepancy. We illustrate this advantage for several challenging problems for score matching, such as non-smooth, heavy-tailed or light-tailed densities.
Date Issued
2019-12-08
Date Acceptance
2019-09-04
Citation
NIPS Proceedings, 2019, 32
Publisher
Neural Information Processing Systems Foundation, Inc.
Journal / Book Title
NIPS Proceedings
Volume
32
Copyright Statement
© 2019 Neural Information Processing Systems Foundation, Inc.
Sponsor
The Alan Turing Institute
Grant Number
ATI PO 000002890 R/LRF/AD1
Source
33rd Conference on Neural Information Processing Systems (NeurIPS 2019)
Start Date
2019-12-08
Finish Date
2019-12-14
Coverage Spatial
Vancouver, ON, Canada