arXiv AI

Adversarial Instance Generation and Robust Training for Neural Combinatorial Optimization with Multiple Objectives

arXiv:2601. 01665v2 Announce Type: replace-cross Abstract: Deep reinforcement learning (DRL) has shown great promise in addressing multi-objective combinatorial optimization problems (MOCOPs).

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
arXiv Machine Learning
Sep 14

Robust Policy Optimization via Adversarial Importance Sampling

The paper introduces Adversarial Importance Sampling (Advis), a technique that leverages importance sampling over standard training trajectories to estimate and optimize worst‑case returns without extra environment interactions or auxiliary networks, thereby capturing long‑term robustness. It also presents advrl, a modular PyTorch library that consolidates existing robustness methods and adversarial attacks into single‑file implementations for easier prototyping and reproducible evaluation. Finally, the authors highlight that optimal adversarial hyperparameters do not transfer across agents, prompting evaluation against a broader set of attackers (6–14× more configurations) and demonstrate the effectiveness of their approach on continuous control tasks.

By Amine Andam, Jamal Bentahar, Mustapha Hedabou
arXiv AI
Jun 10

Robust Deep Reinforcement Learning Through Adversarial Attacks and Training : A Survey

arXiv:2403. 00420v3 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) is a subfield of machine learning for training autonomous agents that take sequential actions across complex environments.

By Lucas Schott, Josephine Delas, Hatem Hajri, Elies Gherbi, Reda Yaich, Nora Boulahia-Cuppens, Frederic Cuppens, Sylvain Lamprier
arXiv AI
Aug 25

Memory-Enhanced Neural Solvers for Routing Problems

The paper introduces MEMENTO, a memory‑enhanced neural solver that improves routing problem solutions by using online data from repeated attempts to adjust action distributions during inference. It targets NP‑hard routing tasks such as the Traveling Salesman and Capacitated Vehicle Routing problems, outperforming existing tree‑search and policy‑gradient fine‑tuning methods. MEMENTO demonstrates strong scalability and data efficiency, achieving state‑of‑the‑art results on 11 of 12 evaluated tasks and enabling zero‑shot integration with diversity‑based solvers.

By Felix Chalumeau, Refiloe Shabe, Noah De Nicola, Arnu Pretorius, Thomas D. Barrett, Nathan Grinsztajn