Adversarial laws of large numbers and optimal regret in online classification

DOI10.1145/3406325.3451041arXiv2101.09054WikidataQ130968544 ScholiaQ130968544MaRDI QIDQ6087016

Noga Alon, Shay Moran, Yuval Dagan, Eylon Yogev, Omri Ben-Eliezer, Moni Naor

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.09054

zbMATH Keywords

online learningrandom samplingadversarial robustnesslittlestone dimensionrobust sampling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A Framework for Adversarially Robust Streaming Algorithms ⋮ Distributionally Robust Inventory Control When Demand Is a Martingale

This page was built for publication: Adversarial laws of large numbers and optimal regret in online classification