A riemannian block coordinate descent method for computing the projection robust wasserstein distance M Huang, S Ma, L Lai International Conference on Machine Learning, 4446-4455, 2021 | 30 | 2021 |
Robust low-rank matrix completion via an alternating manifold proximal gradient continuation method M Huang, S Ma, L Lai IEEE Transactions on Signal Processing 69, 2639-2652, 2021 | 9 | 2021 |
Decentralized bilevel optimization X Chen, M Huang, S Ma arXiv preprint arXiv:2206.05670, 2022 | 7 | 2022 |
Efficiently escaping saddle points in bilevel optimization M Huang, K Ji, S Ma, L Lai arXiv preprint arXiv:2202.03684, 2022 | 6 | 2022 |
Projection robust Wasserstein barycenters M Huang, S Ma, L Lai International Conference on Machine Learning, 4456-4465, 2021 | 5 | 2021 |
Escaping saddle points for nonsmooth weakly convex functions via perturbed proximal algorithms M Huang arXiv preprint arXiv:2102.02837, 2021 | 5 | 2021 |
On the convergence of projected alternating maximization for equitable and optimal transport M Huang, S Ma, L Lai arXiv preprint arXiv:2109.15030, 2021 | 1 | 2021 |
Decentralized Stochastic Bilevel Optimization with Improved Per-Iteration Complexity X Chen, M Huang, S Ma, K Balasubramanian arXiv preprint arXiv:2210.12839, 2022 | | 2022 |