REVIEW 3 cited by
Variational approximations using Fisher divergence
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Modern applications of Bayesian inference involve models that are sufficiently complex that the corresponding posterior distributions are intractable and must be approximated. The most common approximation is based on Markov chain Monte Carlo, but these can be expensive when the data set is large and/or the model is complex, so more efficient variational approximations have recently received considerable attention. The traditional variational methods, that seek to minimize the Kullback--Leibler divergence between the posterior and a relatively simple parametric family, provide accurate and efficient estimation of the posterior mean, but often does not capture other moments, and have limitations in terms of the models to which they can be applied. Here we propose the construction of variational approximations based on minimizing the Fisher divergence, and develop an efficient computational algorithm that can be applied to a wide range of models without conjugacy or potentially unrealistic mean-field assumptions. We demonstrate the superior performance of the proposed method for the benchmark case of logistic regression.
Forward citations
Cited by 3 Pith papers
-
Generalized reparametrized variational Bayes with skew-symmetric normalization
KNorm-RVB combines affine normalization with mirror-reflection skewness reduction to make mean-field variational inference substantially more accurate for hierarchical models.
-
Global Convergence of Gradient Descent for Score Matching in Gaussian Mixtures via Reverse Fisher Divergence
Proves global GD convergence on reverse Fisher divergence for GMM score matching to single-Gaussian targets from arbitrary init and to separated GMM targets under random init.
-
Machine learning assisted canonical sampling (MLACS)
MLACS is a production Python package that iteratively trains linear MLIP surrogates with active learning and MBAR reweighting to sample the DFT canonical ensemble at 50 to 100 times lower DFT cost.
Discussion (0). Continue with ORCID to comment.