8 citations · 8 across the 1 of their papers we have counts for
6 papers
Noisy Truncated SGD: Optimization and Generalization
Yingxue Zhou, Xinyan Li, Arindam Banerjee
Recent empirical work on stochastic gradient descent (SGD) applied to over-parameterized deep learning has shown that most gradient components over epochs are quite small. Inspired…
Bypassing the Ambient Dimension: Private SGD with Gradient Subspace Identification
Yingxue Zhou, Zhiwei Steven Wu, Arindam Banerjee
Differentially private SGD (DP-SGD) is one of the most popular methods for solving differentially private empirical risk minimization (ERM). Due to its noisy perturbation on each g…
Private Stochastic Non-Convex Optimization: Adaptive Algorithms and Tighter Generalization Bounds
Yingxue Zhou, Xiangyi Chen, Mingyi Hong +2
We study differentially private (DP) algorithms for stochastic non-convex optimization. In this problem, the goal is to minimize the population loss over a -dimensional space gi…
De-randomized PAC-Bayes Margin Bounds: Applications to Non-convex and Non-smooth Predictors
Arindam Banerjee, Tiancong Chen, Yingxue Zhou
In spite of several notable efforts, explaining the generalization of deterministic non-smooth deep nets, e.g., ReLU-nets, has remained challenging. Existing approaches for determi…
Hessian based analysis of SGD for Deep Nets: Dynamics and Generalization
Xinyan Li, Qilong Gu, Yingxue Zhou +2
While stochastic gradient descent (SGD) and variants have been surprisingly successful for training deep nets, several aspects of the optimization dynamics and generalization are s…
Distributed Private Online Learning for Social Big Data Computing over Data Center Networks
Chencheng Li, Pan Zhou, Yingxue Zhou +3
With the rapid growth of Internet technologies, cloud computing and social networks have become ubiquitous. An increasing number of people participate in social networks and massiv…