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 251260 of 423 papers

TitleStatusHype
Single Time-scale Actor-critic Method to Solve the Linear Quadratic Regulator with Convergence Guarantees0
Single-Timescale Multi-Sequence Stochastic Approximation Without Fixed Point Smoothness: Theories and Applications0
SLACK: Stable Learning of Augmentations with Cold-start and KL regularization0
Solving Bilevel Knapsack Problem using Graph Neural Networks0
Solving Bilevel Optimal Bidding Problems Using Deep Convolutional Neural Networks0
SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity0
SPARKLE: A Unified Single-Loop Primal-Dual Framework for Decentralized Bilevel Optimization0
Spectral-Risk Safe Reinforcement Learning with Convergence Guarantees0
SSP-GNN: Learning to Track via Bilevel Optimization0
On Stability in Optimistic Bilevel Optimization0
Show:102550
← PrevPage 26 of 43Next →

Benchmark Results

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