Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles

Amir Ali Farzin, Iman Shames
5/15/2024
math.OCcs.LG

No confident code implementation found for this paper.

Abstract

The application of a zeroth-order scheme for minimising Polyak-Łojasewicz (PL) functions is considered. The framework is based on exploiting a random oracle to estimate the function gradient. The convergence of the algorithm to a global minimum in the unconstrained case and to a neighbourhood of the global minimum in the constrained case along with their corresponding complexity bounds are presented. The theoretical results are demonstrated via numerical examples.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{farzin2024minimisation,
  title  = {Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles},
  author = {Amir Ali Farzin and Iman Shames},
  year   = {2024},
  eprint = {2405.09106},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.09106v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.09106.svg)](https://codeofpaper.com/paper/2405.09106)

Discussion