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

TitleStatusHype
Communication-Efficient Federated Bilevel Optimization with Local and Global Lower Level Problems0
Achieving Linear Speedup in Non-IID Federated Bilevel Learning0
Communication-Efficient Federated Hypergradient Computation via Aggregated Iterative Differentiation0
Efficient Gradient Approximation Method for Constrained Bilevel Optimization0
A Fully First-Order Method for Stochastic Bilevel Optimization0
Probabilistic Bilevel Coreset Selection0
Valuing Distributed Energy Resources for Non-Wires Alternatives0
Analyzing Inexact Hypergradients for Bilevel Learning0
Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach0
First-order penalty methods for bilevel optimization0
Show:102550
← PrevPage 25 of 43Next →

Benchmark Results

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