Pith. sign in

REVIEW 1 cited by

Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexity

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 2003.04180 v1 pith:SGOSALDK submitted 2020-03-09 cs.LG stat.ML

classification cs.LGstat.ML
keywords approximatecomplexitydimensionalkernellinearmarginnotionsvariants
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that such notions are not only sufficient for learning using linear predictors or a kernel, but unlike the exact variants, are also necessary. Thus they are better suited for discussing limitations of linear or kernel methods.

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. VALG: An Agentic System for ML Theory Research

    cs.AI 2026-08 conditional novelty 6.0 of 10

    An agentic system called VALG produced internally finalized theorem candidates for two of nine COLT 2026 open-problem subproblems and weaker partial results for the remaining seven.

Pith tools