7 citations · 10 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.OC2023
Optimality conditions for bilevel programs via Moreau envelope reformulation
Kuang Bai, Jane Ye, Shangzhi Zeng
For bilevel programs with a convex lower level program, the classical approach replaces the lower level program with its Karush-Kuhn-Tucker condition and solve the resulting mathem…
math.OC2023
Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
Lucy L. Gao, Jane J. Ye, Haian Yin +2
Bilevel programming has emerged as a valuable tool for hyperparameter selection, a central concern in machine learning. In a recent study by Ye et al. (2023), a value function-base…