default search action
Guanghui Wang 0006
Person information
- affiliation: Nanjing University, National Key Laboratory for Novel Software Technology, Nanjing, China
Other persons with the same name
- Guanghui Wang — disambiguation page
- Guanghui Wang 0001
— Toronto Metropolitan University, Canada (and 1 more)
- Guanghui Wang 0002
- Guanghui Wang 0003
- Guanghui Wang 0004
- Guanghui Wang 0005
- Guanghui Wang 0007 — Ministry of Natural Resources of P. R. China, Land Satellite Remote Sensing Application Center, Beijing, China
- Guanghui Wang 0008 — China Agricultural University, Beijing, China
- Guanghui Wang 0009 — Nanchang University, Nanchang, China
- Guanghui Wang 0010 — HeBei United University, Tangshan, China
- Guanghui Wang 0011 — Nankai University, Institute of Statistics and LPMC, Tianjin, China
- Guanghui Wang 0012 — Zhejiang Ocean University, Zhoushan, China
- Guanghui Wang 0013 — Nanjing University, nstitute of Optical Communication Engineering, Jiangsu, China
- Guanghui Wang 0014 — China North Vehicle Research Institute, Beijing, China
- Guanghui Wang 0015 — National Institutes of Health, Bethesda, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j2]Yuanyu Wan, Guanghui Wang, Wei-Wei Tu, Lijun Zhang:
Projection-free Distributed Online Learning with Sublinear Communication Complexity. J. Mach. Learn. Res. 23: 172:1-172:53 (2022) - [c13]Guanghui Wang, Ming Yang, Lijun Zhang, Tianbao Yang:
Momentum Accelerates the Convergence of Stochastic AUPRC Maximization. AISTATS 2022: 3753-3771 - [c12]Lijun Zhang, Guanghui Wang, Jinfeng Yi, Tianbao Yang:
A Simple yet Universal Strategy for Online Convex Optimization. ICML 2022: 26605-26623 - 2021
- [j1]Peng Zhao, Guanghui Wang, Lijun Zhang, Zhi-Hua Zhou:
Bandit Convex Optimization in Non-stationary Environments. J. Mach. Learn. Res. 22: 125:1-125:45 (2021) - [c11]Shiyin Lu, Guanghui Wang, Lijun Zhang:
Stochastic Graphical Bandits with Adversarial Corruptions. AAAI 2021: 8749-8757 - [c10]Lijun Zhang, Guanghui Wang, Wei-Wei Tu, Wei Jiang, Zhi-Hua Zhou:
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions. NeurIPS 2021: 24968-24980 - [c9]Guanghui Wang, Yuanyu Wan, Tianbao Yang, Lijun Zhang:
Online Convex Optimization with Continuous Switching Constraint. NeurIPS 2021: 28636-28647 - [i10]Yuanyu Wan, Guanghui Wang, Lijun Zhang:
Projection-free Distributed Online Learning with Strongly Convex Losses. CoRR abs/2103.11102 (2021) - [i9]Guanghui Wang, Yuanyu Wan, Tianbao Yang, Lijun Zhang:
Online Convex Optimization with Continuous Switching Constraint. CoRR abs/2103.11370 (2021) - [i8]Lijun Zhang, Guanghui Wang, Jinfeng Yi, Tianbao Yang:
A Simple yet Universal Strategy for Online Convex Optimization. CoRR abs/2105.03681 (2021) - [i7]Guanghui Wang, Ming Yang, Lijun Zhang, Tianbao Yang:
Momentum Accelerates the Convergence of Stochastic AUPRC Maximization. CoRR abs/2107.01173 (2021) - 2020
- [c8]Guanghui Wang, Shiyin Lu, Yao Hu, Lijun Zhang:
Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization. AAAI 2020: 6162-6169 - [c7]Peng Zhao, Guanghui Wang, Lijun Zhang, Zhi-Hua Zhou:
Bandit Convex Optimization in Non-stationary Environments. AISTATS 2020: 1508-1518 - [c6]Guanghui Wang, Shiyin Lu, Quan Cheng, Weiwei Tu, Lijun Zhang:
SAdam: A Variant of Adam for Strongly Convex Functions. ICLR 2020 - [c5]Bo Xue, Guanghui Wang, Yimu Wang, Lijun Zhang:
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs. IJCAI 2020: 2936-2942 - [i6]Bo Xue, Guanghui Wang, Yimu Wang, Lijun Zhang:
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs. CoRR abs/2004.13465 (2020)
2010 – 2019
- 2019
- [c4]Shiyin Lu, Guanghui Wang, Yao Hu, Lijun Zhang:
Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards. ICML 2019: 4154-4163 - [c3]Shiyin Lu, Guanghui Wang, Yao Hu, Lijun Zhang:
Multi-Objective Generalized Linear Bandits. IJCAI 2019: 3080-3086 - [c2]Guanghui Wang, Shiyin Lu, Lijun Zhang:
Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization. UAI 2019: 659-668 - [i5]Guanghui Wang, Shiyin Lu, Weiwei Tu, Lijun Zhang:
SAdam: A Variant of Adam for Strongly Convex Functions. CoRR abs/1905.02957 (2019) - [i4]Guanghui Wang, Shiyin Lu, Lijun Zhang:
Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization. CoRR abs/1905.05917 (2019) - [i3]Shiyin Lu, Guanghui Wang, Yao Hu, Lijun Zhang:
Multi-Objective Generalized Linear Bandits. CoRR abs/1905.12879 (2019) - [i2]Lijun Zhang, Guanghui Wang, Weiwei Tu, Zhi-Hua Zhou:
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions. CoRR abs/1906.10851 (2019) - [i1]Peng Zhao, Guanghui Wang, Lijun Zhang, Zhi-Hua Zhou:
Bandit Convex Optimization in Non-stationary Environments. CoRR abs/1907.12340 (2019) - 2018
- [c1]Guanghui Wang, Dakuan Zhao, Lijun Zhang:
Minimizing Adaptive Regret with One Gradient per Iteration. IJCAI 2018: 2762-2768
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 2024-12-23 19:34 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: