# Deep Involutive Generative Models for Neural MCMC

arXiv: https://arxiv.org/abs/2006.15167 · HTML: https://mlsanity.com/paper/2006.15167/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Jun 2020.

## Built on by (most cited first, 4 of 4)

- [Path Integral Sampler: a stochastic control approach for sampling](https://mlsanity.com/paper/2111.15141/) (2021)
- [MixFlows: principled variational inference via mixed flows](https://mlsanity.com/paper/2205.07475/) (2022)
- [Semi-Empirical Objective Functions for MCMC Proposal Optimization](https://mlsanity.com/paper/2106.02104/) (2021)
- [Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning](https://mlsanity.com/paper/2306.08506/) (2023)

## Abstract (arXiv)

We introduce deep involutive generative models, a new architecture for deep generative modeling, and use them to define Involutive Neural MCMC, a new approach to fast neural MCMC. An involutive generative model represents a probability kernel G(φ mapsto φ') as an involutive (i.e., self-inverting) deterministic function f(φ, π) on an enlarged state space containing auxiliary variables π. We show how to make these models volume preserving, and how to use deep volume-preserving involutive generative models to make valid Metropolis-Hastings updates based on an auxiliary variable scheme with an easy-to-calculate acceptance ratio. We prove that deep involutive generative models and their volume-preserving special case are universal approximators for probability kernels. This result implies that with enough network capacity and training time, they can be used to learn arbitrarily complex MCMC updates. We define a loss function and optimization algorithm for training parameters given simulated data. We also provide initial experiments showing that Involutive Neural MCMC can efficiently explore multi-modal distributions that are intractable for Hybrid Monte Carlo, and can converge faster than A-NICE-MC, a recently introduced neural MCMC technique.