The paper introduces a method for tackling combinatorial optimization (CO) problems—often NP‑hard—by leveraging GFlowNets to sample solutions from the solution space. It designs Markov decision processes tailored to various CO tasks and trains conditional GFlowNets, incorporating efficient training techniques for long‑range credit assignment. Experiments on synthetic and realistic datasets show that these GFlowNet policies can efficiently locate high‑quality solutions, and the implementation is publicly available.
By Dinghuai Zhang, Hanjun Dai, Esmeralda S. Whitammer, Aaron Courville, Yoshua Bengio, Ling Pan
arXiv:2506. 03672v2 Announce Type: replace-cross Abstract: Combinatorial Optimization problems are widespread in domains such as logistics, manufacturing, and drug discovery, yet their NP-hard nature makes them computationally challenging.
By Sobihan Surendran (LPSM), Adeline Fermanian (LPSM), Sylvain Le Corff (LPSM)
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
By Han Fang, Paul Weng, Yutong Ban
arXiv:2606. 00366v1 Announce Type: new Abstract: We consider the problem of generating a large collection of initial guesses for local minima of multimodal non-convex continuous optimization problems.
By Anjian Li, Bartolomeo Stellato, Ryne Beeson
arXiv:2507. 21449v2 Announce Type: replace-cross Abstract: Degeneracy is an inherent feature of the loss landscape of neural networks, but it is not well understood how stochastic gradient MCMC (SGMCMC) algorithms interact with this degeneracy.
By Rohan Hitchcock, Jesse Hoogland
GeoPAR is a geometry-guided parallel autoregressive reinforcement learning framework designed for large-scale multi-agent combinatorial optimization. It introduces a projection-window sparse geometry mechanism, sparse edge-biased attention, and cache-guided conflict-aware assignment to better model local geometric structures and reduce duplicate task selections. Experiments on heterogeneous vehicle routing and multi-depot pickup-and-delivery problems demonstrate improved zero-shot generalization, fewer rollout steps, and efficient inference.
By Wenjian Wu, Zesheng Jia, Jiaying Tang, Benyuan Yang, Jin Wang