Computation complexity of branch-and-bound model selection.
Ninad ThakoorVenkat DevarajanJean GaoPublished in: ICCV (2009)
Keyphrases
- model selection
- branch and bound
- branch and bound algorithm
- search algorithm
- lower bound
- cross validation
- search space
- column generation
- upper bound
- hyperparameters
- optimal solution
- sample size
- bayesian learning
- regression model
- combinatorial optimization
- generalization error
- branch and bound procedure
- parameter estimation
- mixture model
- branch and bound search
- variable selection
- error estimation
- network design problem
- lagrangian heuristic
- randomly generated problems
- machine learning
- gaussian process
- branch and bound method
- tree search
- selection criterion
- model selection criteria
- information criterion
- worst case
- feature selection
- max sat
- search tree
- computational complexity
- automatic model selection