default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinhui Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Wei Shen, Minhui Huang, Jiawei Zhang, Cong Shen:
Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization. AISTATS 2024: 3988-3996- [i11]Yifan Yang, Hao Ban, Minhui Huang, Shiqian Ma, Kaiyi Ji:
Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis. CoRR abs/2410.05140 (2024) - [i10]Yun He, Xuxing Chen, Jiayi Xu, Renqin Cai, Yiling You, Jennifer Cao, Minhui Huang, Liu Yang, Yiqun Liu, Xiaoyi Liu, Rong Jin, Sem Park, Bo Long, Xue Feng:
MultiBalance: Multi-Objective Gradient Balancing in Industrial-Scale Multi-Task Recommendation System. CoRR abs/2411.11871 (2024) - 2023
- [c5]Xuxing Chen, Minhui Huang, Shiqian Ma, Krishna Balasubramanian:
Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity. ICML 2023: 4641-4671 - [c4]Minhui Huang, Dewei Zhang, Kaiyi Ji:
Achieving Linear Speedup in Non-IID Federated Bilevel Learning. ICML 2023: 14039-14059 - [i9]Minhui Huang, Dewei Zhang, Kaiyi Ji:
Achieving Linear Speedup in Non-IID Federated Bilevel Learning. CoRR abs/2302.05412 (2023) - [i8]Wei Shen, Minhui Huang, Jiawei Zhang, Cong Shen:
Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization. CoRR abs/2311.00944 (2023) - 2022
- [i7]Minhui Huang, Kaiyi Ji, Shiqian Ma, Lifeng Lai:
Efficiently Escaping Saddle Points in Bilevel Optimization. CoRR abs/2202.03684 (2022) - [i6]Xuxing Chen, Minhui Huang, Shiqian Ma, Krishnakumar Balasubramanian:
Decentralized Stochastic Bilevel Optimization with Improved Per-Iteration Complexity. CoRR abs/2210.12839 (2022) - 2021
- [j1]Minhui Huang
, Shiqian Ma, Lifeng Lai:
Robust Low-Rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method. IEEE Trans. Signal Process. 69: 2639-2652 (2021) - [c3]Minhui Huang, Shiqian Ma, Lifeng Lai:
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance. ICML 2021: 4446-4455 - [c2]Minhui Huang, Shiqian Ma, Lifeng Lai:
Projection Robust Wasserstein Barycenters. ICML 2021: 4456-4465 - [i5]Minhui Huang:
Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms. CoRR abs/2102.02837 (2021) - [i4]Minhui Huang, Shiqian Ma, Lifeng Lai:
Projection Robust Wasserstein Barycenters. CoRR abs/2102.03390 (2021) - [i3]Minhui Huang, Shiqian Ma, Lifeng Lai:
On the Convergence of Projected Alternating Maximization for Equitable and Optimal Transport. CoRR abs/2109.15030 (2021) - 2020
- [c1]Minhui Huang, Bo Wei, Zhaowei Liu:
Spatial Co-Location Pattern Mining Based on Hesitant Fuzzy Location. ICITEE 2020: 472-476 - [i2]Minhui Huang, Shiqian Ma, Lifeng Lai:
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method. CoRR abs/2008.07740 (2020) - [i1]Minhui Huang, Shiqian Ma, Lifeng Lai:
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance. CoRR abs/2012.05199 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
