TL;DR
MARCO introduces a memory-augmented reinforcement framework that enhances neural combinatorial optimization by guiding search processes with stored solution data, leading to more diverse and higher-quality solutions efficiently.
Contribution
The paper presents MARCO, a novel memory module integrated into NCO models, improving exploration and solution quality in combinatorial optimization problems.
Findings
Memory module increases exploration and solution diversity.
MARCO achieves higher-quality solutions with low computational cost.
Parallel search threads share memory for collaborative exploration.
Abstract
Neural Combinatorial Optimization (NCO) is an emerging domain where deep learning techniques are employed to address combinatorial optimization problems as a standalone solver. Despite their potential, existing NCO methods often suffer from inefficient search space exploration, frequently leading to local optima entrapment or redundant exploration of previously visited states. This paper introduces a versatile framework, referred to as Memory-Augmented Reinforcement for Combinatorial Optimization (MARCO), that can be used to enhance both constructive and improvement methods in NCO through an innovative memory module. MARCO stores data collected throughout the optimization trajectory and retrieves contextually relevant information at each state. This way, the search is guided by two competing criteria: making the best decision in terms of the quality of the solution and avoiding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
