GOAL: A Generalist Combinatorial Optimization Agent Learning

2024-06-21 · Darko Drakulic, Sofia Michel, Jean-Marc Andreoli

Machine Learning-based heuristics have recently shown impressive performance in solving a variety of hard combinatorial optimization problems (COPs). However they generally rely on a separate neural model, specialized and trained for each single problem. Any variation of a problem requires adjustment of its model and re-training from scratch. In this paper, we propose GOAL (for Generalist combinatorial Optimization Agent Learning), a generalist model capable of efficiently solving multiple COPs and which can be fine-tuned to solve new COPs. GOAL consists of a single backbone plus light-weight problem-specific adapters for input and output processing. The backbone is based on a new form of mixed-attention blocks which allows to handle problems defined on graphs with arbitrary combinations of node, edge and instance-level features. Additionally, problems which involve heterogeneous types of nodes or edges are handled through a novel multi-type transformer architecture, where the attention blocks are duplicated to attend the meaningful combinations of types while relying on the same shared parameters. We train GOAL on a set of routing, scheduling and classic graph problems and show that it is only slightly inferior to the specialized baselines while being the first multi-task model that solves a wide range of COPs. Finally we showcase the strong transfer learning capacity of GOAL by fine-tuning it on several new problems. Our code is available at https://github.com/naver/goal-co/.

📄 PDF Abstract BibTeX arXiv:2406.15079

Code (1)

naver/goal-co 공식 구현 pytorch

Tasks

Combinatorial OptimizationSchedulingTransfer Learning

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Attention 설명 없음

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Vision-Language Models as a Source of Rewards

2023-12-14 · Kate Baumli, Satinder Baveja, Feryal Behbahani, Harris Chan 외

Building generalist agents that can accomplish many goals in rich open-ended environments is one of the research frontiers for reinforcement learning. A key limiting factor for building generalist agents with RL has been…

reinforcement-learning Reinforcement Learning

What Must Generalist Agents Remember?

2026-06-17 · Khurram Yamin, Namrata Deka, Maitreyi Swaroop, Albert Ting 외 arxiv

This paper develops a formal account of what generalist agents must store in memory in order to act near-optimally across multiple environments and goals. It shows that when two domains share an observational bottleneck …

Self-Predictive Representations for Combinatorial Generalization in Behavioral Cloning

2025-06-11 · Daniel Lawson, Adriana Hugessen, Charlotte Cloutier, Glen Berseth 외

Behavioral cloning (BC) methods trained with supervised learning (SL) are an effective way to learn policies from human demonstrations in domains like robotics. Goal-conditioning these policies enables a single generalis…

Representation Learning

Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization

2020-02-11 · Dmitrii Beloborodov, A. E. Ulanov, Jakob N. Foerster, Shimon Whiteson 외

Quantum hardware and quantum-inspired algorithms are becoming increasingly popular for combinatorial optimization. However, these algorithms may require careful hyperparameter tuning for each problem instance. We use a r…

Combinatorial Optimization Hyperparameter Optimization reinforcement-learning Reinforcement Learning+2

SIMA 2: A Generalist Embodied Agent for Virtual Worlds

2025-12-04 · SIMA team, Adrian Bolton, Alexander Lerchner, Alexandra Cordell 외 arxiv

We introduce SIMA 2, a generalist embodied agent that understands and acts in a wide variety of 3D virtual worlds. Built upon a Gemini foundation model, SIMA 2 represents a significant step toward active, goal-directed i…