activity
20242026
most citedGradient-based algorithms for multi-objective bi-level optimization

4 citations · 4 across the 11 of their papers we have counts for

collaborators
Showing 2024 · math.OCShow all

5 papers · 2 filters

math.OC2024

Decomposition Method for Lipschitz Stability of General LASSO-type Problems

Chunhai Hu, Wei Yao, Jin Zhang

This paper introduces a decomposition-based method to investigate the Lipschitz stability of solution mappings for general LASSO-type problems with convex data fidelity and $\ell_1…

math.OC2024★ 4 cited

Gradient-based algorithms for multi-objective bi-level optimization

Xinmin Yang, Wei Yao, Haian Yin +2

Multi-Objective Bi-Level Optimization (MOBLO) addresses nested multi-objective optimization problems common in a range of applications. However, its multi-objective and hierarchica…

math.OC2024

Overcoming Lower-Level Constraints in Bilevel Optimization: A Novel Approach with Regularized Gap Functions

Wei Yao, Haian Yin, Shangzhi Zeng +1

Constrained bilevel optimization tackles nested structures present in constrained learning tasks like constrained meta-learning, adversarial learning, and distributed bilevel optim…

math.OC2024

Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-loop and Hessian-free Solution Strategy

Risheng Liu, Zhu Liu, Wei Yao +2

This work focuses on addressing two major challenges in the context of large-scale nonconvex Bi-Level Optimization (BLO) problems, which are increasingly applied in machine learnin…

math.OC2024

SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity

Tianshu Chu, Dachuan Xu, Wei Yao +1

While stochastic bilevel optimization methods have been extensively studied for addressing large-scale nested optimization problems in machine learning, it remains an open question…