Lower Bounds for the Empirical Minimization Algorithm.
Shahar MendelsonPublished in: IEEE Trans. Inf. Theory (2008)
Keyphrases
- objective function
- lower bound
- detection algorithm
- np hard
- worst case
- times faster
- k means
- theoretical analysis
- optimal solution
- learning algorithm
- dynamic programming
- convergence rate
- convex hull
- expectation maximization
- upper bound
- cost function
- search space
- preprocessing
- online algorithms
- machine learning
- error function
- lower and upper bounds
- running times
- recognition algorithm
- matching algorithm
- optimization algorithm
- linear programming
- experimental evaluation