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

TitleStatusHype
PETA: Parameter-Efficient Trojan Attacks0
Towards Poisoning Fair Representations0
Bregman Graph Neural NetworkCode0
On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation0
Federated Neuro-Symbolic Learning0
RemovalNet: DNN Fingerprint Removal AttacksCode1
HypBO: Accelerating Black-Box Scientific Experiments Using Experts' HypothesesCode1
An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learningCode0
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem0
Iterative Reweighted Least Squares Networks With Convergence Guarantees for Solving Inverse Imaging Problems0
Show:102550
← PrevPage 17 of 43Next →

Benchmark Results

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