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

TitleStatusHype
Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions0
SLACK: Stable Learning of Augmentations with Cold-start and KL regularization0
From Hypergraph Energy Functions to Hypergraph Neural NetworksCode1
Differentiable Instruction Optimization for Cross-Task GeneralizationCode0
iSLAM: Imperative SLAMCode1
A Generalized Alternating Method for Bilevel Learning under the Polyak-Łojasiewicz Condition0
Federated Multi-Sequence Stochastic Approximation with Local Hypergradient EstimationCode0
Hyperparameter Learning under Data Poisoning: Analysis of the Influence of Regularization via Multiobjective Bilevel Optimization0
SimFBO: Towards Simple, Flexible and Communication-efficient Federated Bilevel Learning0
Blockwise Stochastic Variance-Reduced Methods with Parallel Speedup for Multi-Block Bilevel OptimizationCode0
Show:102550
← PrevPage 19 of 43Next →

Benchmark Results

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