1 citations · 1 across the 3 of their papers we have counts for
6 papers
Sharp First-Order Lower Bounds under -Polyak-Lojasiewicz Conditions
Saeed Masiha, Negar Kiyavash, Patrick Thiran
We study first-order oracle complexity under the -Polyak-Lojasiewicz condition for . For , we first show that global -sm…
Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets
Saeed Masiha, Zebang Shen, Negar Kiyavash +1
We study optimistic bilevel optimization when the lower-level problem has a non-isolated manifold of minimizers. In this setting, the hyper-objective may be non-differentiable beca…
Projection-Free Functional Constrained Optimization for Risk Aversion and Sparsity Control
Yi Cheng, Guanghui Lan, Saeed Masiha +1
We study projection-free methods for functional constrained optimization with convex or smooth nonconvex objectives. Such problems arise in applications such as portfolio optimizat…
Superquantile-Gibbs Relaxation for Minima-selection in Bilevel Optimization
Saeed Masiha, Zebang Shen, Negar Kiyavash +1
Bilevel optimization (BLO) becomes more challenging when the lower-level objective admits multiple minimizers. Compared with the commonly studied unique-minimizer setting, this int…
Zeroth-Order Stackelberg Control in Combinatorial Congestion Games
Saeed Masiha, Sepehr Elahi, Negar Kiyavash +1
We study Stackelberg (leader--follower) tuning of network parameters (tolls, capacities, incentives) in combinatorial congestion games, where selfish users choose discrete routes (…
Optimal Local Convergence Rates of Stochastic First-Order Methods under Local -PL
Saeed Masiha, Saber Salehkaleybar, Niao He +2
We study the local convergence rate of stochastic first-order methods under a local -Polyak-Lojasiewicz (-PL) condition in a neighborhood of a target connected component $\…