Timezone: »
Combinatorial Optimization (CO) has been a long-standing challenging research topic featured by its NP-hard nature. Traditionally such problems are approximately solved with heuristic algorithms which are usually fast but may sacrifice the solution quality. Currently, machine learning for combinatorial optimization (MLCO) has become a trending research topic, but most existing MLCO methods treat CO as a single-level optimization by directly learning the end-to-end solutions, which are hard to scale up and mostly limited by the capacity of ML models given the high complexity of CO. In this paper, we propose a hybrid approach to combine the best of the two worlds, in which a bi-level framework is developed with an upper-level learning method to optimize the graph (e.g. add, delete or modify edges in a graph), fused with a lower-level heuristic algorithm solving on the optimized graph. Such a bi-level approach simplifies the learning on the original hard CO and can effectively mitigate the demand for model capacity. The experiments and results on several popular CO problems like Directed Acyclic Graph scheduling, Graph Edit Distance and Hamiltonian Cycle Problem show its effectiveness over manually designed heuristics and single-level learning methods.
Author Information
Runzhong Wang (Shanghai Jiao Tong University)
Zhigang Hua (Ant Group)
Gan Liu (Ant Group)
Jiayi Zhang (Shanghai Jiao Tong University)
Junchi Yan (Shanghai Jiao Tong University)
Feng Qi (Meta)
Shuang Yang (Facebook)
Jun Zhou (Ant Financial)
Xiaokang Yang (Shanghai Jiao Tong University)
More from the Same Authors
-
2021 Poster: GRIN: Generative Relation and Intention Network for Multi-agent Trajectory Prediction »
Longyuan Li · Jian Yao · Li Wenliang · Tong He · Tianjun Xiao · Junchi Yan · David Wipf · Zheng Zhang -
2021 Poster: From Canonical Correlation Analysis to Self-supervised Graph Neural Networks »
Hengrui Zhang · Qitian Wu · Junchi Yan · David Wipf · Philip S Yu -
2021 Poster: MixSeq: Connecting Macroscopic Time Series Forecasting with Microscopic Time Series Data »
Zhibo Zhu · Ziqi Liu · Ge Jin · Zhiqiang Zhang · Lei Chen · Jun Zhou · Jianyong Zhou -
2021 Poster: Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach »
Qitian Wu · Chenxiao Yang · Junchi Yan -
2021 Poster: Learning High-Precision Bounding Box for Rotated Object Detection via Kullback-Leibler Divergence »
Xue Yang · Xiaojiang Yang · Jirui Yang · Qi Ming · Wentao Wang · Qi Tian · Junchi Yan -
2021 Poster: On Joint Learning for Solving Placement and Routing in Chip Design »
Ruoyu Cheng · Junchi Yan -
2020 Poster: Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning »
Runzhong Wang · Junchi Yan · Xiaokang Yang -
2020 Poster: Bandit Samplers for Training Graph Neural Networks »
Ziqi Liu · Zhengwei Wu · Zhiqiang Zhang · Jun Zhou · Shuang Yang · Le Song · Yuan Qi -
2019 Poster: Generalization in Generative Adversarial Networks: A Novel Perspective from Privacy Protection »
Bingzhe Wu · Shiwan Zhao · Chaochao Chen · Haoyang Xu · Li Wang · Xiaolu Zhang · Guangyu Sun · Jun Zhou -
2018 Poster: Video Prediction via Selective Sampling »
Jingwei Xu · Bingbing Ni · Xiaokang Yang -
2017 Poster: Wasserstein Learning of Deep Generative Point Process Models »
Shuai Xiao · Mehrdad Farajtabar · Xiaojing Ye · Junchi Yan · Xiaokang Yang · Le Song · Hongyuan Zha -
2009 Poster: Dirichlet-Bernoulli Alignment: A Generative Model for Multi-Class Multi-Label Multi-Instance Corpora »
Shuang Yang · Hongyuan Zha · Bao-Gang Hu