
Title |
|---|
Communication Bounds for the Distributed Experts ProblemNeural Information Processing Systems (NeurIPS), 2025 |
![]() Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory
Tradeoff for Feasibility ProblemsIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2024 |
![]() The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for
Pure Exploration in Multi-armed BanditsAnnual Conference Computational Learning Theory (COLT), 2023 |
![]() Memory-Query Tradeoffs for Randomized Convex OptimizationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 |
![]() Tight Regret Bounds for Single-pass Streaming Multi-armed BanditsInternational Conference on Machine Learning (ICML), 2023 Chen Wang |
![]() Near Optimal Memory-Regret Tradeoff for Online LearningIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023 |
![]() Memory Bounds for Continual LearningIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022 |