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 11–20 of 423 papers

TitleStatusHype
GCAL: Adapting Graph Models to Evolving Domain ShiftsCode0
Sequential QCQP for Bilevel Optimization with Line Search—0
HBO: Hierarchical Balancing Optimization for Fine-Tuning Large Language ModelsCode0
Bi-Level Policy Optimization with Nyström Hypergradients—0
A stochastic gradient method for trilevel optimization—0
Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization—0
A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization—0
PR-Attack: Coordinated Prompt-RAG Attacks on Retrieval-Augmented Generation in Large Language Models via Bilevel Optimization—0
Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance—0
On The Sample Complexity Bounds In Bilevel Reinforcement Learning—0
Show:102550
← PrevPage 2 of 43Next →

Benchmark Results

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