53 citations · 109 across the 27 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.LG2017★ 53 cited
Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints
Wenlong Mou, Liwei Wang, Xiyu Zhai +1
Algorithm-dependent generalization error bounds are central to statistical learning theory. A learning algorithm may use a large hypothesis space, but the limited number of iterati…
cs.LG2017★ 14 cited
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible
Kai Zheng, Wenlong Mou, Liwei Wang
Non-interactive Local Differential Privacy (LDP) requires data analysts to collect data from users through noisy channel at once. In this paper, we extend the frontiers of Non-inte…
cs.LG2017
Efficient Private ERM for Smooth Objectives
Jiaqi Zhang, Kai Zheng, Wenlong Mou +1
In this paper, we consider efficient differentially private empirical risk minimization from the viewpoint of optimization algorithms. For strongly convex and smooth objectives, we…