{"total":49,"rows":[{"id":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72,"area":null},{"id":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31,"area":null},{"id":"2304.01541","title":"Privacy Amplification via Compression: Achieving the Optimal Privacy-Accuracy-Communication Trade-off in Distributed Mean Estimation","created":"2023-04-04","cited_by_count":22,"area":null},{"id":"2108.02391","title":"Adapting to Function Difficulty and Growth Conditions in Private Optimization","created":"2021-08-05","cited_by_count":20,"area":null},{"id":"2204.09837","title":"Memory Bounds for the Experts Problem","created":"2022-04-21","cited_by_count":20,"area":null},{"id":"2110.02226","title":"Communication-Efficient Federated Learning with Binary Neural Networks","created":"2021-10-05","cited_by_count":14,"area":null},{"id":"2203.04925","title":"Correlated quantization for distributed mean estimation and optimization","created":"2022-03-09","cited_by_count":14,"area":null},{"id":"2203.15260","title":"Efficient Convex Optimization Requires Superlinear Memory","created":"2022-03-29","cited_by_count":14,"area":null},{"id":"2301.12195","title":"BAFFLE: A Baseline of Backpropagation-Free Federated Learning","created":"2023-01-28","cited_by_count":12,"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":"2301.03566","title":"Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints","created":"2023-01-09","cited_by_count":10,"area":null},{"id":"2406.06755","title":"Optimal Federated Learning for Nonparametric Regression with Heterogeneous Distributed Differential Privacy Constraints","created":"2024-06-10","cited_by_count":10,"area":null},{"id":"2210.13386","title":"Contraction of Locally Differentially Private Mechanisms","created":"2022-10-24","cited_by_count":8,"area":null},{"id":"2403.16981","title":"The Sample Complexity of Simple Binary Hypothesis Testing","created":"2024-03-25","cited_by_count":8,"area":null},{"id":"2405.20782","title":"Universal Exact Compression of Differentially Private Mechanisms","created":"2024-05-28","cited_by_count":8,"area":null},{"id":"2110.07751","title":"Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation","created":"2021-10-14","cited_by_count":7,"area":null},{"id":"2203.06870","title":"The Role of Interactivity in Structured Estimation","created":"2022-03-14","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":"2107.01335","title":"Average-Case Communication Complexity of Statistical Problems","created":"2021-07-03","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":"2107.00179","title":"Distributed Nonparametric Function Estimation: Optimal Rate of Convergence and Cost of Adaptation","created":"2021-07-01","cited_by_count":4,"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":"2404.11754","title":"Differentiated Aggregation to Improve Generalization in Federated Learning","created":"2024-04-17","cited_by_count":4,"area":null},{"id":"2405.02341","title":"Improved Communication-Privacy Trade-offs in $L_2$ Mean Estimation under Streaming Differential Privacy","created":"2024-05-02","cited_by_count":4,"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":"2103.04014","title":"Over-the-Air Statistical Estimation","created":"2021-03-06","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":"2303.01709","title":"Streaming Algorithms for Learning with Experts: Deterministic Versus Robust","created":"2023-03-03","cited_by_count":3,"area":null},{"id":"2306.10096","title":"Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2312.05645","title":"Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity","created":"2023-12-09","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":"2402.14925","title":"Efficient Unbiased Sparsification","created":"2024-02-22","cited_by_count":2,"area":null},{"id":"2601.07212","title":"MI-PRUN: Optimize Large Language Model Pruning via Mutual Information","created":"2026-01-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":"2109.14703","title":"Sequential Estimation under Multiple Resources: a Bandit Point of View","created":"2021-09-29","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":"2412.03867","title":"GP-FL: Model-Based Hessian Estimation for Second-Order Over-the-Air Federated Learning","created":"2024-12-05","cited_by_count":1,"area":null},{"id":"2501.03222","title":"Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2512.05327","title":"Non-Convex Federated Optimization under Cost-Aware Client Selection","created":"2025-12-05","cited_by_count":1,"area":null},{"id":"2601.18950","title":"Collaborative Compressors in Distributed Mean Estimation with Limited Communication Budget","created":"2026-01-26","cited_by_count":1,"area":null},{"id":"2606.00703","title":"Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation","created":"2026-05-30","cited_by_count":1,"area":null},{"id":"2301.04022","title":"Distributed Sparse Linear Regression under Communication Constraints","created":"2023-01-09","cited_by_count":0,"area":null},{"id":"2306.08432","title":"Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2605.21103","title":"A Typed Tensor Language for Shared-State Federated Computation","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2606.07124","title":"Information-Theoretic Bounds for Sparse Covariance Estimation in the Vertical-Split Distributed Model","created":"2026-06-05","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},{"id":"2608.02776","title":"Tight Information Complexity of the Coin Problem in the Broadcast Model","created":"2026-08-03","cited_by_count":0,"area":null}],"next_cursor":null}