REVIEW 1 cited by
MaxEntropy Pursuit 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
Signed reviews
read the original abstract
One of the core problems in variational inference is a choice of approximate posterior distribution. It is crucial to trade-off between efficient inference with simple families as mean-field models and accuracy of inference. We propose a variant of a greedy approximation of the posterior distribution with tractable base learners. Using Max-Entropy approach, we obtain a well-defined optimization problem. We demonstrate the ability of the method to capture complex multimodal posterior via continual learning setting for neural networks.
Forward citations
Cited by 1 Pith paper
-
Greedy Stein Variational Gradient Descent: An algorithmic approach for wave prospection problems
G-SVGD modifies SVGD with a loss-based line search and a KDE-based local Gaussian approximation, but the convergence claims are not backed by independent validation.
Discussion (0). Continue with ORCID to comment.