arXiv Machine Learning June 2, 2026 By Germain Vivier-Ardisson, Laurent Demonet, Axel Parmentier, Mathieu Blondel

Regularized Large Neighborhood Search

Read the original on arXiv Machine Learning →

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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 10

Latent Guided Sampling for Combinatorial Optimization

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)

diffusion reinforcement-learning benchmarks

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 2

GLENS: Global Search via Learning from Solver Iterates with Diffusion Models

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

diffusion robotics multimodal benchmarks

arXiv Machine Learning

Aug 4

From Global to Local: A Scalable Benchmark for Local Posterior Sampling

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

benchmarks

arXiv Machine Learning

Jul 27

Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates

arXiv:2607. 22467v1 Announce Type: new Abstract: Data scarcity poses a fundamental challenge in training generative models to produce initial guesses for parametric optimization problems that are otherwise numerically expensive to solve.

By Anjian Li, Ryne Beeson

arXiv Machine Learning

Jul 30

Optimality of Sub-network Laplace Approximations: New Results and Methods

arXiv:2605. 09075v2 Announce Type: replace-cross Abstract: Although the Laplace approximation offers a simple route to uncertainty quantification in deep neural networks, its reliance on inverting large Hessian matrices has motivated a range of computationally feasible low-dimensional or sparse approximations.

By Swarnali Raha, Kshitij Khare, Rohit K Patra

benchmarks safety

Related stories

Latent Guided Sampling for Combinatorial Optimization

ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization

GLENS: Global Search via Learning from Solver Iterates with Diffusion Models

From Global to Local: A Scalable Benchmark for Local Posterior Sampling

Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates

Optimality of Sub-network Laplace Approximations: New Results and Methods