Covering Numbers for Convex Functions

Details Covering Numbers for Convex Functions Covering Numbers for Convex Functions

2012-03-31

arxiv.org/abs/1204.0147v1

Computer Science

Information Theory

Scientific paper

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 $\epsilon$-covering number of $\C([a, b]^d, B)$, in the $L_p$-metric, $1 \le p < \infty$, in terms of the relevant constants, where $d \geq 1$, $a < b \in \mathbb{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.

Affiliated with

Also associated with

No associations

Rating

Covering Numbers for Convex Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Covering Numbers for Convex Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering Numbers for Convex Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306504