arXiv (All)
open access
Private online learning and prediction for Littlestone classes
We study mistake bounds for differentially private online learning and online prediction under oblivious realisable adversaries. Online learning requires the learner to release a hypothesis at each time step whereas in online prediction, the learner only needs to make predictions without releasing a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning#609724
- Private online learning and prediction for Littlestone classes#1194308
- Adversarial Online Classification with a Preview#790262
- Adaptive and oblivious statistical adversaries are equivalent#1155022
- Stabilizing updates in differentially private stochastic gradient descent with buffered rejection.#150196
Record · ID 1218385
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive