Perturbation of convex risk minimization and its application in differential private learning algorithms
Abstract Convex risk minimization is a commonly used setting in learning theory. In this paper, we firstly give a perturbation analysis for such algorithms, and then we apply this result to differential private learning algorithms. Our analysis needs the objective functions to be strongly convex. Th...
Main Authors: | Weilin Nie, Cheng Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2017-01-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13660-016-1280-0 |
Similar Items
-
Perturbed trapezoid inequalities for n th order differentiable convex functions and their applications
by: Duygu Dönmez Demir, et al.
Published: (2020-07-01) -
Differentially Private Confidence Intervals for Empirical Risk Minimization
by: Yue Wang, et al.
Published: (2019-03-01) -
An intermixed iteration for constrained convex minimization problem and split feasibility problem
by: Kanyanee Saechou, et al.
Published: (2019-10-01) -
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
by: Ming Tian, et al.
Published: (2017-01-01) -
Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra
by: N. P. Strelkova
Published: (2013-10-01)