dorsal/arxiv
View SchemaEnabling Population-Based Architectures for Neural Combinatorial Optimization
| Authors | Andoni Irazusta Garmendia, Josu Ceberio, Alexander Mendiburu |
|---|---|
| Categories | |
| ArXiv ID | 2601.08696vv1 |
| URL | https://arxiv.org/abs/2601.08696 |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Abstract
Neural Combinatorial Optimization (NCO) has mostly focused on learning policies, typically neural networks, that operate on a single candidate solution at a time, either by constructing one from scratch or iteratively improving it. In contrast, decades of work in metaheuristics have shown that maintaining and evolving populations of solutions improves robustness and exploration, and often leads to stronger performance. To close this gap, we study how to make NCO explicitly population-based by learning policies that act on sets of candidate solutions. We first propose a simple taxonomy of population awareness levels and use it to highlight two key design challenges: (i) how to represent a whole population inside a neural network, and (ii) how to learn population dynamics that balance intensification (generating good solutions) and diversification (maintaining variety). We make these ideas concrete with two complementary tools: one that improves existing solutions using information shared across the whole population, and the other generates new candidate solutions that explicitly balance being high-quality with diversity. Experimental results on Maximum Cut and Maximum Independent Set indicate that incorporating population structure is advantageous for learned optimization methods and opens new connections between NCO and classical population-based search.
{
"annotation_id": "f840e970-2b4e-4eb7-bcda-8be0985809d6",
"date_created": "2026-02-17T05:53:15.296000Z",
"date_modified": "2026-02-17T05:53:15.296000Z",
"file_hash": "9863d99aa4abbb364346e0f3f03b6743965795cb84373fcc7272f44d15c8f9ab",
"private": false,
"record": {
"abstract": "Neural Combinatorial Optimization (NCO) has mostly focused on learning policies, typically neural networks, that operate on a single candidate solution at a time, either by constructing one from scratch or iteratively improving it. In contrast, decades of work in metaheuristics have shown that maintaining and evolving populations of solutions improves robustness and exploration, and often leads to stronger performance. To close this gap, we study how to make NCO explicitly population-based by learning policies that act on sets of candidate solutions. We first propose a simple taxonomy of population awareness levels and use it to highlight two key design challenges: (i) how to represent a whole population inside a neural network, and (ii) how to learn population dynamics that balance intensification (generating good solutions) and diversification (maintaining variety). We make these ideas concrete with two complementary tools: one that improves existing solutions using information shared across the whole population, and the other generates new candidate solutions that explicitly balance being high-quality with diversity. Experimental results on Maximum Cut and Maximum Independent Set indicate that incorporating population structure is advantageous for learned optimization methods and opens new connections between NCO and classical population-based search.",
"arxiv_id": "2601.08696",
"authors": [
"Andoni Irazusta Garmendia",
"Josu Ceberio",
"Alexander Mendiburu"
],
"categories": [
"cs.NE",
"cs.LG"
],
"license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
"title": "Enabling Population-Based Architectures for Neural Combinatorial Optimization",
"url": "https://arxiv.org/abs/2601.08696",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a9d64b70-a4ee-4c8b-a5b0-65551a7641cd",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}