68 citations · 135 across the 16 of their papers we have counts for
4 papers · 1 filter
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…
Learning to Branch
Maria-Florina Balcan, Travis Dick, Tuomas Sandholm +1
Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial and nonconvex problems. For example, they are the foremost method for sol…