mlsanityData to 7 Oct 2026

Machine Learning Insides OptVerse AI Solver: Design Principles and Applications

arXiv 2401.05960 ↗First posted 11 Jan 2024cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

In an era of digital ubiquity, efficient resource management and decision-making are paramount across numerous industries. To this end, we present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI Solver, which aims to mitigate the scarcity of real-world mathematical programming instances, and to surpass the capabilities of traditional optimization techniques. We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem. Furthermore, we introduce a training framework leveraging augmentation policies to maintain solvers' utility in dynamic environments. Besides the data generation and augmentation, our proposed approaches also include novel ML-driven policies for personalized solver strategies, with an emphasis on applications like graph convolutional networks for initial basis selection and reinforcement learning for advanced presolving and cut selection. Additionally, we detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance. Compared with traditional solvers such as Cplex and SCIP, our ML-augmented OptVerse AI Solver demonstrates superior speed and precision across both established benchmarks and real-world scenarios, reinforcing the practical imperative and effectiveness of machine learning techniques in mathematical programming solvers.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 49 of its 115 references that are in the map. First posted on arXiv 11 Jan 2024.

Builds on

49 of 115 references.

References · 49

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  3. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  4. 2016Variational Graph Auto-Encoderscited by 1,373
  5. 2015Pointer Networkscited by 882
  6. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
  7. 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 647
  8. 2018Attention, Learn to Solve Routing Problems!cited by 646
  9. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  10. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  11. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  12. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
37 more
  1. 2018Learning a SAT Solver from Single-Bit Supervisioncited by 198
  2. 2020Solving Mixed Integer Programs Using Neural Networkscited by 178
  3. 2019Reinforcement Learning for Integer Programming: Learning to Cutcited by 108
  4. 2020Hybrid Models for Learning to Branchcited by 95
  5. 2020A Systematic Survey on Deep Generative Models for Graph Generationcited by 94
  6. 2019Exploratory Combinatorial Optimization with Reinforcement Learningcited by 82
  7. 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 81
  8. 2023Generative Diffusion Models on Graphs: Methods and Applicationscited by 79
  9. 2018Learning to Branchcited by 78
  10. 2022A Survey on Deep Graph Generation: Methods and Applicationscited by 69
  11. 2020Parameterizing Branch-and-Bound Search Trees to Learn Branching Policiescited by 62
  12. 2022Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learningcited by 58
  13. 2021Learning to Select Cuts for Efficient Mixed-Integer Programmingcited by 48
  14. 2023De Novo Molecular Generation via Connection-aware Motif Miningcited by 45
  15. 2022A Survey for Solving Mixed Integer Programming via Machine Learningcited by 44
  16. 2023Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Modelcited by 44
  17. 2022On Representing Linear Programs by Graph Neural Networkscited by 39
  18. 2021Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustnesscited by 35
  19. 2021Sample Complexity of Tree Search Configuration: Cutting Planes and Beyondcited by 33
  20. 2021Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradientcited by 31
  21. 2023End-to-End Meta-Bayesian Optimisation with Transformer Neural Processescited by 31
  22. 2023Transfer Learning for Bayesian Optimization: A Surveycited by 27
  23. 2022Lookback for Learning to Branchcited by 26
  24. 2022Adaptive Cut Selection in Mixed-Integer Linear Programmingcited by 25
  25. 2022Machine Learning Methods in Solving the Boolean Satisfiability Problemcited by 22
  26. 2023A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availabilitycited by 21
  27. 2019G2SAT: Learning to Generate SAT Formulascited by 20
  28. 2022Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cutscited by 19
  29. 2018Theoretical challenges towards cutting-plane selectioncited by 16
  30. 2021Learning to Optimize Industry-Scale Dynamic Pickup and Delivery Problemscited by 15
  31. 2022An Improved Reinforcement Learning Algorithm for Learning to Branchcited by 14
  32. 2023HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baselinecited by 12
  33. 2023Promoting Generalization for Exact Solvers via Adversarial Instance Augmentationcited by 12
  34. 2022Learning to Reformulate for Linear Programmingcited by 10
  35. 2023Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learningcited by 7
  36. 2021Learning to Optimize DAG Scheduling in Heterogeneous Environmentcited by 6
  37. 2022Knowledge-Injected Federated Learningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 5; 2026: 1.

7 papers.