Memory bounds for the experts problem-Reference-Cited by-同舟云学术

Memory bounds for the experts problem

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Srinivas Vaidehi¹,Woodruff David P.²,Xu Ziyu²,Zhou Samson²

Affiliation:

1. Northwestern University, USA

2. Carnegie Mellon University, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520069

Reference63 articles.

1. Prediction with Corrupted Expert Advice;Amir Idan;Advances in Neural Information Processing Systems. 33, Curran Associates, Inc.,2020

2. Yossi Arjevani and Ohad Shamir. 2015. Communication Complexity of Distributed Convex Learning and Optimization. In Advances in Neural Information Processing Systems 28. 1756–1764. Yossi Arjevani and Ohad Shamir. 2015. Communication Complexity of Distributed Convex Learning and Optimization. In Advances in Neural Information Processing Systems 28. 1756–1764.

3. Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits

4. An information statistics approach to data stream and communication complexity

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Memory-Query Tradeoffs for Randomized Convex Optimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Near Optimal Memory-Regret Tradeoff for Online Learning;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Memory Bounds for Continual Learning;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10