No article text was recorded for this version.
lower-level singleton assumption
Version 1 of 129 papers36 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singleton
- Blog: Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyond
- Blog: Evolutionary multitasking in bi-level optimization
- Blog: An Augmented Lagrangian Approach to Bi-Level Optimization via a Smooth Equilibrium Constrained Problem
- Blog: Are we there yet? Manifold identification of gradient-related proximal methods
- Blog: A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization
- Blog: Stability of Data-Dependent Ridge-Regularization for Inverse Problems
- Blog: Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem
- Blog: Sensitivity Analysis for Mirror-Stratifiable Convex Functions
- Blog: A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization
- Blog: Linear programming analysis of loopy belief propagation for weighted matching
- Blog: Convex and Bilevel Optimization for Neural-Symbolic Inference and Learning
- Blog: Uniqueness of the SVM Solution
- Blog: Implicit differentiation for fast hyperparameter selection in non-smooth convex learning
- Blog: An optimisation-based domain-decomposition reduced order model for the incompressible Navier-Stokes equations
- Blog: SLM: A Smoothed First-Order Lagrangian Method for Structured Constrained Nonconvex Optimization
- Blog: ALSO-X#: Better Convex Approximations for Distributionally Robust Chance Constrained Programs
- Blog: On Implicit Bias in Overparameterized Bilevel Optimization
- Blog: A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Blog: A Gradient Method for Multilevel Optimization
- Blog: Bilevel optimization based on iterative approximation of multiple mappings
- Blog: Efficient Gradient Approximation Method for Constrained Bilevel Optimization
- Blog: An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
- Blog: A First-Order Multi-Gradient Algorithm for Multi-Objective Bi-Level Optimization
- Blog: On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds
- Blog: Penalty Method for Inversion-Free Deep Bilevel Optimization
- Blog: Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy
- Blog: A pessimistic bilevel stochastic problem for elastic shape optimization
- Blog: Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
History & citation
Current · Permanent link
- This direction split from Bi-Level Optimization with Non-Unique Lower-Level Solutions (83% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_lower_level_singleton_assumption_2b1a72ed,
title = {lower-level singleton assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lower-level-singleton-assumption/rdr_2b1a72edb7e24aecbf6847b3e4eaa05e},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_lower_level_singleton_assumption_2b1a72ed_v1,
title = {lower-level singleton assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lower-level-singleton-assumption/rdr_2b1a72edb7e24aecbf6847b3e4eaa05e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}