We propose to organize a workshop on machine learning and combinatorial algorithms. The combination of methods from machine learning and classical AI is an emerging trend. Many researchers have argued that “future AI” methods somehow need to incorporate discrete structures and symbolic/algorithmic reasoning. Additionally, learning-augmented optimization algorithms can impact the broad range of difficult but impactful optimization settings. Coupled learning and combinatorial algorithms have the ability to impact real-world settings such as hardware & software architectural design, self-driving cars, ridesharing, organ matching, supply chain management, theorem proving, and program synthesis among many others. We aim to present diverse perspectives on the integration of machine learning and combinatorial algorithms.
This workshop aims to bring together academic and industrial researchers in order to describe recent advances and build lasting communication channels for the discussion of future research directions pertaining the integration of machine learning and combinatorial algorithms. The workshop will connect researchers with various relevant backgrounds, such as those working on hybrid methods, have particular expertise in combinatorial algorithms, work on problems whose solution likely requires new approaches, as well as everyone interested in learning something about this emerging field of research. We aim to highlight open problems in bridging the gap between machine learning and combinatorial optimization in order to facilitate new research directions.
The workshop will foster the collaboration between the communities by curating a list of problems and challenges to promote the research in the field.
Our technical topics of interest include (but are not limited to):
- Hybrid architectures with combinatorial building blocks
- Attacking hard combinatorial problems with learning
- Neural architectures mimicking combinatorial algorithms
Further information about speakers, paper submissions and schedule are available at the workshop website: https://sites.google.com/view/lmca2020/home .
| Poster Session A: 3:00 AM - 4:30 AM PST (Poster Session) | |
| Opening (Introduction) | |
| Invited Talk (Ellen Vitercik) (Talk) | |
| Invited Talk (Petar Veličković) (Talk) | |
| Q&A for Session (Q&A and Discussions) | |
| Contributed Talk: A Framework For Differentiable Discovery Of Graph Algorithms (Contributed Talk) | |
| Contributed Talk: Learning To Select Nodes In Bounded Suboptimal Conflict-Based Search For Multi-Agent Path Finding (Contributed Talk) | |
| Contributed Talk: Neural Algorithms For Graph Navigation (Contributed Talk) | |
| Contributed Talk: Fit The Right Np-Hard Problem: End-To-End Learning Of Integer Programming Constraints (Contributed Talk) | |
| Contributed Talk: Language Generation Via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach (Contributed Talk) | |
| Q&A for Contributed Talks (Q&A and Discussions) | |
| Break | |
| Poster Session B (Poster Session) | |
| Break | |
| Invited Talk (Zico Kolter) (Talk) | |
| Invited Talk (Katherine Bouman) (Talk) | |
| Invited Talk (Michal Rolinek) (Talk) | |
| Q&A for Session 2 (Q&A and Discussions) | |
| Break | |
| Invited Talk (Armando Solar-Lezama) (Talk) | |
| Invited Talk (Kevin Ellis) (Talk) | |
| Invited Talk (Yuandong Tian) (Talk) | |
| Q&A for Session 3 (Q&A and Discussions) | |
| Guided Discussion and Closing (Discussion) | |
| Session B, Poster 25: Learning For Integer-Constrained Optimization Through Neural Networks With Limited Training (Poster) | |
| Session B, Poster 26: Discrete Planning With Neuro-Algorithmic Policies (Poster) | |
| Session B, Poster 28: Fit The Right Np-Hard Problem: End-To-End Learning Of Integer Programming Constraints (Poster) | |
| Session B, Poster 29: Neural Algorithms For Graph Navigation (Poster) | |
| Session B, Poster 30: Differentiable Programming For Piecewise Polynomial Functions (Poster) | |
| Session B, Poster 32: Reinforcement Learning With Efficient Active Feature Acquisition (Poster) | |
| Session B, Poster 33: Evaluating Curriculum Learning Strategies In Neural Combinatorial Optimization (Poster) | |
| Session B, Poster 34: Language Generation Via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach (Poster) | |
| Session B, Poster 4: Differentiable Top-k With Optimal Transport (Poster) | |
| Session A, Poster 8: K-Plex Cover Pooling For Graph Neural Networks (Poster) | |
| Session B, Poster 18: Improving Learning To Branch Via Reinforcement Learning (Poster) | |
| Session A, Poster 5: Fragment Relation Networks For Geometric Shape Assembly (Poster) | |
| Session A, Poster 11: Investment Vs. Reward In A Competitive Knapsack Problem (Poster) | |
| Session B, Poster 23: Galaxytsp: A New Billion-Node Benchmark For Tsp (Poster) | |
| Session A, Poster 31: Continuous Latent Search For Combinatorial Optimization (Poster) | |
| Session B, Poster 24: Learning To Select Nodes In Bounded Suboptimal Conflict-Based Search For Multi-Agent Path Finding (Poster) | |
| Session B, Poster 10: Ecole: A Gym-Like Library For Machine Learning In Combinatorial Optimization Solvers (Poster) | |
| Session A, Poster 2: Neural Large Neighborhood Search (Poster) | |
| Session B, Poster 3: Xlvin: Executed Latent Value Iteration Nets (Poster) | |
| Session A, Poster 11: Investment Vs. Reward In A Competitive Knapsack Problem (Poster) | |
| Session B, Poster 12: Virtual Savant: Learning For Optimization (Poster) | |
| Session B, Poster 15: CoCo: Learning Strategies For Online Mixed-Integer Control (Poster) | |
| Session B, Poster 19: Dreaming With ARC (Poster) | |
| Session A, Poster 1: Learning Elimination Ordering For Tree Decomposition Problem (Poster) | |
| Session B, Poster 2: Neural Large Neighborhood Search (Poster) | |
| Session B, Poster 20: A Framework For Differentiable Discovery Of Graph Algorithms (Poster) | |
| Session A, Poster 5: Fragment Relation Networks For Geometric Shape Assembly (Poster) | |
| Session A, Poster 6: Structure And Randomness In Planning And Reinforcement Learning (Poster) | |
| Session A, Poster 7: Trust, But Verify: Model-Based Exploration In Sparse Reward Environments (Poster) | |
| Session A, Poster 21: Towards Transferring Algorithm Configurations Across Problems (Poster) | |
| Session B, Poster 8: K-Plex Cover Pooling For Graph Neural Networks (Poster) | |
| Session A, Poster 9: A Step Towards Neural Genome Assembly (Poster) | |
| Session B, Poster 22: Matching Through Embedding In Dense Graphs (Poster) | |
| Session B, Poster 11: Investment Vs. Reward In A Competitive Knapsack Problem (Poster) | |
| Session A, Poster 13: Neural-Driven Multi-Criteria Tree Search For Paraphrase Generation (Poster) | |
| Session A, Poster 17: Wasserstein Learning Of Determinantal Point Processes (Poster) | |
| Session A, Poster 16: Learning Lower Bounds For Graph Exploration With Reinforcement Learning (Poster) | |
| Session B, Poster 21: Towards Transferring Algorithm Configurations Across Problems (Poster) | |
| Session A, Poster 27: A Seq2Seq Approach To Symbolic Regression (Poster) | |
| Session B, Poster 23: Galaxytsp: A New Billion-Node Benchmark For TSP (Poster) | |