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
摘要
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 .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper16
- Learning to Handle Complex Constraints for Vehicle Routing ProblemsJieyi Bi, Yining Ma, Jianan Zhou, Wen Song 等NeurIPS 2024 · 被引用 62 次
- Equity-Transformer: Solving NP-Hard Min-Max Routing Problems as Sequential Generation with Equity ContextJiwoo Son, Minsu Kim, Sanghyeok Choi, Hyeonah Kim 等AAAI 2024 · 被引用 28 次
- RRNCO: Towards Real-World Routing with Neural Combinatorial OptimizationJiwoo Son, Zhikai Zhao, Federico Berto, Chuanbo Hua 等ICLR 2026 · 被引用 15 次
- PARCO: Parallel AutoRegressive Models for Multi-Agent Combinatorial OptimizationFederico Berto, Chuanbo Hua, Laurin Luttmann, Jiwoo Son 等NeurIPS 2025 · 被引用 14 次
- Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and MoreFanchen Bu, Hyeonsoo Jo, Soo Yong Lee, Sungsoo Ahn 等ICML 2024 · 被引用 8 次
它引用的顶会 Paper13
- Generalize a Small Pre-trained Model to Arbitrarily Large TSP InstancesZhang-Hua Fu, Kai-Bin Qiu, Hongyuan ZhaAAAI 2021 · 被引用 247 次
- Exploratory Combinatorial Optimization with Reinforcement LearningThomas D. Barrett, William R. Clements, Jakob N. Foerster, A. I. LvovskyAAAI 2020 · 被引用 218 次
- Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing ProblemsLiang Xin, Wen Song, Zhiguang Cao, Jie ZhangAAAI 2021 · 被引用 209 次
- DIMES: A Differentiable Meta Solver for Combinatorial Optimization ProblemsRuizhong Qiu, Zhiqing Sun, Yiming YangNeurIPS 2022 · 被引用 183 次
- Learning to delegate for large-scale vehicle routingSirui Li, Zhongxia Yan, Cathy WuNeurIPS 2021 · 被引用 181 次
相关 Paper
- Instance-wise Adaptive Scheduling via Derivative-Free Meta-LearningHefang Qing, Miao Zhang, Yaoxin Wu, Weinan Huang 等ICLR 2026
- ScaleMoE: Mixture-of-Experts for Scalable Continuous Control in Actor-Critic Reinforcement LearningYi Ma, Chenjun Xiao, Hongyao Tang, Yaodong Yang 等ICML 2026
- ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial OptimizationHan Fang, Paul Weng, Yutong BanICML 2026 · 被引用 1 次
- Unsupervised Learning for Combinatorial Optimization Needs Meta LearningHaoyu Peter Wang, Pan LiICLR 2023 · 被引用 2 次
- MaskCO: Masked Generation Drives Effective Representation Learning and Exploiting for Combinatorial OptimizationLvda Chen, Yang Li, Junchi YanICLR 2026
