Branch-and-Bound for Model Selection and Its Computational Complexity.
Ninad ThakoorJean X. GaoPublished in: IEEE Trans. Knowl. Data Eng. (2011)
Keyphrases
- model selection
- branch and bound
- computational complexity
- search algorithm
- lower bound
- cross validation
- branch and bound algorithm
- column generation
- upper bound
- search space
- hyperparameters
- parameter estimation
- combinatorial optimization
- optimal solution
- bayesian learning
- np hard
- randomly generated problems
- tree search
- branch and bound procedure
- sample size
- selection criterion
- np complete
- variable selection
- error estimation
- machine learning
- mixture model
- branch and bound search
- feature selection
- branch and bound method
- model selection criteria
- regression model
- statistical inference
- gaussian process
- tree search algorithm
- network design problem
- special case
- generalization error
- parameter determination
- data mining
- lagrangian heuristic
- bayesian information criterion
- worst case