Pith. sign in

REVIEW 1 cited by

Understanding and Accelerating Particle-Based Variational Inference

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

arxiv 1807.01750 v4 pith:VRZ7KJDS submitted 2018-07-04 stat.ML cs.LG

classification stat.MLcs.LG
keywords parvisinferenceaccelerationapproximationsbandwidth-selectionexistingframeworkmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Particle-based variational inference methods (ParVIs) have gained attention in the Bayesian inference literature, for their capacity to yield flexible and accurate approximations. We explore ParVIs from the perspective of Wasserstein gradient flows, and make both theoretical and practical contributions. We unify various finite-particle approximations that existing ParVIs use, and recognize that the approximation is essentially a compulsory smoothing treatment, in either of two equivalent forms. This novel understanding reveals the assumptions and relations of existing ParVIs, and also inspires new ParVIs. We propose an acceleration framework and a principled bandwidth-selection method for general ParVIs; these are based on the developed theory and leverage the geometry of the Wasserstein space. Experimental results show the improved convergence by the acceleration framework and enhanced sample accuracy by the bandwidth-selection method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 43 citations worldwide. Full citation record

  1. Accelerated Information Gradient flow

    math.OC 2019-09 conditional novelty 6.0 of 10

    The authors derive and analyze accelerated Nesterov-type gradient flows in probability space under four information metrics and use them to build faster mean-field MCMC sampling algorithms.

Pith tools