AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

On the Hardness of Robust Classification

Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 12 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Require robustness to perturbations of ω(log n) bitsMON-CONJ under the uniform distribution · Uniform distributionrobust learnabilityHurt
Restrict the perturbation budget to O(log n)MON-CONJ under α-log-Lipschitz distributions · α-log-Lipschitz distributionsrobust learnabilityImproved
Require distribution-free robustness against one-bit perturbationsNon-trivial concept classes · Distribution-free on {0,1}^nrobust learnabilityHurt
Encode each input bit in repeated blocks and use a majority decoderConstructed robust-learning class · Constructed concept-distribution pairssample complexity: O\left(\frac{1}{\epsilon}\left(\log\abs{\mathcal{C}_n}+\log\frac{1}{\delta}\right)\right)Improved

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