Graph-COM / Meta_COLinks
the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning
☆9Updated 2 years ago
Alternatives and similar repositories for Meta_CO
Users that are interested in Meta_CO are comparing it to the libraries listed below
Sorting:
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆16Updated 2 years ago
- ☆14Updated 2 years ago
- [ICML'24] Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More☆13Updated last year
- ☆42Updated 2 months ago
- Official Implementation of Our ICLR 2023 paper "ROCO: A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers…☆20Updated 8 months ago
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆27Updated 4 years ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆67Updated 2 years ago
- ☆11Updated 2 years ago
- ☆23Updated last year
- ☆35Updated 2 years ago
- [ICML 2023] Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optim…☆10Updated last year
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆28Updated last year
- ☆26Updated 4 years ago
- ☆25Updated 3 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆49Updated 3 years ago
- ☆32Updated 2 years ago
- Official implementation of the ICML 2022 paper "Going Deeper into Permutation-Sensitive Graph Neural Networks"☆27Updated 3 years ago
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆40Updated 9 months ago
- Code for "Towards Scale-Invariant Graph-related Problem Solving by Iterative Homogeneous GNNs" (NeurIPS 2020)☆18Updated 4 years ago
- ☆21Updated 2 years ago
- [SIGKDD 2023] HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline☆22Updated 2 years ago
- ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs.☆17Updated last month
- This is the code for G2MILP, a deep learning-based mixed-integer linear programming (MILP) instance generator.☆32Updated 9 months ago
- ☆11Updated last year
- A benchmarking suite for maximum independent set solvers.☆51Updated last year
- Implementation of our NeurIPS 2021 paper "A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs".☆100Updated 2 years ago
- [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems☆37Updated 3 months ago
- [NeurIPS 2023] T2T: From Distribution Learning in Training to Gradient Search in Testing for Combinatorial Optimization☆63Updated 2 weeks ago
- ☆36Updated 2 months ago
- Official Repository for the ICLR 2022 paper "Generalization of Neural Combinatorial Solvers through the Lens of Adversarial Robustness"☆14Updated 2 years ago