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

TitleStatusHype
On Weight-Sharing and Bilevel Optimization in Architecture Search0
Learning to Generalize to Unseen Tasks with Bilevel Optimization0
Bilevel Optimization, Deep Learning and Fractional Laplacian Regularization with Applications in Tomography0
On the Global Convergence of Actor-Critic: A Case for Linear Quadratic Regulator with Ergodic Cost0
Task-Oriented Convex Bilevel Optimization with Latent Feasibility0
Learning Surrogate Losses0
Optimal Experiment Design in Nonlinear Parameter Estimation with Exact Confidence Regions0
MetaStyle: Three-Way Trade-Off Among Speed, Flexibility, and Quality in Neural Style Transfer0
Bilevel learning of the Group Lasso structure0
Learning to Defend by Learning to Attack0
Show:102550
← PrevPage 41 of 43Next →

Benchmark Results

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