Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond.
Maria-Florina BalcanSiddharth PrasadTuomas SandholmEllen VitercikPublished in: NeurIPS (2021)
Keyphrases
- tree search
- sample complexity
- cutting plane
- lower bound
- branch and bound
- upper bound
- theoretical analysis
- column generation
- search algorithm
- learning problems
- constraint propagation
- search tree
- special case
- branch and bound algorithm
- active learning
- mathematical programming
- learning algorithm
- generalization error
- optimal solution
- np hard
- sample size
- supervised learning
- state space
- objective function
- path finding
- linear programming
- knapsack problem
- integer programming
- search space
- temporal constraints
- machine learning
- training examples
- scheduling problem
- semi supervised learning
- machine learning algorithms