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

TitleStatusHype
A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded SmoothnessCode0
Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence AnalysisCode0
Analyzing the Role of the DSO in Electricity Trading of VPPs via a Stackelberg Game ModelCode0
A Framework for Bilevel Optimization on Riemannian ManifoldsCode0
An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learningCode0
Discriminatively Learned Hierarchical Rank Pooling NetworksCode0
Efficient and Effective Implicit Dynamic Graph Neural NetworkCode0
Differentiable Instruction Optimization for Cross-Task GeneralizationCode0
Adapting Triplet Importance of Implicit Feedback for Personalized RecommendationCode0
Differentiable Neural Architecture Search in Equivalent Space with Exploration EnhancementCode0
Show:102550
← PrevPage 9 of 43Next →

Benchmark Results

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