Pith. sign in

REVIEW 3 cited by

No Trick, No Treat: Pursuits and Challenges Towards Simulation-free Training of Neural Samplers

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 2502.06685 v2 pith:MXKGKT5A submitted 2025-02-10 cs.LG stat.ML

No Trick, No Treat: Pursuits and Challenges Towards Simulation-free Training of Neural Samplers

classification cs.LG stat.ML
keywords neuralsamplerstrainingmethodssimulation-freedistributiondrawgenerative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the sampling problem, where the aim is to draw samples from a distribution whose density is known only up to a normalization constant. Recent breakthroughs in generative modeling to approximate a high-dimensional data distribution have sparked significant interest in developing neural network-based methods for this challenging problem. However, neural samplers typically incur heavy computational overhead due to simulating trajectories during training. This motivates the pursuit of simulation-free training procedures of neural samplers. In this work, we propose an elegant modification to previous methods, which allows simulation-free training with the help of a time-dependent normalizing flow. However, it ultimately suffers from severe mode collapse. On closer inspection, we find that nearly all successful neural samplers rely on Langevin preconditioning to avoid mode collapsing. We systematically analyze several popular methods with various objective functions and demonstrate that, in the absence of Langevin preconditioning, most of them fail to adequately cover even a simple target. Finally, we draw attention to a strong baseline by combining the state-of-the-art MCMC method, Parallel Tempering (PT), with an additional generative model to shed light on future explorations of neural samplers.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. Bayesian Experimental Design via Score Matching

    stat.ML 2026-07 conditional novelty 7.0

    SCOREBED isolates EIG double intractability in a policy-independent score-matching stage, then trains design policies with a singly intractable gradient estimator, enabling cheap multi-policy selection.

  2. Markov Chain Monte Carlo with Diffusion Paths

    stat.CO 2026-07 accept novelty 6.0

    MAD-Path uses forward–backward diffusion paths as Metropolis proposals so multimodal targets stay invariant and mode weights are preserved better than under tempering.

  3. Guided Discovery of New Behaviors using Diffusion Policies

    cs.RO 2026-06 unverdicted novelty 6.0

    A framework combining Feynman-Kac correctors with a guiding potential mines and repairs novel trajectories to enable diffusion policies to discover diverse executable behaviors in robotic manipulation.