Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization
Jiwoo Son, Minsu Kim, Hyeonah Kim, Jinkyoo Park
Abstract
This paper proposes Meta-SAGE, a novel approach for improving the scalability of deep reinforcement learning models for combinatorial optimization (CO) tasks. Our method adapts pre-trained models to larger-scale problems in test time by suggesting two components: a scale meta-learner (SML) and scheduled adaptation with guided exploration (SAGE). First, SML transforms the context embedding for subsequent adaptation of SAGE based on scale information. Then, SAGE adjusts the model parameters dedicated to the context embedding for a specific instance. SAGE introduces locality bias, which encourages selecting nearby locations to determine the next location. The locality bias gradually decays as the model is adapted to the target instance. Results show that Meta-SAGE outperforms previous adaptation methods and significantly improves scalability in representative CO tasks. Our source code is available at https://github.com/kaist-silab/meta-sage .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 249fe1d7-08b9-4585-ad9c-08ddfcf3b30fCited by top-tier papers16
- Learning to Handle Complex Constraints for Vehicle Routing ProblemsJieyi Bi, Yining Ma, Jianan Zhou, Wen Song et al.NeurIPS 2024 · 62 citations
- Equity-Transformer: Solving NP-Hard Min-Max Routing Problems as Sequential Generation with Equity ContextJiwoo Son, Minsu Kim, Sanghyeok Choi, Hyeonah Kim et al.AAAI 2024 · 28 citations
- RRNCO: Towards Real-World Routing with Neural Combinatorial OptimizationJiwoo Son, Zhikai Zhao, Federico Berto, Chuanbo Hua et al.ICLR 2026 · 15 citations
- PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial OptimizationFederico Berto, Chuanbo Hua, Laurin Luttmann, Jiwoo Son et al.NeurIPS 2025 · 14 citations
- Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and MoreFanchen Bu, Hyeonsoo Jo, Soo Yong Lee, Sungsoo Ahn et al.ICML 2024 · 8 citations
Builds on13
- Generalize a Small Pre-trained Model to Arbitrarily Large TSP InstancesZhang-Hua Fu, Kai-Bin Qiu, Hongyuan ZhaAAAI 2021 · 247 citations
- Exploratory Combinatorial Optimization with Reinforcement LearningThomas D. Barrett, William R. Clements, Jakob N. Foerster, A. I. LvovskyAAAI 2020 · 218 citations
- Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing ProblemsLiang Xin, Wen Song, Zhiguang Cao, Jie ZhangAAAI 2021 · 209 citations
- DIMES: A Differentiable Meta Solver for Combinatorial Optimization ProblemsRuizhong Qiu, Zhiqing Sun, Yiming YangNeurIPS 2022 · 183 citations
- Learning to delegate for large-scale vehicle routingSirui Li, Zhongxia Yan, Cathy WuNeurIPS 2021 · 181 citations
Related papers
- Instance-wise Adaptive Scheduling via Derivative-Free Meta-LearningHefang Qing, Miao Zhang, Yaoxin Wu, Weinan Huang et al.ICLR 2026
- ScaleMoE: Mixture-of-Experts for Scalable Continuous Control in Actor-Critic Reinforcement LearningYi Ma, Chenjun Xiao, Hongyao Tang, Yaodong Yang et al.ICML 2026
- ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial OptimizationHan Fang, Paul Weng, Yutong BanICML 2026 · 1 citation
- Unsupervised Learning for Combinatorial Optimization Needs Meta LearningHaoyu Peter Wang, Pan LiICLR 2023 · 2 citations
- MaskCO: Masked Generation Drives Effective Representation Learning and Exploiting for Combinatorial OptimizationLvda Chen, Yang Li, Junchi YanICLR 2026
