REVIEW 2 cited by
Ant Colony Sampling with GFlowNets for Combinatorial 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
read the original abstract
We present the Generative Flow Ant Colony Sampler (GFACS), a novel meta-heuristic method that hierarchically combines amortized inference and parallel stochastic search. Our method first leverages Generative Flow Networks (GFlowNets) to amortize a \emph{multi-modal} prior distribution over combinatorial solution space that encompasses both high-reward and diversified solutions. This prior is iteratively updated via parallel stochastic search in the spirit of Ant Colony Optimization (ACO), leading to the posterior distribution that generates near-optimal solutions. Extensive experiments across seven combinatorial optimization problems demonstrate GFACS's promising performances.
Forward citations
Cited by 2 Pith papers
-
SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy
SHIELD combines Mixture-of-Depths sparsity and context-aware clustering to outperform prior unified neural solvers on multi-task, multi-distribution vehicle routing.
-
Beyond the Proxy: Trajectory-Distilled Guidance for Offline GFlowNet Training
TD-GFN uses IRL-derived edge rewards to prune the environment DAG and sample backward trajectories, training offline GFlowNets directly from ground-truth terminal rewards without a proxy reward model.
Discussion (0). Continue with ORCID to comment.