EECS Department, UC Berkeley; Computer Science Department, Carnegie Mellon University, Optimized Markets, Inc., Strategic Machine, Inc., Strategy Robot, Inc.; School of Computer Science, Carnegie Mellon University; Computer Science Department, Carnegie Mellon University
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik
Automated algorithm configuration;automated algorithm design;data-driven algorithm design;integer programming;tree search;branch-and-bound;branch-and-cut;cutting planes;Chvátal-Gomory cuts;machine learning theory;sample complexity;generalization guarantees
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond