paper-with-me

홈 › Papers

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

2024-05-15 · Amir Ali Farzin, Iman Shames

The application of a zeroth-order scheme for minimising Polyak-\L{}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.

📄 PDF Abstract BibTeX arXiv:2405.09106

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Minimisation of Submodular Functions Using Gaussian Zeroth-Order Random Oracles

2025-10-17 · Amir Ali Farzin, Yuen-Man Pun, Philipp Braun, Tyler Summers 외 arxiv

We consider the minimisation problem of submodular functions and investigate the application of a zeroth-order method to this problem. The method is based on exploiting a Gaussian smoothing random oracle to estimate the …

Minimisation of Quasar-Convex Functions Using Random Zeroth-Order Oracles

2025-05-04 · Amir Ali Farzin, Yuen-Man Pun, Iman Shames

This study explores the performance of a random Gaussian smoothing zeroth-order (ZO) scheme for minimising quasar-convex (QC) and strongly quasar-convex (SQC) functions in both unconstrained and constrained settings. For…

Stochastic Zeroth order Descent with Structured Directions

2022-06-10 · Marco Rando, Cesare Molinari, Silvia Villa, Lorenzo Rosasco

We introduce and analyze Structured Stochastic Zeroth order Descent (S-SZD), a finite difference approach that approximates a stochastic gradient on a set of $l\leq d$ orthogonal directions, where $d$ is the dimension of…

Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems

2022-11-24 · Zi Xu, Zi-Qi Wang, Jun-Lin Wang, Yu-Hong Dai

In this paper, we consider a class of nonconvex-nonconcave minimax problems, i.e., NC-PL minimax problems, whose objective functions satisfy the Polyak-\L ojasiewicz (PL) condition with respect to the inner variable. We …

Optimization with Zeroth-Order Oracles in Formation

2020-07-30

In this paper, we consider the optimisation of time varying functions by a network of agents with no gradient information. The proposed a novel method to estimate the gradient at each agent's position using only neighbou…

Position