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

TitleStatusHype
HBO: Hierarchical Balancing Optimization for Fine-Tuning Large Language ModelsCode0
Fair Machine Learning under Limited Demographically Labeled DataCode0
Efficient and Effective Implicit Dynamic Graph Neural NetworkCode0
An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learningCode0
Towards Evaluating the Robustness of Neural Networks Learned by TransductionCode0
Decentralized Hyper-Gradient Computation over Time-Varying Directed NetworksCode0
Discriminatively Learned Hierarchical Rank Pooling NetworksCode0
Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACOCode0
A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled ConstraintsCode0
Differentiable Neural Architecture Search in Equivalent Space with Exploration EnhancementCode0
Show:102550
← PrevPage 38 of 43Next →

Benchmark Results

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