7 citations · 11 across the 2 of their papers we have counts for
9 papers
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
The incorporation of cutting planes within the branch-and-bound algorithm, known as branch-and-cut, forms the backbone of modern integer programming solvers. These solvers are the…
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm +1
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…
Generalization in portfolio-based algorithm selection
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
Portfolio-based algorithm selection has seen tremendous practical success over the past two decades. This algorithm configuration procedure works by first selecting a portfolio of…
Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
Automating algorithm configuration is growing increasingly necessary as algorithms come with more and more tunable parameters. It is common to tune parameters using machine learnin…
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design
Maria-Florina Balcan, Dan DeBlasio, Travis Dick +3
Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit mea…
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik
Algorithms typically come with tunable parameters that have a considerable impact on the computational resources they consume. Too often, practitioners must hand-tune the parameter…