Private Stochastic Non-convex Optimization with Improved Utility Rates

被引:0
|
作者
Zhang, Qiuchen [1 ]
Ma, Jing [1 ]
Lou, Jian [1 ,2 ]
Xiong, Li [1 ]
机构
[1] Emory Univ, Atlanta, GA 30322 USA
[2] Xidian Univ, Xian, Peoples R China
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We study the differentially private (DP) stochastic nonconvex optimization with a focus on its understudied utility measures in terms of the expected excess empirical and population risks. While the excess risks are extensively studied for convex optimization, they are rarely studied for nonconvex optimization, especially the expected population risk. For the convex case, recent studies show that it is possible for private optimization to achieve the same order of excess population risk as to the non-private optimization under certain conditions. It still remains an open question for the nonconvex case whether such ideal excess population risk is achievable. In this paper, we progress towards an affirmative answer to this open problem: DP nonconvex optimization is indeed capable of achieving the same excess population risk as to the nonprivate algorithm in most common parameter regimes, under certain conditions (i.e., well-conditioned nonconvexity). We achieve such improved utility rates compared to existing results by designing and analyzing the stagewise DP-SGD with early momentum algorithm. We obtain both excess empirical risk and excess population risk to achieve differential privacy. Our algorithm also features the first known results of excess and population risks for DP-SGD with momentum. Experiment results on both shallow and deep neural networks when respectively applied to simple and complex real datasets corroborate the theoretical results.
引用
收藏
页码:3370 / 3376
页数:7
相关论文
共 50 条
  • [31] Asynchronous Stochastic Frank-Wolfe Algorithms for Non-Convex Optimization
    Gu, Bin
    Xian, Wenhan
    Huang, Heng
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 737 - 743
  • [32] Constrained Non-convex Optimization via Stochastic Variance Reduced Approximations
    Nutalapati, Mohan Krishna
    Krishna, Muppavaram Sai
    Samanta, Atanu
    Rajawat, Ketan
    2019 SIXTH INDIAN CONTROL CONFERENCE (ICC), 2019, : 293 - 298
  • [33] Optimal, Stochastic, Non-smooth, Non-convex Optimization through Online-to-Non-convex Conversion
    Cutkosky, Ashok
    Mehta, Harsh
    Orabona, Francesco
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [34] Improved Harris hawks optimization for non-convex function optimization and design optimization problems
    Kang, Helei
    Liu, Renyun
    Yao, Yifei
    Yu, Fanhua
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 204 : 619 - 639
  • [35] User-level Private Stochastic Convex Optimization with Optimal Rates
    Bassily, Raef
    Sun, Ziteng
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [36] Convergence rates for the stochastic gradient descent method for non-convex objective functions
    Fehrman, Benjamin
    Gess, Benjamin
    Jentzen, Arnulf
    Journal of Machine Learning Research, 2020, 21
  • [37] Convergence Rates for the Stochastic Gradient Descent Method for Non-Convex Objective Functions
    Fehrman, Benjamin
    Gess, Benjamin
    Jentzen, Arnulf
    JOURNAL OF MACHINE LEARNING RESEARCH, 2020, 21
  • [38] Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization
    Metel, Michael R.
    Takeda, Akiko
    JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [39] Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization
    Metel, Michael R.
    Takeda, Akiko
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [40] A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
    Bian, Fengmiao
    Liang, Jingwei
    Zhang, Xiaoqun
    INVERSE PROBLEMS, 2021, 37 (07)