## Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization

We present in this paper novel accelerated fully first-order methods in Bilevel Optimization (BiO). Firstly, for BiO under the assumption that the lower-level functions admit the typical strong convexity assumption, the \emph{(Perturbed) Restarted Accelerated Fully First-order methods for Bilevel Approximation} (\texttt{(P)RAF${}^2$BA}) algorithm leveraging \emph{fully} first-order oracles is proposed, whereas the algorithm for finding approximate first-order … Read more