ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1506.00034
17
1

Bracketing numbers of convex and mmm-monotone functions on polytopes

29 May 2015
Charles R. Doss
ArXivPDFHTML
Abstract

We study bracketing covering numbers for spaces of bounded convex functions in the LpL_pLp​ norms. Bracketing numbers are crucial quantities for understanding asymptotic behavior for many statistical nonparametric estimators. Bracketing number upper bounds in the supremum distance are known for bounded classes that also have a fixed Lipschitz constraint. However, in most settings of interest, the classes that arise do not include Lipschitz constraints, and so standard techniques based on known bracketing numbers cannot be used. In this paper, we find upper bounds for bracketing numbers of classes of convex functions without Lipschitz constraints on arbitrary polytopes. Our results are of particular interest in many multidimensional estimation problems based on convexity shape constraints. Additionally, we show other applications of our proof methods; in particular we define a new class of multivariate functions, the so-called mmm-monotone functions. Such functions have been considered mathematically and statistically in the univariate case but never in the multivariate case. We show how our proof for convex bracketing upper bounds also applies to the mmm-monotone case.

View on arXiv
Comments on this paper