Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond

06/08/2021
by   Maria-Florina Balcan, et al.
0

Cutting-plane methods have enabled remarkable successes in integer programming over the last few decades. State-of-the-art solvers integrate a myriad of cutting-plane techniques to speed up the underlying tree-search algorithm used to find optimal solutions. In this paper we prove the first guarantees for learning high-performing cut-selection policies tailored to the instance distribution at hand using samples. We first bound the sample complexity of learning cutting planes from the canonical family of Chvátal-Gomory cuts. Our bounds handle any number of waves of any number of cuts and are fine tuned to the magnitudes of the constraint coefficients. Next, we prove sample complexity bounds for more sophisticated cut selection policies that use a combination of scoring rules to choose from a family of cuts. Finally, beyond the realm of cutting planes for integer programming, we develop a general abstraction of tree search that captures key components such as node selection and variable selection. For this abstraction, we bound the sample complexity of learning a good policy for building the search tree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2021

Improved Learning Bounds for Branch-and-Cut

Branch-and-cut is the most widely used algorithm for solving integer pro...
research
04/15/2022

Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts

The incorporation of cutting planes within the branch-and-bound algorith...
research
03/27/2018

Learning to Branch

Tree search algorithms, such as branch-and-bound, are the most widely us...
research
12/14/2022

Cutting Plane Selection with Analytic Centers and Multiregression

Cutting planes are a crucial component of state-of-the-art mixed-integer...
research
11/11/2020

Complexity of branch-and-bound and cutting planes in mixed-integer optimization – II

We study the complexity of cutting planes and branching schemes from a t...
research
10/09/2017

Stabbing Planes

We introduce and develop a new semi-algebraic proof system, called Stabb...
research
06/27/2022

Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learning

Cutting planes are essential for solving mixed-integer linear problems (...

Please sign up or login with your details

Forgot password? Click here to reset