SOTAVerified

Bilevel Optimization

Bilevel Optimization is a branch of optimization, which contains a nested optimization problem within the constraints of the outer optimization problem. The outer optimization task is usually referred as the upper level task, and the nested inner optimization task is referred as the lower level task. The lower level problem appears as a constraint, such that only an optimal solution to the lower level optimization problem is a possible feasible candidate to the upper level optimization problem.

Source: Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization

Papers

Showing 221230 of 423 papers

TitleStatusHype
Probabilistic Bilevel Coreset Selection0
Programmatic Reinforcement Learning without Oracles0
Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometry0
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem0
Provably Faster Algorithms for Bilevel Optimization and Applications to Meta-Learning0
Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling0
Provably Global Convergence of Actor-Critic: A Case for Linear Quadratic Regulator with Ergodic Cost0
qNBO: quasi-Newton Meets Bilevel Optimization0
Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization0
RARTS: An Efficient First-Order Relaxed Architecture Search Method0
Show:102550
← PrevPage 23 of 43Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1GIN-GAOptimality Gap0.21Unverified
#ModelMetricClaimedVerifiedStatus
1GIN-GAOptimality Gap0.48Unverified
#ModelMetricClaimedVerifiedStatus
1GIN-GAOptimality Gap1.44Unverified