{"total":18,"rows":[{"id":"2204.09837","title":"Memory Bounds for the Experts Problem","created":"2022-04-21","cited_by_count":20,"area":null},{"id":"2204.10830","title":"Memory Bounds for Continual Learning","created":"2022-04-22","cited_by_count":19,"area":null},{"id":"2207.07974","title":"Online Prediction in Sub-linear Space","created":"2022-07-16","cited_by_count":16,"area":null},{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2203.15260","title":"Efficient Convex Optimization Requires Superlinear Memory","created":"2022-03-29","cited_by_count":14,"area":null},{"id":"2206.02765","title":"Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities","created":"2022-06-06","cited_by_count":11,"area":null},{"id":"2206.04743","title":"Strong Memory Lower Bounds for Learning Natural Models","created":"2022-06-09","cited_by_count":11,"area":null},{"id":"2107.02320","title":"Memory-Sample Lower Bounds for Learning Parity with Noise","created":"2021-07-05","cited_by_count":10,"area":null},{"id":"2302.05707","title":"On Differential Privacy and Adaptive Data Analysis with Bounded Space","created":"2023-02-11","cited_by_count":9,"area":null},{"id":"2102.05047","title":"Bounded Memory Active Learning through Enriched Queries","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2302.04963","title":"Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal","created":"2023-02-09","cited_by_count":5,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","cited_by_count":4,"area":null},{"id":"2205.09804","title":"Estimation of Entropy in Constant Space with Improved Sample Complexity","created":"2022-05-19","cited_by_count":3,"area":null},{"id":"2310.08070","title":"Tight Time-Space Lower Bounds for Constant-Pass Learning","created":"2023-10-12","cited_by_count":2,"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":"2603.13742","title":"Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits","created":"2026-03-14","cited_by_count":1,"area":null},{"id":"2201.03806","title":"Learning what to remember","created":"2022-01-11","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}],"next_cursor":null}