← Search

Minhui Huang

7 accepted papers

2025

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization

NeurIPS 2025poster

We study bilevel optimization problems where the lower-level problems are strongly convex and have coupled linear constraints. To overcome the potential non-smoothness of the hyper-objective and the computational challenges associated with the Hessian matrix, we utilize penalty and augmented Lagrang…

Cited by 0SourcecodeScholar
2025

Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis

ICLR 2025poster

Bilevel optimization has recently attracted considerable attention due to its abundant applications in machine learning problems. However, existing methods rely on prior knowledge of problem parameters to determine stepsizes, resulting in significant effort in tuning stepsizes when these parameters…

2024

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization

AISTATS 2024poster

In recent years, federated minimax optimization has attracted growing interest due to its extensive applications in various machine learning tasks. While Smoothed Alternative Gradient Descent Ascent (Smoothed-AGDA) has proved successful in centralized nonconvex minimax optimization, how and whether…

Cited by 2SourcePDFScholar
2023

Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity

ICML 2023poster

Bilevel optimization recently has received tremendous attention due to its great success in solving important machine learning problems like meta learning, reinforcement learning, and hyperparameter optimization. Extending single-agent training on bilevel problems to the decentralized setting is a n…

Cited by 35SourcePDFScholar
2021

A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance

ICML 2021spotlight

The Wasserstein distance has become increasingly important in machine learning and deep learning. Despite its popularity, the Wasserstein distance is hard to approximate because of the curse of dimensionality. A recently proposed approach to alleviate the curse of dimensionality is to project the sa…

Cited by 52SourcePDFScholar