atlas

Research map / Adversarial robustness and security / Certified and empirical robustness

Reducing Adversarially Robust Learning to Non-Robust PAC Learning

NeurIPS 2020 · Adversarial robustness and security › Certified and empirical robustness · approach: Theory of adversarial risk · 2 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
Wrap a non-robust PAC learner with boosting and sparsified majority votesPAC learner A for class C, with explicit perturbation sets · Realizable robust PAC learningsample complexity dependence on |U|: sample complexity independent of |\mathcal{U}|Helped
Use only a non-robust PAC learner, without stronger oracle assumptionsRobust learning with explicit perturbations · Realizable robust PAC learningoracle calls as a function of |U|: O((\log{m}+\log|\mathcal{U}|)^2 + \log(1/\delta)); lower bound \Omega(\log |\mathcal{U}|)Mixed
Use an online learner instead of only a non-robust PAC learnerRobust learning with a mistake oracle · Realizable robust PAC learningdependence of sample and oracle calls on |U|: independent of |\mathcal{U}|Helped
Use a mistake oracle without an online learner, even with an ERMRobust learning with a mistake oracle · Robust empirical learningmistake-oracle calls: T\geq \abs{\mathcal{U}}Hurt

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