IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i2p1183-1211.html
   My bibliography  Save this article

Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization

Author

Listed:
  • Jiaxiang Li

    (Department of Mathematics, University of California, Davis, California 95616)

  • Krishnakumar Balasubramanian

    (Department of Statistics, University of California, Davis, California 95616)

  • Shiqian Ma

    (Department of Mathematics, University of California, Davis, California 95616; Department of Computational Applied Mathematics and Operations Research, Rice University, Houston, Texas 77005)

Abstract

We consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in Euclidean space, where the task is to solve Riemannian optimization problems with only noisy objective function evaluations. Toward this, our main contribution is to propose estimators of the Riemannian gradient and Hessian from noisy objective function evaluations, based on a Riemannian version of the Gaussian smoothing technique. The proposed estimators overcome the difficulty of nonlinearity of the manifold constraint and issues that arise in using Euclidean Gaussian smoothing techniques when the function is defined only over the manifold. We use the proposed estimators to solve Riemannian optimization problems in the following settings for the objective function: (i) stochastic and gradient-Lipschitz (in both nonconvex and geodesic convex settings), (ii) sum of gradient-Lipschitz and nonsmooth functions, and (iii) Hessian-Lipschitz. For these settings, we analyze the oracle complexity of our algorithms to obtain appropriately defined notions of ϵ -stationary point or ϵ -approximate local minimizer. Notably, our complexities are independent of the dimension of the ambient Euclidean space and depend only on the intrinsic dimension of the manifold under consideration. We demonstrate the applicability of our algorithms by simulation results and real-world applications on black-box stiffness control for robotics and black-box attacks to neural networks.

Suggested Citation

  • Jiaxiang Li & Krishnakumar Balasubramanian & Shiqian Ma, 2023. "Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 1183-1211, May.
  • Handle: RePEc:inm:ormoor:v:48:y:2023:i:2:p:1183-1211
    DOI: 10.1287/moor.2022.1302
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1302
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2022.1302?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:2:p:1183-1211. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.