An Exponential Lower Bound on the Complexity of Regularization Paths
Bernd GärtnerJoachim GiesenMartin JaggiPublished in: CoRR (2009)
Keyphrases
- lower bound
- average case complexity
- worst case
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- linear complexity
- complexity analysis
- exponential size
- optimal solution
- lower bounding
- average case
- image processing
- data dependent
- prior information
- parameter selection
- shortest path
- computational complexity
- search algorithm
- objective function
- polynomial approximation
- machine learning