Paper recorded by Signals 4 on 2026-10-05 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-05 on arXiv · recorded by Signals 4 on 2026-10-06
Category: cs.LG · 机器学习 · first seen 2026-10-06
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 hypothesis. Using a novel lower bound for private online learning and an upper bound for private pr