REVIEW 1 cited by
$\ell_{\infty}$ Vector Contraction for Rademacher 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
abstract
We show that the Rademacher complexity of any $\mathbb{R}^{K}$-valued function class composed with an $\ell_{\infty}$-Lipschitz function is bounded by the maximum Rademacher complexity of the restriction of the function class along each coordinate, times a factor of $\tilde{O}(\sqrt{K})$.
Forward citations
Cited by 1 Pith paper
-
Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
A new k-DTW distance for polygonal curves combines Fréchet-like robustness with DTW-like flexibility, with exact and approximate algorithms plus dimension-free learning bounds.
Discussion (0). Continue with ORCID to comment.