REVIEW 2 cited by
BatchGFN: Generative Flow Networks for Batch Active 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
Signed reviews
read the original abstract
We introduce BatchGFN -- a novel approach for pool-based active learning that uses generative flow networks to sample sets of data points proportional to a batch reward. With an appropriate reward function to quantify the utility of acquiring a batch, such as the joint mutual information between the batch and the model parameters, BatchGFN is able to construct highly informative batches for active learning in a principled way. We show our approach enables sampling near-optimal utility batches at inference time with a single forward pass per point in the batch in toy regression problems. This alleviates the computational complexity of batch-aware algorithms and removes the need for greedy approximations to find maximizers for the batch reward. We also present early results for amortizing training across acquisition steps, which will enable scaling to real-world tasks.
Forward citations
Cited by 2 Pith papers
-
Path-dependent Discrete Amortized Inference
Adding a learned path-dependent latent state to GFlowNet policies strictly increases their expressive power and improves convergence on discrete compositional sampling benchmarks.
-
Why Pool When You Can Flow? Active Learning with GFlowNets
Training a GFlowNet to generate high-BALD molecules gives pool-size-independent acquisition and near-BALD classification quality on JAK2 virtual screening.
Discussion (0). Continue with ORCID to comment.