AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Robust Algorithms on Adaptive Inputs from Bounded Adversaries

ICLR 2023 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds · 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 private-median aggregation over independent randomized data structuresAdaptive query framework · Adaptive queriesspace overhead: \Omega(Q) -> \tO{\sqrt{Q}}Helped
Use the SRHT-specific construction and amortize privacy loss across independent per-point mechanismsAdaptive distance estimation · Adaptive distance estimationspace: \wt{O}(n^{3 / 2} \sqrt{Q}) -> \wt{O} (n \sqrt{Q})Helped
Use the Lipschitz net construction to extend accuracy from a finite net to all queriesKDE data structure · Unlimited adaptive kernel density estimationnumber of adaptive queries supported: any numberHelped
Use the proposed method instead of Baseline 1Adaptive norm estimation · Adaptive norm estimationruntimeHelped
Use the proposed method instead of Baseline 1Adaptive norm estimation · Adaptive norm estimationestimation variabilityHurt
Use Baseline 2 instead of Baseline 1Adaptive norm estimation · Adaptive norm estimationestimation variabilityHurt

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