CAMBranch: Contrastive Learning with Augmented MILPs for Branching
Jiacheng Lin, Meng Xu, Zhihua Xiong, Huangang Wang
摘要
Recent advancements have introduced machine learning frameworks to enhance the Branch and Bound (B&B) branching policies for solving Mixed Integer Linear Programming (MILP). These methods, primarily relying on imitation learning of Strong Branching, have shown superior performance. However, collecting expert samples for imitation learning, particularly for Strong Branching, is a time-consuming endeavor. To address this challenge, we propose Contrastive Learning with Augmented MILPs for Branching (CAMBranch), a framework that generates Augmented MILPs (AMILPs) by applying variable shifting to limited expert data from their original MILPs. This approach enables the acquisition of a considerable number of labeled expert samples. CAMBranch leverages both MILPs and AMILPs for imitation learning and employs contrastive learning to enhance the model's ability to capture MILP features, thereby improving the quality of branching decisions. Experimental results demonstrate that CAMBranch, trained with only 10% of the complete dataset, exhibits superior performance. Ablation studies further validate the effectiveness of our method.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- MILP-StuDio: MILP Instance Generation via Block Structure DecompositionHaoyang Liu, Jie Wang, Wanbo Zhang, Zijie Geng 等NeurIPS 2024 · 被引用 19 次
- Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear ProgrammingHaoyang Liu, Jie Wang, Zijie Geng, Xijun Li 等ICLR 2025
- FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear ProgrammingHongpei Li, Hui Yuan, Han Zhang, Jianghao Lin 等ICLR 2026
它引用的顶会 Paper11
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 被引用 24,064 次
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec 等NeurIPS 2020 · 被引用 9,171 次
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna 等NeurIPS 2020 · 被引用 7,049 次
- Unsupervised Learning of Visual Features by Contrasting Cluster AssignmentsMathilde Caron, Ishan Misra, Julien Mairal, Priya Goyal 等NeurIPS 2020 · 被引用 5,249 次
- Are Graph Augmentations Necessary?: Simple Graph Contrastive Learning for RecommendationJunliang Yu, Hongzhi Yin, Xin Xia, Tong Chen 等SIGIR 2022 · 被引用 658 次
相关 Paper
- Parameterizing Branch-and-Bound Search Trees to Learn Branching PoliciesGiulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua BengioAAAI 2021 · 被引用 123 次
- Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP BranchingTongkai Lu, Shuai Ma, Chongyang TaoICML 2026
- Reinforcement Learning for Branch-and-Bound Optimisation Using Retrospective TrajectoriesChristopher W. F. Parsonson, Alexandre Laterre, Thomas D. BarrettAAAI 2023 · 被引用 30 次
- Towards Imitation Learning to Branch for MIP: A Hybrid Reinforcement Learning based Sample Augmentation ApproachChangwen Zhang, Wenli Ouyang, Hao Yuan, Liming Gong 等ICLR 2024 · 被引用 9 次
- Towards Better Branching Policies: Leveraging the Sequential Nature of Branch-and-Bound TreeCe Zhang, Bin Zhang, Guoliang FanICLR 2026
