{"list":"other","total":55,"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":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1610.05492","title":"Federated Learning: Strategies for Improving Communication Efficiency","created":"2016-10-18","cited_by_count":1475},{"id":"1511.04599","title":"DeepFool: a simple and accurate method to fool deep neural networks","created":"2015-11-14","cited_by_count":1318},{"id":"1907.02189","title":"On the Convergence of FedAvg on Non-IID Data","created":"2019-07-04","cited_by_count":1229},{"id":"1805.09767","title":"Local SGD Converges Fast and Communicates Little","created":"2018-05-24","cited_by_count":605},{"id":"1405.4980","title":"Convex Optimization: Algorithms and Complexity","created":"2014-05-20","cited_by_count":575},{"id":"2107.06917","title":"A Field Guide to Federated Optimization","created":"2021-07-14","cited_by_count":315},{"id":"1909.04746","title":"Tighter Theory for Local SGD on Identical and Heterogeneous Data","created":"2019-09-10","cited_by_count":266},{"id":"1511.03575","title":"Federated Optimization:Distributed Optimization Beyond the Datacenter","created":"2015-11-11","cited_by_count":195},{"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":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"2202.09357","title":"ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!","created":"2022-02-18","cited_by_count":134},{"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":"1708.01012","title":"On the convergence properties of a $K$-step averaging stochastic gradient descent algorithm for nonconvex optimization","created":"2017-08-03","cited_by_count":92},{"id":"2006.08950","title":"Federated Accelerated Stochastic Gradient Descent","created":"2020-06-16","cited_by_count":85},{"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":"2106.02326","title":"Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax Problems","created":"2021-06-04","cited_by_count":62},{"id":"2106.02969","title":"FedNL: Making Newton-Type Methods Applicable to Federated Learning","created":"2021-06-05","cited_by_count":52},{"id":"2011.08474","title":"Federated Composite Optimization","created":"2020-11-17","cited_by_count":49},{"id":"1806.00877","title":"Multi-Agent Reinforcement Learning via Double Averaging Primal-Dual Optimization","created":"2018-06-03","cited_by_count":40},{"id":"2111.03741","title":"Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspective","created":"2021-11-05","cited_by_count":38},{"id":"2203.04850","title":"Federated Minimax Optimization: Improved Convergence Analyses and Algorithms","created":"2022-03-09","cited_by_count":37},{"id":"1905.11373","title":"Revisiting Stochastic Extragradient","created":"2019-05-27","cited_by_count":35},{"id":"2103.04410","title":"Optimistic Dual Extrapolation for Coherent Non-monotone Variational Inequalities","created":"2021-03-07","cited_by_count":29},{"id":"2111.09961","title":"A Review of Adversarial Attack and Defense for Classification Methods","created":"2021-11-18","cited_by_count":29},{"id":"2106.08315","title":"Decentralized Local Stochastic Extra-Gradient for Variational Inequalities","created":"2021-06-15","cited_by_count":25},{"id":"1805.06792","title":"Faster Rates for Convex-Concave Games","created":"2018-05-17","cited_by_count":23},{"id":"2102.06333","title":"Efficient Algorithms for Federated Saddle Point Optimization","created":"2021-02-12","cited_by_count":20},{"id":"1407.0753","title":"Global convergence of splitting methods for nonconvex composite optimization","created":"2014-07-03","cited_by_count":19},{"id":"2106.04469","title":"Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks","created":"2021-06-08","cited_by_count":19},{"id":"2011.06572","title":"Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration","created":"2020-11-12","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":"2007.04528","title":"Higher-order methods for convex-concave min-max optimization and monotone variational inequalities","created":"2020-07-09","cited_by_count":16},{"id":"2202.09674","title":"Generalized Optimistic Methods for Convex-Concave Saddle Point Problems","created":"2022-02-19","cited_by_count":16},{"id":"2002.11534","title":"Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis","created":"2020-02-25","cited_by_count":15},{"id":"1911.12527","title":"Sparse-GAN: Sparsity-constrained Generative Adversarial Network for Anomaly Detection in Retinal OCT Image","created":"2019-11-28","cited_by_count":14},{"id":"2010.13112","title":"Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms","created":"2020-10-25","cited_by_count":14},{"id":"2107.05680","title":"Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions","created":"2021-07-12","cited_by_count":14},{"id":"2102.09234","title":"ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks","created":"2021-02-18","cited_by_count":13},{"id":"2103.09344","title":"On Accelerated Methods for Saddle-Point Problems with Composite Structure","created":"2021-03-16","cited_by_count":13},{"id":"2101.00052","title":"Federated Nonconvex Sparse Learning","created":"2020-12-31","cited_by_count":10},{"id":"2110.08477","title":"FedMM: Saddle Point Optimization for Federated Adversarial Domain Adaptation","created":"2021-10-16","cited_by_count":9},{"id":"1908.08930","title":"Sparse Generative Adversarial Network","created":"2019-08-20","cited_by_count":8},{"id":"1311.1098","title":"Mirror Prox Algorithm for Multi-Term Composite Minimization and Semi-Separable Problems","created":"2013-11-05","cited_by_count":7},{"id":"1702.06429","title":"Stochastic Composite Least-Squares Regression with convergence rate O(1/n)","created":"2017-02-21","cited_by_count":7},{"id":"2010.11737","title":"Efficient Projection-Free Algorithms for Saddle Point Problems","created":"2020-10-21","cited_by_count":6},{"id":"2110.02954","title":"A Stochastic Newton Algorithm for Distributed Convex Optimization","created":"2021-10-07","cited_by_count":6},{"id":"1607.02536","title":"A primal-dual method for conic constrained distributed optimization problems","created":"2016-07-08","cited_by_count":4},{"id":"2106.14075","title":"Decentralized Composite Optimization in Stochastic Networks: A Dual Averaging Approach with Linear Convergence","created":"2021-06-26","cited_by_count":4},{"id":"2205.14056","title":"Dual Convexified Convolutional Neural Networks","created":"2022-05-27","cited_by_count":1}],"next_cursor":null}