{"total":24,"rows":[{"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":"2102.05047","title":"Bounded Memory Active Learning through Enriched Queries","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2102.07214","title":"Communication-Efficient Distributed Optimization with Quantized Preconditioners","created":"2021-02-14","cited_by_count":8,"area":null},{"id":"2203.06870","title":"The Role of Interactivity in Structured Estimation","created":"2022-03-14","cited_by_count":7,"area":null},{"id":"2301.09223","title":"Doubly Adversarial Federated Bandits","created":"2023-01-22","cited_by_count":7,"area":null},{"id":"2604.07796","title":"Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes","created":"2026-04-09","cited_by_count":6,"area":null},{"id":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"area":null},{"id":"2303.01453","title":"Improved Space Bounds for Learning with Experts","created":"2023-03-02","cited_by_count":5,"area":null},{"id":"2509.21940","title":"Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity","created":"2025-09-26","cited_by_count":5,"area":null},{"id":"2102.03060","title":"Distributed Sparse Normal Means Estimation with Sublinear Communication","created":"2021-02-05","cited_by_count":3,"area":null},{"id":"2202.00968","title":"Optimal high-dimensional and nonparametric distributed testing under communication constraints","created":"2022-02-02","cited_by_count":3,"area":null},{"id":"2211.17154","title":"On Regret-optimal Cooperative Nonstochastic Multi-armed Bandits","created":"2022-11-30","cited_by_count":3,"area":null},{"id":"2204.10373","title":"Distributed Nonparametric Estimation under Communication Constraints","created":"2022-04-21","cited_by_count":2,"area":null},{"id":"2303.12497","title":"Lower Bounds on the Bayesian Risk via Information Measures","created":"2023-03-22","cited_by_count":2,"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":"2607.02896","title":"Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?","created":"2026-07-03","cited_by_count":2,"area":null},{"id":"2111.02949","title":"Finite-Time Consensus Learning for Decentralized Optimization with Nonlinear Gossiping","created":"2021-11-04","cited_by_count":1,"area":null},{"id":"2308.08046","title":"Regret Lower Bounds in Multi-agent Multi-armed Bandit","created":"2023-08-15","cited_by_count":1,"area":null},{"id":"2312.15225","title":"Statistical Inference with Limited Memory: A Survey","created":"2023-12-23","cited_by_count":1,"area":null},{"id":"2209.07230","title":"Recovery Guarantees for Distributed-OMP","created":"2022-09-15","cited_by_count":0,"area":null},{"id":"2607.24827","title":"Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory","created":"2026-07-21","cited_by_count":0,"area":null}],"next_cursor":null}