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

TitleStatusHype
A Primal-Dual Approach to Bilevel Optimization with Multiple Inner Minima0
AMOSL: Adaptive Modality-wise Structure Learning in Multi-view Graph Neural Networks For Enhanced Unified Representation0
Bilevel learning of the Group Lasso structure0
ES-Based Jacobian Enables Faster Bilevel Optimization0
Effective Bilevel Optimization via Minimax Reformulation0
Bilevel learning of l1-regularizers with closed-form gradients(BLORC)0
Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising0
Task-Oriented Convex Bilevel Optimization with Latent Feasibility0
Adversarial Nonnegative Matrix Factorization0
Enhancing Generalization via Sharpness-Aware Trajectory Matching for Dataset Condensation0
Show:102550
← PrevPage 15 of 43Next →

Benchmark Results

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