A particle algorithm for mean-field variational inference
From MaRDI portal
Cites work
- \{Euclidean, metric, and Wasserstein\} gradient flows: an overview
- A JKO splitting scheme for Kantorovich-Fisher-Rao gradient flows
- Accelerated information gradient flow
- Accelerating optimization over the space of probability measures
- An Extension of Kakutani's Theorem on Infinite Product Measures to the Tensor Product of Semifinite w ∗ -Algebras
- An introduction to variational methods for graphical models
- Analysis of Langevin Monte Carlo via convex optimization
- Birth–death dynamics for sampling: global convergence, approximations and their asymptotics
- Convergence of Langevin MCMC in KL-divergence
- Convergence rates of variational posterior distributions
- Graphical models, exponential families, and variational inference
- scientific article; zbMATH DE number 2152346 (Why is no real title available?)
- scientific article; zbMATH DE number 3894218 (Why is no real title available?)
- Independent projections of diffusions: gradient flows for variational inference and optimal mean field approximations
- Learning Gaussian mixtures using the Wasserstein-Fisher-Rao gradient flow
- Mean field approximations via log-concavity
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- On the rate of convergence in Wasserstein distance of the empirical measure
- One-dimensional empirical measures, order statistics, and Kantorovich transport distances
- Optimal Transport
- Pattern recognition and machine learning.
- The Bayesian update: variational formulations and gradient flows
- The Variational Formulation of the Fokker--Planck Equation
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Variational particle approximations
Cited in
(1)
This page was built for publication: A particle algorithm for mean-field variational inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253571)
