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 条
  • [21] Private Stochastic Convex Optimization: Optimal Rates in Linear Time
    Feldman, Vitaly
    Koren, Tomer
    Talwar, Kunal
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 439 - 449
  • [22] Improved Variance Reduction Methods for Riemannian Non-Convex Optimization
    Han, Andi
    Gao, Junbin
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (11) : 7610 - 7623
  • [23] Improved Time of Arrival measurement model for non-convex optimization
    Sidorenko, Juri
    Schatz, Volker
    Doktorski, Leo
    Scherer-Negenborn, Norbert
    Arens, Michael
    Hugentobler, Urs
    NAVIGATION-JOURNAL OF THE INSTITUTE OF NAVIGATION, 2019, 66 (01): : 117 - 128
  • [24] Non-convex scenario optimization
    Garatti, Simone
    Campi, Marco C.
    MATHEMATICAL PROGRAMMING, 2025, 209 (1-2) : 557 - 608
  • [25] Non-Convex Distributed Optimization
    Tatarenko, Tatiana
    Touri, Behrouz
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (08) : 3744 - 3757
  • [26] Non-Convex Optimization: A Review
    Trehan, Dhruv
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS 2020), 2020, : 418 - 423
  • [27] DUALITY IN NON-CONVEX OPTIMIZATION
    TOLAND, JF
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1978, 66 (02) : 399 - 415
  • [28] Stochastic Optimization for Learning Non-convex Linear Support Vector Machines
    Chen, Jifei
    Wang, Jiabao
    Zhang, Yafei
    Lu, Jianjiang
    Li, Yang
    2012 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT CONTROL, AUTOMATIC DETECTION AND HIGH-END EQUIPMENT (ICADE), 2012, : 35 - 39
  • [29] Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization
    Zhuang, Zhenxun
    Cutkosky, Ashok
    Orabona, Francesco
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [30] Asynchronous Stochastic Quasi-Newton MCMC for Non-Convex Optimization
    Simsekli, Umut
    Yildiz, Cagatay
    Thanh Huy Nguyen
    Richard, Gael
    Cemgil, A. Taylan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80