{"list":"other","total":67,"rows":[{"id":"1602.05629","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","created":"2016-02-17","cited_by_count":7669},{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"2203.00667","title":"Generative Adversarial Networks","created":"2022-03-01","cited_by_count":5627},{"id":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"1908.07873","title":"Federated Learning: Challenges, Methods, and Future Directions","created":"2019-08-21","cited_by_count":1538},{"id":"1806.00582","title":"Federated Learning with Non-IID Data","created":"2018-06-02","cited_by_count":1108},{"id":"2007.07481","title":"Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimization","created":"2020-07-15","cited_by_count":906},{"id":"1805.09767","title":"Local SGD Converges Fast and Communicates Little","created":"2018-05-24","cited_by_count":605},{"id":"1610.02527","title":"Federated Optimization: Distributed Machine Learning for On-Device Intelligence","created":"2016-10-08","cited_by_count":564},{"id":"2002.06440","title":"Federated Learning with Matched Averaging","created":"2020-02-15","cited_by_count":564},{"id":"1608.04636","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","created":"2016-08-16","cited_by_count":539},{"id":"1902.00146","title":"Agnostic Federated Learning","created":"2019-02-01","cited_by_count":456},{"id":"1903.02891","title":"Robust and Communication-Efficient Federated Learning from Non-IID Data","created":"2019-03-07","cited_by_count":419},{"id":"2003.10422","title":"A Unified Theory of Decentralized SGD with Changing Topology and Local Updates","created":"2020-03-23","cited_by_count":367},{"id":"1802.06309","title":"Learning Adversarially Fair and Transferable Representations","created":"2018-02-17","cited_by_count":353},{"id":"2107.06917","title":"A Field Guide to Federated Optimization","created":"2021-07-14","cited_by_count":315},{"id":"1505.05116","title":"Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations","created":"2015-05-19","cited_by_count":291},{"id":"1906.00331","title":"On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems","created":"2019-06-02","cited_by_count":270},{"id":"1909.04746","title":"Tighter Theory for Local SGD on Identical and Heterogeneous Data","created":"2019-09-10","cited_by_count":266},{"id":"2101.11203","title":"Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learning","created":"2021-01-27","cited_by_count":193},{"id":"1905.03817","title":"On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization","created":"2019-05-09","cited_by_count":180},{"id":"1803.06523","title":"Stochastic model-based minimization of weakly convex functions","created":"2018-03-17","cited_by_count":159},{"id":"1902.08297","title":"Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methods","created":"2019-02-21","cited_by_count":148},{"id":"2006.04735","title":"Minibatch vs Local SGD for Heterogeneous Distributed Learning","created":"2020-06-08","cited_by_count":147},{"id":"2102.07053","title":"Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradients","created":"2021-02-14","cited_by_count":123},{"id":"2002.02417","title":"Near-Optimal Algorithms for Minimax Optimization","created":"2020-02-05","cited_by_count":119},{"id":"1910.13598","title":"Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization","created":"2019-10-30","cited_by_count":107},{"id":"2102.12660","title":"Distributionally Robust Federated Averaging","created":"2021-02-25","cited_by_count":104},{"id":"2006.08907","title":"Robust Federated Learning: The Case of Affine Distribution Shifts","created":"2020-06-16","cited_by_count":102},{"id":"2001.03724","title":"Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems","created":"2020-01-11","cited_by_count":77},{"id":"1808.02901","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","created":"2018-08-08","cited_by_count":76},{"id":"1907.01543","title":"Efficient Algorithms for Smooth Minimax Optimization","created":"2019-07-02","cited_by_count":76},{"id":"2102.07922","title":"Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with $\\mathcal{O}(1/k^2)$ Rate on Squared Gradient Norm","created":"2021-02-16","cited_by_count":73},{"id":"2207.14130","title":"FedVARP: Tackling the Variance Due to Partial Client Participation in Federated Learning","created":"2022-07-28","cited_by_count":64},{"id":"1810.02060","title":"Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning","created":"2018-10-04","cited_by_count":63},{"id":"2106.02326","title":"Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problems","created":"2021-06-04","cited_by_count":62},{"id":"1605.00125","title":"Efficiency of minimizing compositions of convex functions and smooth maps","created":"2016-04-30","cited_by_count":59},{"id":"2010.15768","title":"A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems","created":"2020-10-29","cited_by_count":58},{"id":"2006.02032","title":"A Unified Single-loop Alternating Gradient Projection Algorithm for Nonconvex-Concave and Convex-Nonconcave Minimax Problems","created":"2020-06-03","cited_by_count":57},{"id":"2012.14453","title":"Straggler-Resilient Federated Learning: Leveraging the Interplay Between Statistical Accuracy and System Heterogeneity","created":"2020-12-28","cited_by_count":56},{"id":"1902.08294","title":"Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications","created":"2019-02-21","cited_by_count":55},{"id":"1802.08249","title":"On the Convergence and Robustness of Training GANs with Regularized Optimal Transport","created":"2018-02-22","cited_by_count":51},{"id":"2112.05604","title":"Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity","created":"2021-12-10","cited_by_count":49},{"id":"2103.15888","title":"The Complexity of Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-03-29","cited_by_count":45},{"id":"2108.09875","title":"Anarchic Federated Learning","created":"2021-08-23","cited_by_count":42},{"id":"2102.13152","title":"Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiency","created":"2021-02-25","cited_by_count":40},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"2105.03793","title":"Stability and Generalization of Stochastic Gradient Methods for Minimax Problems","created":"2021-05-08","cited_by_count":36},{"id":"2110.10342","title":"Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond","created":"2021-10-20","cited_by_count":36},{"id":"2006.06359","title":"Improved Algorithms for Convex-Concave Minimax Optimization","created":"2020-06-11","cited_by_count":34},{"id":"2008.10103","title":"Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning","created":"2020-08-23","cited_by_count":24},{"id":"2205.15084","title":"SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems","created":"2022-05-30","cited_by_count":23},{"id":"2102.06333","title":"Efficient Algorithms for Federated Saddle Point Optimization","created":"2021-02-12","cited_by_count":20},{"id":"2102.04653","title":"Proximal Gradient Descent-Ascent: Variable Convergence under K{\\L} Geometry","created":"2021-02-09","cited_by_count":18},{"id":"1910.14380","title":"A Decentralized Proximal Point-type Method for Saddle Point Problems","created":"2019-10-31","cited_by_count":17},{"id":"1512.09295","title":"Strategies and Principles of Distributed Machine Learning on Big Data","created":"2015-12-31","cited_by_count":16},{"id":"2106.01761","title":"Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization","created":"2021-06-03","cited_by_count":16},{"id":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","cited_by_count":15},{"id":"2102.07758","title":"Decentralized Distributed Optimization for Saddle Point Problems","created":"2021-02-15","cited_by_count":10},{"id":"2206.01132","title":"A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learning","created":"2022-06-02","cited_by_count":9},{"id":"2206.02078","title":"Straggler-Resilient Personalized Federated Learning","created":"2022-06-05","cited_by_count":9},{"id":"2107.10706","title":"Distributed Saddle-Point Problems Under Similarity","created":"2021-07-22","cited_by_count":8},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8},{"id":"2107.05957","title":"Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks","created":"2021-07-13","cited_by_count":7},{"id":"2106.07289","title":"Decentralized Personalized Federated Learning for Min-Max Problems","created":"2021-06-14","cited_by_count":4},{"id":"2206.00090","title":"Decentralized Saddle-Point Problems with Different Constants of Strong Convexity and Strong Concavity","created":"2022-05-31","cited_by_count":4}],"next_cursor":null}