No article text was recorded for this version.
optimal sample complexity
Version 1 of 146 papers56 conceptsfrozen 2026-10-04
Papers in this version
- Blog: SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity
- Blog: A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum
- Blog: A Single-Timescale Method for Stochastic Bilevel Optimization
- Blog: Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem
- Blog: On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
- Blog: Optimal Algorithms for Stochastic Multi-Level Compositional Optimization
- Blog: A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
- Blog: Faster Gradient Methods for Highly-smooth Stochastic Bilevel Optimization
- Blog: An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
- Blog: Blockwise Stochastic Variance-Reduced Methods with Parallel Speedup for Multi-Block Bilevel Optimization
- Blog: A Single-timescale Analysis for Stochastic Approximation with Multiple Coupled Sequences
- Blog: Amortized Implicit Differentiation for Stochastic Bilevel Optimization
- Blog: A Fully First-Order Method for Stochastic Bilevel Optimization
- Blog: TSP: A Two-Sided Smoothed Primal-Dual Method for Nonconvex Bilevel Optimization
- Blog: Reducing Contextual Stochastic Bilevel Optimization via Structured Function Approximation
- Blog: First-Order Methods for Linearly Constrained Bilevel Optimization
- Blog: A Projection-free Algorithm for Constrained Stochastic Multi-level Composition Optimization
- Blog: Inexact SARAH algorithm for stochastic optimization
- Blog: Faster Stochastic Variance Reduction Methods for Compositional MiniMax Optimization
- Blog: Alternating Projected SGD for Equality-constrained Bilevel Optimization
- Blog: Closing the Gap: Tighter Analysis of Alternating Stochastic Gradient Methods for Bilevel Problems
- Blog: Provably Faster Algorithms for Bilevel Optimization
- Blog: Min-Max Multi-objective Bilevel Optimization with Applications in Robust Machine Learning
- Blog: Hessian Free Efficient Single Loop Iterative Differentiation Methods for Bi-Level Optimization Problems
- Blog: Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions
- Blog: Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
- Blog: Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem
- Blog: Contextual Stochastic Bilevel Optimization
- Blog: Optimal Algorithms for Stochastic Multi-Level Compositional Optimization
- Blog: On the Sample Complexity Bounds of Bilevel Reinforcement Learning
- Blog: A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization
- Blog: A Stochastic Composite Gradient Method with Incremental Variance Reduction
- Blog: Randomized Stochastic Variance-Reduced Methods for Stochastic Bilevel Optimization
- Blog: Bilevel Optimization: Convergence Analysis and Enhanced Design
- Blog: Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization
- Blog: Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization
- Blog: On the Bias-Variance-Cost Tradeoff of Stochastic Optimization
- Blog: A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
- Blog: Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
- Blog: A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem
- Blog: On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis
- Blog: An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
- Blog: A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
- Blog: A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
- Blog: Learning Theory for Kernel Bilevel Optimization
- Blog: Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-Start
History & citation
Current · Permanent link
- This direction split from Closing the Complexity Gap for Bilevel Optimization (74% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_optimal_sample_complexity_96bd8101,
title = {optimal sample complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/optimal-sample-complexity/rdr_96bd81019d50403c9b31fa82c0c3fc57},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_optimal_sample_complexity_96bd8101_v1,
title = {optimal sample complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/optimal-sample-complexity/rdr_96bd81019d50403c9b31fa82c0c3fc57/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}