AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

A Law of Robustness beyond Isoperimetry

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Remove the isoperimetry assumption on the input distribution (arbitrary bounded-support distribution) and keep J-Lipschitz parametrization with p parametersrobust interpolation Lipschitzness lower bound · theoretical: bounded-support arbitrary distributionsLipschitzness lower bound orderHelped
Remove both isoperimetry and J-Lipschitz parametrization assumptions; use Rademacher complexity and covering argumentrobust interpolation Lipschitzness lower bound · theoretical: any function class on bounded supportLipschitzness lower bound orderHelped
Overparametrized regime removed: sample size n exponentially large in d (n = exp(omega(d))) for any O(1)-Lipschitz learnerrobust interpolation with any approximator · theoretical: bounded-support arbitrary distributionsLipschitzness lower bound orderHurt
Increase input dimension d by padding covariates (scattering data in higher dimension)robust interpolation Lipschitzness lower bound · theoretical: bounded-support arbitrary distributionsLipschitzness lower bound order n^{1/d}Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy