mlsanityData to 7 Oct 2026

Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents

arXiv 2203.10592 ↗First posted 20 Mar 2022stat.ML cs.LG math.DGcited by 5

Not on the map. Why?

Abstract (arXiv)

In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric structures to solve these problems efficiently. We show that a wide range of geometric theories emerge naturally in these fields, ranging from measure-preserving processes, information divergences, Poisson geometry, and geometric integration. Specifically, we explain how (i) leveraging the symplectic geometry of Hamiltonian systems enable us to construct (accelerated) sampling and optimisation methods, (ii) the theory of Hilbertian subspaces and Stein operators provides a general methodology to obtain robust estimators, (iii) preserving the information geometry of decision-making yields adaptive agents that perform active inference. Throughout, we emphasise the rich connections between these fields; e.g., inference draws on sampling and optimisation, and adaptive decision-making assesses decisions by inferring their counterfactual consequences. Our exposition provides a conceptual overview of underlying ideas, rather than a technical discussion, which can be found in the references herein.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 75 of its 300 references that are in the map. First posted on arXiv 20 Mar 2022.

Builds on

75 of 300 references.

References · 75

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2016Variational Inference: A Review for Statisticianscited by 1,466
  3. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
  4. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  5. 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 466
  6. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
  7. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  8. 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 251
  9. 2016A Kernelized Stein Discrepancy for Goodness-of-fit Tests and Model Evaluationcited by 236
  10. 2017Advances in Variational Inferencecited by 236
  11. 2017A Conceptual Introduction to Hamiltonian Monte Carlocited by 207
  12. 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
38 more
  1. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  2. 2015Training generative neural networks via Maximum Mean Discrepancy optimizationcited by 149
  3. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  4. 2016A Kernel Test of Goodness of Fitcited by 143
  5. 2017Measuring Sample Quality with Kernelscited by 119
  6. 2016A Variational Perspective on Accelerated Methods in Optimizationcited by 108
  7. 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 99
  8. 2016First-order Methods for Geodesically Convex Optimizationcited by 92
  9. 2020Active inference on discrete state-spaces: a synthesiscited by 91
  10. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
  11. 2018An elementary introduction to information geometrycited by 76
  12. 2020Deep active inference agents using Monte-Carlo methodscited by 72
  13. 2014Control functionals for Monte Carlo integrationcited by 59
  14. 2019Minimum Stein Discrepancy Estimatorscited by 57
  15. 2020Sophisticated Inferencecited by 56
  16. 2019Deep Active Inference as Variational Policy Gradientscited by 52
  17. 2021Active Inference in Robotics and Artificial Agents: Survey and Challengescited by 52
  18. 2019Statistical Inference for Generative Models with Maximum Mean Discrepancycited by 43
  19. 2016Kernel Distribution Embeddings: Universal Kernels, Characteristic Kernels and Kernel Metrics on Distributionscited by 39
  20. 2022pymdp: A Python library for active inference in discrete state spacescited by 39
  21. 2020Metrizing Weak Convergence with Maximum Mean Discrepanciescited by 35
  22. 2020Structure preserving deep learningcited by 30
  23. 2019Stein Point Markov Chain Monte Carlocited by 29
  24. 2019Conformal Symplectic and Relativistic Optimizationcited by 28
  25. 2020Optimization with Momentum: Dynamical, Control-Theoretic, and Symplectic Perspectivescited by 27
  26. 2022The free energy principle made simpler but not too simplecited by 27
  27. 2015The Bouncy Particle Sampler: A Non-Reversible Rejection-Free Markov Chain Monte Carlo Methodcited by 26
  28. 2016Measuring Sample Quality with Diffusionscited by 25
  29. 2017Geometric integrators and the Hamiltonian Monte Carlo methodcited by 25
  30. 2017Riemannian Stein Variational Gradient Descent for Bayesian Inferencecited by 24
  31. 2020On dissipative symplectic integration with applications to gradient-based optimizationcited by 23
  32. 2021Contrastive Active Inferencecited by 21
  33. 2020Deep Active Inference for Partially Observable MDPscited by 20
  34. 2014The Geometric Foundations of Hamiltonian Monte Carlocited by 19
  35. 2016On the Geometric Ergodicity of Hamiltonian Monte Carlocited by 19
  36. 2018Bayesian model reductioncited by 19
  37. 2019Is There an Analog of Nesterov Acceleration for MCMC?cited by 19
  38. 2015Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Familiescited by 15

50 most cited of 75 All 75 (JSON)

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 1; 2024: 2.

5 papers.