{"total":16,"rows":[{"id":"2301.10945","title":"A Fully First-Order Method for Stochastic Bilevel Optimization","created":"2023-01-26","cited_by_count":100,"area":null},{"id":"2305.00316","title":"The Ideal Continual Learner: An Agent That Never Forgets","created":"2023-04-29","cited_by_count":35,"area":null},{"id":"2306.12067","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","created":"2023-06-21","cited_by_count":31,"area":null},{"id":"2308.07536","title":"Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem","created":"2023-08-15","cited_by_count":13,"area":null},{"id":"2406.12771","title":"First-Order Methods for Linearly Constrained Bilevel Optimization","created":"2024-06-18","cited_by_count":10,"area":null},{"id":"2401.09257","title":"A First-Order Multi-Gradient Algorithm for Multi-Objective Bi-Level Optimization","created":"2024-01-17","cited_by_count":8,"area":null},{"id":"2402.08097","title":"An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2409.19800","title":"Differentially Private Bilevel Optimization","created":"2024-09-29","cited_by_count":2,"area":null},{"id":"2507.23155","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","created":"2025-07-30","cited_by_count":2,"area":null},{"id":"2409.06530","title":"Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems","created":"2024-09-10","cited_by_count":1,"area":null},{"id":"2603.06369","title":"Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization","created":"2026-03-06","cited_by_count":1,"area":null},{"id":"2605.09094","title":"A Tale of Two Problems: Multi-Task Bilevel Learning Meets Equality Constrained Multi-Objective Optimization","created":"2026-05-09","cited_by_count":1,"area":null},{"id":"2606.21153","title":"DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity","created":"2026-06-19","cited_by_count":1,"area":null},{"id":"2405.00914","title":"Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization","created":"2024-05-01","cited_by_count":0,"area":null},{"id":"2609.06580","title":"Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumption","created":"2026-09-06","cited_by_count":0,"area":null},{"id":"2609.30501","title":"To Solve Bilevel Optimization with Nonconvex Lower Levels, We Need Second-Order Stationarity","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}