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

TitleStatusHype
Few-shot Backdoor Attacks via Neural Tangent KernelsCode0
Functional Bilevel Optimization for Machine LearningCode0
A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled ConstraintsCode0
Exact Certification of (Graph) Neural Networks Against Label PoisoningCode0
Federated Multi-Sequence Stochastic Approximation with Local Hypergradient EstimationCode0
Gradient-based bilevel optimization for multi-penalty Ridge regression through matrix differential calculusCode0
Inexact Derivative-Free Optimization for Bilevel LearningCode0
Efficient and Effective Implicit Dynamic Graph Neural NetworkCode0
Efficient Cross-Modal Video Retrieval with Meta-Optimized FramesCode0
Discriminatively Learned Hierarchical Rank Pooling NetworksCode0
Show:102550
← PrevPage 8 of 43Next →

Benchmark Results

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