Pith. sign in

REVIEW 1 cited by

Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimization

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 2310.02679 v3 pith:VTEBSE6P submitted 2023-10-04 cs.LG cs.AIstat.COstat.MEstat.ML

classification cs.LGcs.AIstat.COstat.MEstat.ML
keywords learningflowgenerativeapproachesdgfsdiffusionpartialsamplers
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We tackle the problem of sampling from intractable high-dimensional density functions, a fundamental task that often appears in machine learning and statistics. We extend recent sampling-based approaches that leverage controlled stochastic processes to model approximate samples from these target densities. The main drawback of these approaches is that the training objective requires full trajectories to compute, resulting in sluggish credit assignment issues due to use of entire trajectories and a learning signal present only at the terminal time. In this work, we present Diffusion Generative Flow Samplers (DGFS), a sampling-based framework where the learning process can be tractably broken down into short partial trajectory segments, via parameterizing an additional "flow function". Our method takes inspiration from the theory developed for generative flow networks (GFlowNets), allowing us to make use of intermediate learning signals. Through various challenging experiments, we demonstrate that DGFS achieves more accurate estimates of the normalization constant than closely-related prior methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. 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