{"list":"other","total":52,"rows":[{"id":"1912.04977","title":"Advances and Open Problems in Federated Learning","created":"2019-12-10","cited_by_count":3046},{"id":"1607.00133","title":"Deep Learning with Differential Privacy","created":"2016-07-01","cited_by_count":2728},{"id":"1805.12471","title":"Neural Network Acceptability Judgments","created":"2018-05-31","cited_by_count":958},{"id":"1802.08232","title":"The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networks","created":"2018-02-22","cited_by_count":864},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1802.03471","title":"Certified Robustness to Adversarial Examples with Differential Privacy","created":"2018-02-09","cited_by_count":468},{"id":"2103.03279","title":"Remember What You Want to Forget: Algorithms for Machine Unlearning","created":"2021-03-04","cited_by_count":371},{"id":"1912.02365","title":"Lower Bounds for Non-Convex Stochastic Optimization","created":"2019-12-05","cited_by_count":307},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"id":"1703.00887","title":"How to Escape Saddle Points Efficiently","created":"2017-03-02","cited_by_count":285},{"id":"1503.02101","title":"Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decomposition","created":"2015-03-06","cited_by_count":243},{"id":"1605.07110","title":"Deep Learning without Poor Local Minima","created":"2016-05-23","cited_by_count":234},{"id":"1908.09970","title":"Private Stochastic Convex Optimization with Optimal Rates","created":"2019-08-27","cited_by_count":186},{"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":"2006.15429","title":"Understanding Gradient Clipping in Private SGD: A Geometric Perspective","created":"2020-06-27","cited_by_count":142},{"id":"1704.00708","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","created":"2017-04-03","cited_by_count":129},{"id":"1802.05251","title":"Differentially Private Empirical Risk Minimization Revisited: Faster and More General","created":"2018-02-14","cited_by_count":128},{"id":"1605.07272","title":"Matrix Completion has No Spurious Local Minimum","created":"2016-05-24","cited_by_count":125},{"id":"1902.03736","title":"A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm","created":"2019-02-11","cited_by_count":106},{"id":"1812.05217","title":"Tight Analyses for Non-Smooth Stochastic Gradient Descent","created":"2018-12-13","cited_by_count":97},{"id":"2206.07136","title":"Automatic Clipping: Differentially Private Deep Learning Made Easier and Stronger","created":"2022-06-14","cited_by_count":88},{"id":"2305.01588","title":"Revisiting Gradient Clipping: Stochastic bias and tight convergence guarantees","created":"2023-05-02","cited_by_count":83},{"id":"1605.07221","title":"Global Optimality of Local Search for Low Rank Matrix Recovery","created":"2016-05-23","cited_by_count":82},{"id":"1711.10456","title":"Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent","created":"2017-11-28","cited_by_count":66},{"id":"1803.05999","title":"Escaping Saddles with Stochastic Gradients","created":"2018-03-15","cited_by_count":66},{"id":"1806.07811","title":"Stochastic Nested Variance Reduction for Nonconvex Optimization","created":"2018-06-20","cited_by_count":63},{"id":"2010.09063","title":"Enabling Fast Differentially Private SGD via Just-in-Time Compilation and Vectorization","created":"2020-10-18","cited_by_count":58},{"id":"1711.02838","title":"Stochastic Cubic Regularization for Fast Nonconvex Optimization","created":"2017-11-08","cited_by_count":55},{"id":"2009.09052","title":"Private Reinforcement Learning with PAC and Regret Guarantees","created":"2020-09-18","cited_by_count":51},{"id":"1511.03607","title":"Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture","created":"2015-11-11","cited_by_count":49},{"id":"1708.08694","title":"Natasha 2: Faster Non-Convex Optimization Than SGD","created":"2017-08-29","cited_by_count":49},{"id":"2306.12517","title":"FFCV: Accelerating Training by Removing Data Bottlenecks","created":"2023-06-21","cited_by_count":49},{"id":"2106.13756","title":"Private Adaptive Gradient Methods for Convex Optimization","created":"2021-06-25","cited_by_count":46},{"id":"1510.01799","title":"Efficient Per-Example Gradient Computations","created":"2015-10-07","cited_by_count":42},{"id":"1711.06673","title":"Neon2: Finding Local Minima via First-Order Oracles","created":"2017-11-17","cited_by_count":36},{"id":"1909.03577","title":"A New Analysis of Differential Privacy's Generalization Guarantees","created":"2019-09-09","cited_by_count":36},{"id":"2206.13033","title":"Normalized/Clipped SGD with Perturbation for Differentially Private Non-Convex Optimization","created":"2022-06-27","cited_by_count":36},{"id":"2206.00846","title":"Faster Rates of Convergence to Stationary Points in Differentially Private Optimization","created":"2022-06-02","cited_by_count":32},{"id":"1711.01944","title":"First-order Stochastic Algorithms for Escaping From Saddle Points in Almost Linear Time","created":"2017-11-03","cited_by_count":29},{"id":"2102.03013","title":"Fast and Memory Efficient Differentially Private-SGD via JL Projections","created":"2021-02-05","cited_by_count":29},{"id":"1602.05908","title":"Efficient approaches for escaping higher order saddle points in non-convex optimization","created":"2016-02-18","cited_by_count":23},{"id":"2101.08925","title":"Differentially Private SGD with Non-Smooth Losses","created":"2021-01-22","cited_by_count":22},{"id":"1812.02282","title":"Differential Privacy Techniques for Cyber Physical Systems: A Survey","created":"2018-12-06","cited_by_count":21},{"id":"1912.06015","title":"Efficient Per-Example Gradient Computations in Convolutional Neural Networks","created":"2019-12-12","cited_by_count":17},{"id":"1901.11518","title":"Stochastic Recursive Variance-Reduced Cubic Regularization Methods","created":"2019-01-31","cited_by_count":12},{"id":"2302.09699","title":"Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks","created":"2023-02-20","cited_by_count":12},{"id":"2111.14069","title":"Escape saddle points by a simple gradient-descent based algorithm","created":"2021-11-28","cited_by_count":11},{"id":"2003.04546","title":"First-Order Methods for Nonconvex Quadratic Minimization","created":"2020-03-10","cited_by_count":10},{"id":"2101.10569","title":"Differential Privacy for Industrial Internet of Things: Opportunities, Applications and Challenges","created":"2021-01-26","cited_by_count":10},{"id":"1806.09222","title":"Analysis of Krylov Subspace Solutions of Regularized Nonconvex Quadratic Problems","created":"2018-06-24","cited_by_count":9},{"id":"1712.09765","title":"Differentially Private Matrix Completion Revisited","created":"2017-12-28","cited_by_count":8}],"next_cursor":null}