By Topic

Covering Numbers for Convex Functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guntuboyina, A. ; Dept. of Stat., Univ. of California, Berkeley, Berkeley, CA, USA ; Sen, B.

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 ≤ p <; ∞, in terms of the relevant constants, where d ≥ 1, a <; b ∈ ℝ, B > 0, 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.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 4 )