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
Differentiable Neural Architecture Search in Equivalent Space with Exploration EnhancementCode0
Multi-Agent Reinforcement Learning for Markov Routing Games: A New Modeling Paradigm For Dynamic Traffic Assignment0
Convergence Properties of Stochastic Hypergradients0
Bilevel Continual Learning0
Modeling and Optimization Trade-off in Meta-learningCode0
Learning to Generate Image Source-Agnostic Universal Adversarial Perturbations0
Provably Faster Algorithms for Bilevel Optimization and Applications to Meta-Learning0
Towards Interpretable-AI Policies Induction using Evolutionary Nonlinear Decision Trees for Discrete Action Systems0
Optimistic variants of single-objective bilevel optimization for evolutionary algorithmsCode0
RARTS: An Efficient First-Order Relaxed Architecture Search Method0
Show:102550
← PrevPage 38 of 43Next →

Benchmark Results

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