In this paper, we study the covering numbers of the space of convex and uniformly bounded functions in multidimension. We find optimal upper and lower bounds for the ε-covering number of C([a, b]d, B), in the Lp-metric, 1 ≤ p0, and C([a, b]d, B) denotes the set of all convex functions on that are uniformly bounded by B. We summarize previously known results on covering numbers for convex functions and also provide alternate proofs of some known results. Our results have direct implications in the study of rates of convergence of empirical minimization procedures as well as optimal convergence rates in the numerous convexity constrained function estimation problems.
No takes yet. Share an insight, caveat, or question.
Guntuboyina et al. (2012) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: