{"total":16,"rows":[{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2312.04027","title":"The sample complexity of multi-distribution learning","created":"2023-12-07","cited_by_count":12,"area":null},{"id":"2306.02208","title":"Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits","created":"2023-06-03","cited_by_count":9,"area":null},{"id":"2402.07443","title":"The I/O Complexity of Attention, or How Optimal is Flash Attention?","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2303.01453","title":"Improved Space Bounds for Learning with Experts","created":"2023-03-02","cited_by_count":5,"area":null},{"id":"2309.03145","title":"The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits","created":"2023-09-06","cited_by_count":5,"area":null},{"id":"2306.07903","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","created":"2023-06-13","cited_by_count":4,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","cited_by_count":4,"area":null},{"id":"2405.19752","title":"Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits","created":"2024-05-30","cited_by_count":4,"area":null},{"id":"2303.01709","title":"Streaming Algorithms for Learning with Experts: Deterministic Versus Robust","created":"2023-03-03","cited_by_count":3,"area":null},{"id":"2404.06720","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","created":"2024-04-10","cited_by_count":1,"area":null},{"id":"2501.03132","title":"Communication Bounds for the Distributed Experts Problem","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","cited_by_count":1,"area":null},{"id":"2603.00803","title":"Lookahead identification in adversarial bandits: accuracy and memory bounds","created":"2026-02-28","cited_by_count":0,"area":null},{"id":"2603.09168","title":"Better Bounds for the Distributed Experts Problem","created":"2026-03-10","cited_by_count":0,"area":null},{"id":"2608.07922","title":"Memory--Batch Tradeoffs in Lipschitz Bandits","created":"2026-08-08","cited_by_count":0,"area":null}],"next_cursor":null}