Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.
In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the ?-covering number M(C([a, b]d, B), ?, L1) in terms of the relevant constants, where d > 1, a < b ? R, B > 0, and C([a, b]d, B) denotes the set of all convex functions on [a, b]d 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.
Questions and AnswersYou need to be logged in to be able to post here.