Accelerating first-order methods for bilevel optimization under general smoothness
From MaRDI portal
Cites work
- A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic
- Accelerated methods for nonconvex optimization
- Classification model selection via bilevel programming
- Efficiently escaping saddle points in bilevel optimization
- Lower bounds for finding stationary points I
- Near-optimal nonconvex-strongly-convex bilevel optimization with fully first-order oracles
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- Parameter-free accelerated gradient descent for nonconvex minimization
- Tensor Decompositions and Applications
This page was built for publication: Accelerating first-order methods for bilevel optimization under general smoothness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443536)