IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v205y2025i2d10.1007_s10957-025-02647-y.html
   My bibliography  Save this article

Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing

Author

Listed:
  • Alireza Aghasi

    (Oregon State University)

  • Saeed Ghadimi

    (University of Waterloo)

Abstract

In this paper, we study and analyze zeroth-order stochastic approximation algorithms for solving bilevel problems when neither the upper/lower objective values nor their unbiased gradient estimates are available. In particular, exploiting Stein’s identity, we first use Gaussian smoothing to estimate first- and second-order partial derivatives of functions with two independent block of variables. We then use these estimates in the framework of a stochastic approximation algorithm for solving bilevel optimization problems and establish its non-asymptotic convergence analysis. To the best of our knowledge, this is the first time that sample complexity bounds are established for a fully stochastic zeroth-order bilevel optimization algorithm.

Suggested Citation

  • Alireza Aghasi & Saeed Ghadimi, 2025. "Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing," Journal of Optimization Theory and Applications, Springer, vol. 205(2), pages 1-39, May.
  • Handle: RePEc:spr:joptap:v:205:y:2025:i:2:d:10.1007_s10957-025-02647-y
    DOI: 10.1007/s10957-025-02647-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02647-y
    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-025-02647-y?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.

    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:205:y:2025:i:2:d:10.1007_s10957-025-02647-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.