Ren-Research / LOMARLinks
[ICML 2023] Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees
☆11Updated last year
Alternatives and similar repositories for LOMAR
Users that are interested in LOMAR are comparing it to the libraries listed below
Sorting:
- Learning a Latent Search Space for Routing Problems using Variational Autoencoders☆27Updated 3 years ago
- ☆23Updated last year
- Official implementation non-autoregressive combinatorial optimizaiton solvers, covering our ICLR 2023 paper and SCIENTIA SINICA Informati…☆40Updated 9 months ago
- Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.☆20Updated last year
- the official repository of the paper unsupervised learning for combinatorial optimization needs meta learning☆9Updated 2 years ago
- ☆42Updated 2 months ago
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆28Updated last year
- [NeurIPS 2021 | AIJ 2024] Multi-Objective Meta Learning☆15Updated 11 months ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 5 years ago
- ☆35Updated 2 years ago
- ☆10Updated 4 months ago
- Code for ICML2023 Paper: Continuation Path Learning for Homotopy Optimization☆12Updated last year
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆33Updated 5 years ago
- PyTorch implementation for our NeurIPS 2023 spotlight paper "Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with G…☆64Updated 2 years ago
- [NeurIPS 2020 Spotlight Oral] "Training Stronger Baselines for Learning to Optimize", Tianlong Chen*, Weiyi Zhang*, Jingyang Zhou, Shiyu …☆26Updated 3 years ago
- ☆14Updated 2 years ago
- Official Repo for the NeurIPS2020 paper "Erdos Goes Neural: An Unsupervised Learning Framework for Combinatorial Optimization on Graphs"☆49Updated 3 years ago
- Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem☆39Updated 3 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago
- ☆25Updated 3 years ago
- Experiments with distributionally robust optimization (DRO) for deep neural networks☆38Updated 6 years ago
- This is the official implementation for COSMOS: a method to learn Pareto fronts that scales to large datasets and deep models.☆39Updated 4 years ago
- ☆26Updated 4 years ago
- Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"☆38Updated last year
- ☆24Updated last year
- [AAAI-23] Improving Pareto Front Learning via Multi-Sample Hypernetworks☆9Updated 10 months ago
- ☆32Updated 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
- [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"☆20Updated 7 months ago
- ☆21Updated 3 years ago