{"list":"other","total":57,"rows":[{"id":"1602.05629","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","created":"2016-02-17","cited_by_count":7669},{"id":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"1610.05492","title":"Federated Learning: Strategies for Improving Communication Efficiency","created":"2016-10-18","cited_by_count":1475},{"id":"1906.08935","title":"Deep Leakage from Gradients","created":"2019-06-21","cited_by_count":1021},{"id":"1712.07557","title":"Differentially Private Federated Learning: A Client Level Perspective","created":"2017-12-20","cited_by_count":459},{"id":"1909.13014","title":"FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization","created":"2019-09-28","cited_by_count":356},{"id":"1909.04746","title":"Tighter Theory for Local SGD on Identical and Heterogeneous Data","created":"2019-09-10","cited_by_count":266},{"id":"1807.01647","title":"Privacy Amplification by Subsampling: Tight Analyses via Couplings and Divergences","created":"2018-07-04","cited_by_count":242},{"id":"1908.09970","title":"Private Stochastic Convex Optimization with Optimal Rates","created":"2019-08-27","cited_by_count":186},{"id":"2007.01154","title":"Federated Learning with Compression: Unified Analysis and Sharp Guarantees","created":"2020-07-02","cited_by_count":160},{"id":"1805.10559","title":"cpSGD: Communication-efficient and differentially-private distributed SGD","created":"2018-05-27","cited_by_count":158},{"id":"2005.04763","title":"Private Stochastic Convex Optimization: Optimal Rates in Linear Time","created":"2020-05-10","cited_by_count":153},{"id":"2002.07839","title":"Is Local SGD Better than Minibatch SGD?","created":"2020-02-18","cited_by_count":151},{"id":"2006.04735","title":"Minibatch vs Local SGD for Heterogeneous Distributed Learning","created":"2020-06-08","cited_by_count":147},{"id":"1611.00429","title":"Distributed Mean Estimation with Limited Communication","created":"2016-11-02","cited_by_count":136},{"id":"1802.05251","title":"Differentially Private Empirical Risk Minimization Revisited: Faster and More General","created":"2018-02-14","cited_by_count":128},{"id":"1910.13598","title":"Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization","created":"2019-10-30","cited_by_count":107},{"id":"1411.2664","title":"Preserving Statistical Validity in Adaptive Data Analysis","created":"2014-11-10","cited_by_count":103},{"id":"1702.08704","title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","created":"2017-02-28","cited_by_count":83},{"id":"2103.01516","title":"Private Stochastic Convex Optimization: Optimal Rates in $\\ell_1$ Geometry","created":"2021-03-02","cited_by_count":83},{"id":"2102.11845","title":"Learning with User-Level Privacy","created":"2021-02-23","cited_by_count":72},{"id":"2007.11707","title":"Breaking the Communication-Privacy-Accuracy Trilemma","created":"2020-07-22","cited_by_count":68},{"id":"2102.04487","title":"Adaptive Quantization of Model Updates for Communication-Efficient Federated Learning","created":"2021-02-08","cited_by_count":63},{"id":"1506.01900","title":"Communication Complexity of Distributed Convex Learning and Optimization","created":"2015-06-05","cited_by_count":60},{"id":"2004.04250","title":"An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications","created":"2020-04-08","cited_by_count":57},{"id":"2010.11082","title":"On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data","created":"2020-10-21","cited_by_count":51},{"id":"1506.07216","title":"Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality","created":"2015-06-24","cited_by_count":50},{"id":"1508.04874","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","created":"2015-08-20","cited_by_count":50},{"id":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45},{"id":"1512.09170","title":"Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization","created":"2015-12-30","cited_by_count":41},{"id":"2111.00465","title":"DAdaQuant: Doubly-adaptive quantization for communication-efficient Federated Learning","created":"2021-10-31","cited_by_count":41},{"id":"1608.04414","title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back","created":"2016-08-15","cited_by_count":37},{"id":"1805.10222","title":"Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization","created":"2018-05-25","cited_by_count":34},{"id":"2206.09888","title":"SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compression","created":"2022-06-20","cited_by_count":34},{"id":"2206.03665","title":"Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression","created":"2022-06-08","cited_by_count":33},{"id":"2102.01583","title":"The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication","created":"2021-02-02","cited_by_count":31},{"id":"2003.06307","title":"Communication-Efficient Distributed Deep Learning: A Comprehensive Survey","created":"2020-03-10","cited_by_count":26},{"id":"1401.2596","title":"Differentially Private Distributed Optimization","created":"2014-01-12","cited_by_count":24},{"id":"2208.01200","title":"Towards Efficient Communications in Federated Learning: A Contemporary Survey","created":"2022-08-02","cited_by_count":24},{"id":"2005.10783","title":"Fisher information under local differential privacy","created":"2020-05-21","cited_by_count":22},{"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},{"id":"2108.04755","title":"FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learning","created":"2021-08-10","cited_by_count":20},{"id":"2001.03836","title":"Private and Communication-Efficient Edge Learning: A Sparse Differential Gaussian-Masking Distributed SGD Approach","created":"2020-01-12","cited_by_count":18},{"id":"1407.1571","title":"Private Multiplicative Weights Beyond Linear Queries","created":"2014-07-07","cited_by_count":17},{"id":"2205.03014","title":"Differentially Private Generalized Linear Models Revisited","created":"2022-05-06","cited_by_count":17},{"id":"2110.01165","title":"DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization","created":"2021-10-04","cited_by_count":16},{"id":"2006.02582","title":"Local SGD With a Communication Overhead Depending Only on the Number of Workers","created":"2020-06-03","cited_by_count":13},{"id":"2311.03797","title":"User-level Differentially Private Stochastic Convex Optimization: Efficient Algorithms with Optimal Rates","created":"2023-11-07","cited_by_count":12},{"id":"1906.05832","title":"The Communication Complexity of Optimization","created":"2019-06-13","cited_by_count":10},{"id":"1405.0782","title":"Optimality guarantees for distributed statistical estimation","created":"2014-05-05","cited_by_count":9},{"id":"2211.02212","title":"Distributed Linear Bandits under Communication Constraints","created":"2022-11-04","cited_by_count":8},{"id":"2301.08869","title":"A Communication-Efficient Adaptive Algorithm for Federated Learning under Cumulative Regret","created":"2023-01-21","cited_by_count":7},{"id":"2010.08222","title":"Towards Tight Communication Lower Bounds for Distributed Optimisation","created":"2020-10-16","cited_by_count":6},{"id":"1612.03964","title":"Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation","created":"2016-12-12","cited_by_count":5},{"id":"2103.00434","title":"Solving smooth min-min and min-max problems by mixed oracle algorithms","created":"2021-02-28","cited_by_count":4},{"id":"2405.16058","title":"A Novel Privacy Enhancement Scheme with Dynamic Quantization for Federated Learning","created":"2024-05-25","cited_by_count":4},{"id":"1901.05947","title":"Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization","created":"2019-01-17","cited_by_count":1}],"next_cursor":null}