IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v20y2023i1d10.1007_s10287-023-00470-2.html
   My bibliography  Save this article

Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact

Author

Listed:
  • Nikita Kornilov

    (Moscow Institute of Physics and Technology)

  • Alexander Gasnikov

    (Moscow Institute of Physics and Technology
    Skoltech
    ISP RAS Research Center for Trusted Artificial Intelligence)

  • Pavel Dvurechensky

    (Weierstrass Institute for Applied Analysis and Stochastics)

  • Darina Dvinskikh

    (HSE University)

Abstract

We present two easy-to-implement gradient-free/zeroth-order methods to optimize a stochastic non-smooth function accessible only via a black-box. The methods are built upon efficient first-order methods in the heavy-tailed case, i.e., when the gradient noise has infinite variance but bounded $$(1+\kappa)$$ ( 1 + κ ) -th moment for some $$\kappa \in(0,1]$$ κ ∈ ( 0 , 1 ] . The first algorithm is based on the stochastic mirror descent with a particular class of uniformly convex mirror maps which is robust to heavy-tailed noise. The second algorithm is based on the stochastic mirror descent and gradient clipping technique. Additionally, for the objective functions satisfying the r-growth condition, faster algorithms are proposed based on these methods and the restart technique.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00470-2
    DOI: 10.1007/s10287-023-00470-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00470-2
    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/s10287-023-00470-2?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. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Panos Pardalos & Valery Kalyagin & Mario R. Guarracino, 2024. "Editorial," Computational Management Science, Springer, vol. 21(1), pages 1-5, June.

    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. 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.
    3. Jean-Jacques Forneron, 2023. "Noisy, Non-Smooth, Non-Convex Estimation of Moment Condition Models," Papers 2301.07196, arXiv.org, revised Feb 2023.
    4. 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.
    5. Stefan Wager & Kuang Xu, 2021. "Experimenting in Equilibrium," Management Science, INFORMS, vol. 67(11), pages 6694-6715, November.
    6. 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.
    7. 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.
    8. 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.
    9. Katya Scheinberg, 2022. "Finite Difference Gradient Approximation: To Randomize or Not?," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2384-2388, September.
    10. 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.
    11. Ghaderi, Susan & Ahookhosh, Masoud & Arany, Adam & Skupin, Alexander & Patrinos, Panagiotis & Moreau, Yves, 2024. "Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions," Applied Mathematics and Computation, Elsevier, vol. 464(C).
    12. Geovani Nunes Grapiglia, 2023. "Quadratic regularization methods with finite-difference gradient approximations," Computational Optimization and Applications, Springer, vol. 85(3), pages 683-703, July.
    13. Dvurechensky, Pavel & Gorbunov, Eduard & Gasnikov, Alexander, 2021. "An accelerated directional derivative method for smooth stochastic convex optimization," European Journal of Operational Research, Elsevier, vol. 290(2), pages 601-621.
    14. Jun Xie & Qingyun Yu & Chi Cao, 2018. "A Distributed Randomized Gradient-Free Algorithm for the Non-Convex Economic Dispatch Problem," Energies, MDPI, vol. 11(1), pages 1-15, January.
    15. Yijie Peng & Li Xiao & Bernd Heidergott & L. Jeff Hong & Henry Lam, 2022. "A New Likelihood Ratio Method for Training Artificial Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 638-655, January.

    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:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00470-2. 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.