Research map / Bandits and online learning / Online convex optimization and games
Online Learning via the Differential Privacy Lens
Jacob D. Abernethy, Young Hun Jung, Chansoo Lee, Audra McMillan, Ambuj Tewari
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use objective perturbation with Gaussian noise | Online convex optimization · Loss-only OCO | expected regret bound: O\left( \sqrt{L^{*}_{T} (\gamma D^{2} + D\sqrt{d(\beta^{2} \log (B T))}) } \right) | Improved |
| Add clipping (ablation) | GBPA for bandits with experts · K-armed bandits with N experts | expected regret bound: O\left( (K \log N)^{1/3} (L^*_T)^{2/3} \right) | Improved |
Closest papers by meaning
- The Price of Differential Privacy for Online Learning (ICML 2017 · similarity 0.95)
- The Limits of Differential Privacy in Online Learning (NeurIPS 2024 · similarity 0.92)
- Revisiting Differentially Private Algorithms for Decentralized Online Learning (ICML 2025 · similarity 0.90)
- Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret (ICML 2025 · similarity 0.89)
- Private Online Learning via Lazy Algorithms (NeurIPS 2024 · similarity 0.89)
- Improved Differentially Private and Lazy Online Convex Optimization: Lower Regret without Smoothness Requirements (ICML 2024 · similarity 0.89)
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.
