Efficient Training of Multi-task Combinarotial Neural Solver with Multi-armed Bandits
Efficiently training a multi-task neural solver for various combinatorial optimization problems (COPs) has been less studied so far. In this paper, we propose a general and efficient training paradigm based on multi-armed bandits to deliver a unified combinarotial multi-task neural solver. To this end, we resort to the theoretical loss decomposition for multiple tasks under an encoder-decoder framework, which enables more efficient training via proper bandit task-sampling algorithms through an intra-task influence matrix. Our method achieves much higher overall performance with either limited training budgets or the same training epochs, compared to standard training schedules, which can be promising for advising efficient training of other multi-task large models. Additionally, the influence matrix can provide empirical evidence of some common practices in the area of learning to optimize, which in turn supports the validity of our approach.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationDecoderMulti-Armed BanditsSimilar Papers 제목 키워드 기반
CalibForge: Adversarial Solver Calibration for Scaling Learnable Terminal Tasks
Training terminal agents requires executable and verifiable tasks that are not merely solvable, but appropriately challenging for learning. Executable validation establishes feasibility, yet does not reveal how a task be…
Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier
The limiting resource for training agents via reinforcement learning (RL) is increasingly frontier task supply: valid, solvable tasks just difficult enough to train the current model. As reasoning and agentic models impr…
Reinforcement LearningLANS: A Layout-Aware Neural Solver for Plane Geometry Problem
Geometry problem solving (GPS) is a challenging mathematical reasoning task requiring multi-modal understanding, fusion, and reasoning. Existing neural solvers take GPS as a vision-language task but are short in the repr…
Geometry Problem SolvingLanguage ModellingMathematical ReasoningGeneralizing Math Word Problem Solvers via Solution Diversification
Current math word problem (MWP) solvers are usually Seq2Seq models trained by the (one-problem; one-solution) pairs, each of which is made of a problem description and a solution showing reasoning flow to get the correct…
MathLifelong Learning with Behavior Consolidation for Vehicle Routing
Recent neural solvers have demonstrated promising performance in learning to solve routing problems. However, existing studies are primarily based on one-off training on one or a set of predefined problem distributions a…
Zero-shot Generalization