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

TitleStatusHype
A hybrid deep-learning-metaheuristic framework for bi-level network design problemsCode0
On Momentum-Based Gradient Methods for Bilevel Optimization with Nonconvex Lower-Level0
Boosting Differentiable Causal Discovery via Adaptive Sample ReweightingCode1
Implicit Bilevel Optimization: Differentiating through Bilevel Optimization Programming0
Nystrom Method for Accurate and Scalable Implicit DifferentiationCode1
A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization0
Communication-Efficient Federated Bilevel Optimization with Local and Global Lower Level Problems0
Achieving Linear Speedup in Non-IID Federated Bilevel Learning0
On Penalty-based Bilevel Gradient Descent MethodCode1
Communication-Efficient Federated Hypergradient Computation via Aggregated Iterative Differentiation0
Show:102550
← PrevPage 21 of 43Next →

Benchmark Results

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