Pith. sign in

REVIEW 1 cited by

Some Local Measures of Complexity of Convex Hulls and Generalization Bounds

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0405340 v1 pith:5LNSTITL submitted 2004-05-18 math.PR

classification math.PR
keywords boundsconvexclassgeneralizationhullsobtaintermscomplexity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate measures of complexity of function classes based on continuity moduli of Gaussian and Rademacher processes. For Gaussian processes, we obtain bounds on the continuity modulus on the convex hull of a function class in terms of the same quantity for the class itself. We also obtain new bounds on generalization error in terms of localized Rademacher complexities. This allows us to prove new results about generalization performance for convex hulls in terms of characteristics of the base class. As a byproduct, we obtain a simple proof of some of the known bounds on the entropy of convex hulls.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CoT Information: Improved Sample Complexity under Chain-of-Thought Supervision

    stat.ML 2025-05 accept novelty 6.0 of 10

    With chain-of-thought supervision, the PAC sample complexity is roughly d divided by the CoT information, which can be much larger than the target error epsilon.

Pith tools