Open Problem: Lower bounds for Boosting with Hadamard Matrices.

Jiazhong Nie Manfred K. Warmuth S. V. N. Vishwanathan Xinhua Zhang

Published in: COLT (2013)

Keyphrases

lower bound
upper bound
objective function
branch and bound
branch and bound algorithm
np hard

optimal solution
vc dimension
learning algorithm
positive definite
upper and lower bounds

lower and upper bounds
worst case
feature selection
ensemble methods
machine learning

lower bounding
optimal cost
weak classifiers
singular value decomposition
concept class