{"list":"other","total":66,"rows":[{"id":"1602.05629","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","created":"2016-02-17","cited_by_count":7669},{"id":"1908.09970","title":"Private Stochastic Convex Optimization with Optimal Rates","created":"2019-08-27","cited_by_count":186},{"id":"2005.04763","title":"Private Stochastic Convex Optimization: Optimal Rates in Linear Time","created":"2020-05-10","cited_by_count":153},{"id":"1712.06559","title":"The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learning","created":"2017-12-18","cited_by_count":150},{"id":"1810.07288","title":"Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron","created":"2018-10-16","cited_by_count":143},{"id":"1801.03265","title":"More Adaptive Algorithms for Adversarial Bandits","created":"2018-01-10","cited_by_count":114},{"id":"2010.11425","title":"Differentially-Private Federated Linear Bandits","created":"2020-10-22","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":"1810.00068","title":"Differentially Private Contextual Linear Bandits","created":"2018-09-28","cited_by_count":82},{"id":"1602.04741","title":"Delay and Cooperation in Nonstochastic Bandits","created":"2016-02-15","cited_by_count":71},{"id":"2102.13101","title":"Federated Multi-armed Bandits with Personalization","created":"2021-02-25","cited_by_count":62},{"id":"2110.14177","title":"Federated Linear Contextual Bandits","created":"2021-10-27","cited_by_count":61},{"id":"2101.12204","title":"Federated Multi-Armed Bandits","created":"2021-01-28","cited_by_count":59},{"id":"2010.12763","title":"Federated Bandit: A Gossiping Approach","created":"2020-10-24","cited_by_count":55},{"id":"2006.00701","title":"Locally Differentially Private (Contextual) Bandits Learning","created":"2020-06-01","cited_by_count":53},{"id":"2106.13756","title":"Private Adaptive Gradient Methods for Convex Optimization","created":"2021-06-25","cited_by_count":46},{"id":"1511.08681","title":"Algorithms for Differentially Private Multi-Armed Bandits","created":"2015-11-27","cited_by_count":45},{"id":"1701.07953","title":"The Price of Differential Privacy For Online Learning","created":"2017-01-27","cited_by_count":45},{"id":"1905.09383","title":"An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rule","created":"2019-05-22","cited_by_count":37},{"id":"2007.03121","title":"Multi-Armed Bandits with Local Differential Privacy","created":"2020-07-06","cited_by_count":37},{"id":"2112.00828","title":"The Price of Differential Privacy under Continual Observation","created":"2021-12-01","cited_by_count":34},{"id":"2110.01463","title":"Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits","created":"2021-10-04","cited_by_count":31},{"id":"2207.03106","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","created":"2022-07-07","cited_by_count":28},{"id":"2209.02570","title":"When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits","created":"2022-09-06","cited_by_count":28},{"id":"2202.05567","title":"Shuffle Private Linear Contextual Bandits","created":"2022-02-11","cited_by_count":27},{"id":"2005.06670","title":"Federated Recommendation System via Differential Privacy","created":"2020-05-14","cited_by_count":26},{"id":"2106.02575","title":"Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits","created":"2021-06-04","cited_by_count":25},{"id":"2106.02900","title":"Differentially Private Multi-Armed Bandits in the Shuffle Model","created":"2021-06-05","cited_by_count":24},{"id":"1901.10604","title":"Improved Path-length Regret Bounds for Bandits","created":"2019-01-29","cited_by_count":23},{"id":"2202.11205","title":"Constant matters: Fine-grained Complexity of Differentially Private Continual Observation","created":"2022-02-23","cited_by_count":23},{"id":"1803.01548","title":"Online learning over a finite action set with limited switching","created":"2018-03-05","cited_by_count":21},{"id":"1907.03346","title":"Individual Regret in Cooperative Nonstochastic Multi-Armed Bandits","created":"2019-07-07","cited_by_count":20},{"id":"2207.03445","title":"Differentially Private Stochastic Linear Bandits: (Almost) for Free","created":"2022-07-07","cited_by_count":19},{"id":"1910.10873","title":"Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition","created":"2019-10-24","cited_by_count":17},{"id":"2112.06008","title":"Privacy Amplification via Shuffling for Linear Contextual Bandits","created":"2021-12-11","cited_by_count":17},{"id":"2210.13537","title":"Private Online Prediction from Experts: Separations and Faster Rates","created":"2022-10-24","cited_by_count":17},{"id":"1510.08108","title":"Online Learning with Gaussian Payoffs and Side Observations","created":"2015-10-27","cited_by_count":15},{"id":"2102.03803","title":"Lazy OCO: Online Convex Optimization on a Switching Budget","created":"2021-02-07","cited_by_count":14},{"id":"2205.06491","title":"Tighter Regret Analysis and Optimization of Online Federated Learning","created":"2022-05-13","cited_by_count":14},{"id":"2206.05772","title":"Distributed Differential Privacy in Multi-Armed Bandits","created":"2022-06-12","cited_by_count":14},{"id":"2302.13945","title":"On Differentially Private Federated Linear Contextual Bandits","created":"2023-02-27","cited_by_count":14},{"id":"1505.06556","title":"Differentially Private Distributed Online Learning","created":"2015-05-25","cited_by_count":13},{"id":"1903.01083","title":"Stochastic Online Learning with Probabilistic Graph Feedback","created":"2019-03-04","cited_by_count":12},{"id":"2306.05275","title":"Federated Linear Contextual Bandits with User-level Differential Privacy","created":"2023-06-08","cited_by_count":12},{"id":"2311.05108","title":"Personalized Online Federated Learning with Multiple Kernels","created":"2023-11-09","cited_by_count":11},{"id":"1905.11311","title":"Private Learning Implies Online Learning: An Efficient Reduction","created":"2019-05-27","cited_by_count":10},{"id":"2106.02720","title":"An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning","created":"2021-06-04","cited_by_count":10},{"id":"2106.13513","title":"Littlestone Classes are Privately Online Learnable","created":"2021-06-25","cited_by_count":10},{"id":"2205.14174","title":"Private and Byzantine-Proof Cooperative Decision-Making","created":"2022-05-27","cited_by_count":10},{"id":"1701.04238","title":"Thompson Sampling For Stochastic Bandits with Graph Feedback","created":"2017-01-16","cited_by_count":9},{"id":"2302.14154","title":"Near-Optimal Algorithms for Private Online Optimization in the Realizable Regime","created":"2023-02-27","cited_by_count":9},{"id":"2207.05827","title":"Differentially Private Linear Bandits with Partial Distributed Feedback","created":"2022-07-12","cited_by_count":8},{"id":"2301.09223","title":"Doubly Adversarial Federated Bandits","created":"2023-01-22","cited_by_count":7},{"id":"2311.17586","title":"Federated Online and Bandit Convex Optimization","created":"2023-11-29","cited_by_count":7},{"id":"1605.07596","title":"Local Minimax Complexity of Stochastic Convex Optimization","created":"2016-05-24","cited_by_count":6},{"id":"2302.02526","title":"On Private and Robust Bandits","created":"2023-02-06","cited_by_count":6},{"id":"2205.15268","title":"Federated X-Armed Bandit","created":"2022-05-30","cited_by_count":5},{"id":"2208.14555","title":"Dynamic Global Sensitivity for Differentially Private Contextual Bandits","created":"2022-08-30","cited_by_count":5},{"id":"2306.09588","title":"Understanding the Role of Feedback in Online Learning with Switching Costs","created":"2023-06-16","cited_by_count":4},{"id":"2202.13448","title":"Federated Online Sparse Decision Making","created":"2022-02-27","cited_by_count":3},{"id":"2210.17070","title":"Private optimization in the interpolation regime: faster rates and hardness results","created":"2022-10-31","cited_by_count":3},{"id":"2211.17154","title":"On Regret-optimal Cooperative Nonstochastic Multi-armed Bandits","created":"2022-11-30","cited_by_count":3},{"id":"2301.12061","title":"(Private) Kernelized Bandits with Distributed Biased Feedback","created":"2023-01-28","cited_by_count":3},{"id":"2302.14099","title":"On Differentially Private Online Predictions","created":"2023-02-27","cited_by_count":3},{"id":"2312.11534","title":"Improved Differentially Private and Lazy Online Convex Optimization","created":"2023-12-15","cited_by_count":3},{"id":"2303.15226","title":"Asynchronous Online Federated Learning with Reduced Communication Requirements","created":"2023-03-27","cited_by_count":2}],"next_cursor":null}