arXiv Machine Learning June 10, 2026 By Sobihan Surendran (LPSM), Adeline Fermanian (LPSM), Sylvain Le Corff (LPSM)

Latent Guided Sampling for Combinatorial Optimization

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Aug 31

Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets

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

reinforcement-learning

arXiv Machine Learning

Jun 2

Regularized Large Neighborhood Search

arXiv:2606. 02294v1 Announce Type: new Abstract: Operations research practitioners typically tackle NP-hard combinatorial problems using large neighborhood search (LNS), a scalable heuristic that iteratively refines a current solution by locally re-optimizing subsets of its variables.

By Germain Vivier-Ardisson, Laurent Demonet, Axel Parmentier, Mathieu Blondel

arXiv Machine Learning

Sep 1

Amortizing intractable inference in large language models

arXiv:2310.04363v3 Announce Type: replace Abstract: Autoregressive large language models (LLMs) compress knowledge from their training data through next-token conditional distributions. This limits t...

By Edward J. Hu, Moksh Jain, Eric Elmoznino, Younesse Kaddar, Guillaume Lajoie, Yoshua Bengio, Esmeralda S. Whitammer

llms agents reinforcement-learning fine-tuning

arXiv AI

Jun 3

ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization

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

reinforcement-learning fine-tuning benchmarks

arXiv Machine Learning

Jun 8

Generative Modeling of Discrete Latent Structures via Dynamic Policy Gradients

arXiv:2606. 07400v1 Announce Type: new Abstract: Many scientific problems require inferring unobserved mechanistic latent states from indirect observations.

By Stefan Ivanovic, Ge Liu, Mohammed El-Kebir

arXiv AI

Jun 19

Manifold Bandits: Bayesian Curriculum Learning over the Latent Geometry of Large Language Models

arXiv:2606. 19750v1 Announce Type: cross Abstract: Reinforcement learning (RL) is a central approach for improving reasoning capabilities in large language models (LLMs), where training efficiency depends critically on how problems are sampled during optimization.

By Darrien McKenzie, Nicklas Hansen, Xiaolong Wang

llms reinforcement-learning

One email a morning, machine-written

Related stories

Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets

Regularized Large Neighborhood Search

Amortizing intractable inference in large language models

ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization

Generative Modeling of Discrete Latent Structures via Dynamic Policy Gradients

Manifold Bandits: Bayesian Curriculum Learning over the Latent Geometry of Large Language Models