Pith. sign in

REVIEW 2 cited by

Learning to Draw Samples: With Application to Amortized MLE for Generative Adversarial Learning

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 1611.01722 v2 pith:V7BDBH2M submitted 2016-11-06 stat.ML cs.LG

classification stat.MLcs.LG
keywords methodneuraltargetadversarialalgorithmamortizedapplicationdeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a simple algorithm to train stochastic neural networks to draw samples from given target distributions for probabilistic inference. Our method is based on iteratively adjusting the neural network parameters so that the output changes along a Stein variational gradient that maximumly decreases the KL divergence with the target distribution. Our method works for any target distribution specified by their unnormalized density function, and can train any black-box architectures that are differentiable in terms of the parameters we want to adapt. As an application of our method, we propose an amortized MLE algorithm for training deep energy model, where a neural sampler is adaptively trained to approximate the likelihood function. Our method mimics an adversarial game between the deep energy model and the neural sampler, and obtains realistic-looking images competitive with the state-of-the-art results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Reinforcement Learning for Flow-Matching Policies with Density Transport

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    RLDT fine-tunes pretrained flow-matching policies for continuous control by aligning them to a max-entropy RL transport field constructed via SVGD, using expected-target estimation for stable multi-step updates.

  2. DIME:Diffusion-Based Maximum Entropy Reinforcement Learning

    cs.LG 2025-02 conditional novelty 6.0 of 10

    DIME derives a variational lower bound on the maximum entropy RL objective for diffusion policies and shows strong continuous-control benchmark results.

Pith tools