Pith. sign in

REVIEW 2 cited by

A-NICE-MC: Adversarial Training for MCMC

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 1706.07561 v3 pith:7BNYKRBU submitted 2017-06-23 stat.ML cs.AIcs.LG

A-NICE-MC: Adversarial Training for MCMC

classification stat.ML cs.AIcs.LG
keywords mcmca-nice-mcmarkovchainefficienttrainadversarialcarlo
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Existing Markov Chain Monte Carlo (MCMC) methods are either based on general-purpose and domain-agnostic schemes which can lead to slow convergence, or hand-crafting of problem-specific proposals by an expert. We propose A-NICE-MC, a novel method to train flexible parametric Markov chain kernels to produce samples with desired properties. First, we propose an efficient likelihood-free adversarial training method to train a Markov chain and mimic a given data distribution. Then, we leverage flexible volume preserving flows to obtain parametric kernels for MCMC. Using a bootstrap approach, we show how to train efficient Markov chains to sample from a prescribed posterior distribution by iteratively improving the quality of both the model and the samples. A-NICE-MC provides the first framework to automatically design efficient domain-specific MCMC proposals. Empirical results demonstrate that A-NICE-MC combines the strong guarantees of MCMC with the expressiveness of deep neural networks, and is able to significantly outperform competing methods such as Hamiltonian Monte Carlo.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Denoising Diffusion Implicit Models

    cs.LG 2020-10 unverdicted novelty 8.0

    DDIMs construct non-Markovian diffusion processes that share DDPM training objectives but allow much faster reverse sampling, demonstrated empirically at 10-50x wall-clock speedup.

  2. Schr\"{o}dinger Generator for High-Dimensional Integration and Sampling on Quantum Many-Body States

    nucl-th 2026-08 reject novelty 6.0

    A two-stage sampler (adaptive marginal map plus normalizing flow, then resampling) is proposed and shown on model nuclear densities up to D=624, though a core Jacobian equation appears sign-inconsistent.