L1 Covering Numbers for Uniformly Bounded Convex Functions
Adityanand GuntuboyinaBodhisattva SenPublished in: COLT (2012)
Keyphrases
- convex functions
- covering numbers
- uniform convergence
- vc dimension
- gaussian kernels
- sample complexity
- convex sets
- learning rate
- dc programming
- statistical learning theory
- linear program
- piecewise linear
- objective function
- upper bound
- primal dual
- risk minimization
- sufficient conditions
- reproducing kernel hilbert space
- inductive inference
- convex hull
- lower bound
- convex optimization
- sample size
- linear programming
- worst case
- np hard
- computational complexity