atlas

Research map / Bandits and online learning / Online convex optimization and games

On Optimal Learning Under Targeted Data Poisoning

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 0 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
Use SPV with the One-inclusion graph learnerRealizable learning under instance-targeted poisoning · Realizable distributions over Hη-adversarial risk: ≤ 42 η dHelped
Allow instance-targeted poisoning of budget ηAny learner for a non-trivial class of VC dimension d · Realizable distributions over non-trivial Hη-adversarial risk: ≥ min{c₂ η d, 1/100}Hurt
Use SPV with an agnostic One-inclusion graph learnerAgnostic learning under instance-targeted poisoning · Agnostic distributions over Hη-adversarial risk: ≤ 6C OPT + 42 C η dHelped
Require a deterministic learner to achieve additive agnostic regret under targeted poisoningAny H with at least two hypotheses · Agnostic distributions supported on two examplesη-adversarial risk: ≥ 2OPT+Ω(η')-O(1/n)Hurt
Maintain properness by projecting the majority vote back into H using the projection-number techniqueRealizable learning for halfspaces · Realizable distributions over halfspaces in ℝ^mη-adversarial risk: ≤ 20 η d^3Helped

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