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

TitleStatusHype
On the Convergence of Momentum-Based Algorithms for Federated Bilevel Optimization Problems0
Federated Multi-Sequence Stochastic Approximation with Local Hypergradient EstimationCode0
Sign-MAML: Efficient Model-Agnostic Meta-Learning by SignSGDCode0
Optimizing Decomposition for Optimal Claim VerificationCode0
Few-shot Backdoor Attacks via Neural Tangent KernelsCode0
Loss Distillation via Gradient Matching for Point Cloud Completion with Weighted Chamfer DistanceCode0
Bilevel Generative Learning for Low-Light VisionCode0
Exact Certification of (Graph) Neural Networks Against Label PoisoningCode0
MAP: Towards Balanced Generalization of IID and OOD through Model-Agnostic AdaptersCode0
BILBO: BILevel Bayesian OptimizationCode0
Show:102550
← PrevPage 35 of 43Next →

Benchmark Results

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