Search Results for author:
Found 7 papers, 0 papers with code
Learning to Cut via Hierarchical Sequence/Set Model for Efficient Mixed-Integer Programming
Moreover, we observe that (P3) what order of selected cuts to prefer significantly impacts the efficiency of MILP solvers as well.
Machine Learning Insides OptVerse AI Solver: Design Principles and Applications
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.
Promoting Generalization for Exact Solvers via Adversarial Instance Augmentation
To tackle this problem, we propose a novel approach, which is called Adversarial Instance Augmentation and does not require to know the problem type for new instance generation, to promote data diversity for learning-based branching modules in the branch-and-bound (B&B) Solvers (AdaSolver).
Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning
Specifically, we formulate the routine design task as a Markov decision process and propose an RL framework with adaptive action sequences to generate high-quality presolve routines efficiently.
Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model
Cut selection -- which aims to select a proper subset of the candidate cuts to improve the efficiency of solving MILPs -- heavily depends on (P1) which cuts should be preferred, and (P2) how many cuts should be selected.
Learning Robust Policy against Disturbance in Transition Dynamics via State-Conservative Policy Optimization
Many existing algorithms learn robust policies by modeling the disturbance and applying it to source environments during training, which usually requires prior knowledge about the disturbance and control of simulators.
Promoting Stochasticity for Expressive Policies via a Simple and Efficient Regularization Method
However, in continuous action spaces, integrating entropy regularization with expressive policies is challenging and usually requires complex inference procedures.
