IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v195y2022i2d10.1007_s10957-022-02093-0.html
   My bibliography  Save this article

Perturbed Iterate SGD for Lipschitz Continuous Loss Functions

Author

Listed:
  • Michael R. Metel

    (Huawei Noah’s Ark Lab)

  • Akiko Takeda

    (The University of Tokyo
    RIKEN Center for Advanced Intelligence Project)

Abstract

This paper presents an extension of stochastic gradient descent for the minimization of Lipschitz continuous loss functions. Our motivation is for use in non-smooth non-convex stochastic optimization problems, which are frequently encountered in applications such as machine learning. Using the Clarke $$\epsilon $$ ϵ -subdifferential, we prove the non-asymptotic convergence to an approximate stationary point in expectation for the proposed method. From this result, a method with non-asymptotic convergence with high probability, as well as a method with asymptotic convergence to a Clarke stationary point almost surely are developed. Our results hold under the assumption that the stochastic loss function is a Carathéodory function which is almost everywhere Lipschitz continuous in the decision variables. To the best of our knowledge, this is the first non-asymptotic convergence analysis under these minimal assumptions.

Suggested Citation

  • Michael R. Metel & Akiko Takeda, 2022. "Perturbed Iterate SGD for Lipschitz Continuous Loss Functions," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 504-547, November.
    • Handle: RePEc:spr:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02093-0
    DOI: 10.1007/s10957-022-02093-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02093-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-022-02093-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. V. Burke & A. S. Lewis & M. L. Overton, 2002. "Approximating Subdifferentials by Random Sampling of Gradients," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 567-584, August.
    2. Yurii NESTEROV & Vladimir SPOKOINY, 2017. "Random gradient-free minimization of convex functions," LIDAM Reprints CORE 2851, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ghadimi, Saeed & Powell, Warren B., 2024. "Stochastic search for a parametric cost function approximation: Energy storage with rolling forecasts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 641-652.
    2. W. Hare & J. Nutini, 2013. "A derivative-free approximate gradient sampling algorithm for finite minimax problems," Computational Optimization and Applications, Springer, vol. 56(1), pages 1-38, September.
    3. V. Kungurtsev & F. Rinaldi, 2021. "A zeroth order method for stochastic weakly convex optimization," Computational Optimization and Applications, Springer, vol. 80(3), pages 731-753, December.
    4. Nikita Kornilov & Alexander Gasnikov & Pavel Dvurechensky & Darina Dvinskikh, 2023. "Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact," Computational Management Science, Springer, vol. 20(1), pages 1-43, December.
    5. Wei Bian & Xiaojun Chen, 2017. "Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1063-1084, November.
    6. Dmitriy Drusvyatskiy & Alexander D. Ioffe & Adrian S. Lewis, 2015. "Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 328-349, February.
    7. W. L. Hare & A. S. Lewis, 2005. "Estimating Tangent and Normal Cones Without Calculus," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 785-799, November.
    8. Jean-Jacques Forneron, 2023. "Noisy, Non-Smooth, Non-Convex Estimation of Moment Condition Models," Papers 2301.07196, arXiv.org, revised Feb 2023.
    9. David Kozak & Stephen Becker & Alireza Doostan & Luis Tenorio, 2021. "A stochastic subspace approach to gradient-free optimization in high dimensions," Computational Optimization and Applications, Springer, vol. 79(2), pages 339-368, June.
    10. Giovanni Colombo & Antonio Marigonda & Peter R. Wolenski, 2013. "The Clarke Generalized Gradient for Functions Whose Epigraph Has Positive Reach," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 451-468, August.
    11. Stefan Wager & Kuang Xu, 2021. "Experimenting in Equilibrium," Management Science, INFORMS, vol. 67(11), pages 6694-6715, November.
    12. Marco Boresta & Tommaso Colombo & Alberto Santis & Stefano Lucidi, 2022. "A Mixed Finite Differences Scheme for Gradient Approximation," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 1-24, July.
    13. Jun Xie & Chi Cao, 2017. "Non-Convex Economic Dispatch of a Virtual Power Plant via a Distributed Randomized Gradient-Free Algorithm," Energies, MDPI, vol. 10(7), pages 1-12, July.
    14. Sajjad Kazemi & Nader Kanzi, 2018. "Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 800-819, December.
    15. Milagros Loreto & Hugo Aponte & Debora Cores & Marcos Raydan, 2017. "Nonsmooth spectral gradient methods for unconstrained optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 529-553, December.
    16. Elias S. Helou & Sandra A. Santos & Lucas E. A. Simões, 2018. "A fast gradient and function sampling method for finite-max functions," Computational Optimization and Applications, Springer, vol. 71(3), pages 673-717, December.
    17. Katya Scheinberg, 2022. "Finite Difference Gradient Approximation: To Randomize or Not?," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2384-2388, September.
    18. Jingxu Xu & Zeyu Zheng, 2023. "Gradient-Based Simulation Optimization Algorithms via Multi-Resolution System Approximations," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 633-651, May.
    19. Fabrice Poirion & Quentin Mercier & Jean-Antoine Désidéri, 2017. "Descent algorithm for nonsmooth stochastic multiobjective optimization," Computational Optimization and Applications, Springer, vol. 68(2), pages 317-331, November.
    20. Chad Davis & Warren Hare, 2013. "Exploiting Known Structures to Approximate Normal Cones," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 665-681, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:195:y:2022:i:2:d:10.1007_s10957-022-02093-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.