default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuanyu Wan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Xu Yang, Peng Tian, Xiao Cheng, Yuanyu Wan, Mingli Song:
Regularized online exponentially concave optimization. Neurocomputing 595: 127789 (2024)- [c19]Yibo Wang, Wenhao Yang, Wei Jiang, Shiyin Lu, Bing Wang
, Haihong Tang, Yuanyu Wan, Lijun Zhang:
Non-stationary Projection-Free Online Learning with Dynamic and Adaptive Regret Guarantees. AAAI 2024: 15671-15679 - [c18]Yuanyu Wan, Tong Wei, Mingli Song, Lijun Zhang:
Nearly Optimal Regret for Decentralized Online Convex Optimization. COLT 2024: 4862-4888 - [c17]Tong Wei, Zhen Mao, Zi-Hao Zhou, Yuanyu Wan, Min-Ling Zhang:
Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition. ICML 2024 - [c16]Wei Jiang, Sifan Yang, Wenhao Yang, Yibo Wang, Yuanyu Wan, Lijun Zhang:
Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization. ICML 2024 - [c15]Yuanyu Wan, Chang Yao, Mingli Song, Lijun Zhang:
Non-stationary Online Convex Optimization with Arbitrary Delays. ICML 2024 - [c14]Chenxu Zhang, Yibo Wang, Peng Tian, Xiao Cheng, Yuanyu Wan, Mingli Song:
Projection-Free Bandit Convex Optimization over Strongly Convex Sets. PAKDD (3) 2024: 118-129 - [i16]Yuanyu Wan, Chang Yao, Mingli Song, Lijun Zhang:
Improved Regret for Bandit Convex Optimization with Delayed Feedback. CoRR abs/2402.09152 (2024) - [i15]Yuanyu Wan, Tong Wei, Mingli Song, Lijun Zhang:
Nearly Optimal Regret for Decentralized Online Convex Optimization. CoRR abs/2402.09173 (2024) - [i14]Wei Jiang, Sifan Yang, Wenhao Yang, Yibo Wang, Yuanyu Wan, Lijun Zhang:
Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization. CoRR abs/2406.03787 (2024) - 2023
- [c13]Yibo Wang, Yuanyu Wan, Shimao Zhang, Lijun Zhang:
Distributed Projection-Free Online Learning for Smooth and Convex Losses. AAAI 2023: 10226-10234 - [c12]Yuanyu Wan, Lijun Zhang, Mingli Song:
Improved Dynamic Regret for Online Frank-Wolfe. COLT 2023: 3304-3327 - [c11]Yuwen Wang, Shunyu Liu, Kaixuan Chen, Tongtian Zhu, Ji Qiao, Mengjie Shi, Yuanyu Wan, Mingli Song:
Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Tickets. ECAI 2023: 2583-2590 - [c10]Tianli Zhang, Tongya Zheng, Yuanyu Wan, Ying Li, Wenqi Huang:
Disentangling Node Metric Factors for Temporal Link Prediction. ICONIP (2) 2023: 346-357 - [c9]Bo Xue, Yimu Wang, Yuanyu Wan, Jinfeng Yi, Lijun Zhang:
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards. NeurIPS 2023 - [i13]Yuanyu Wan, Lijun Zhang, Mingli Song:
Improved Dynamic Regret for Online Frank-Wolfe. CoRR abs/2302.05620 (2023) - [i12]Yibo Wang, Wenhao Yang, Wei Jiang, Shiyin Lu, Bing Wang, Haihong Tang, Yuanyu Wan, Lijun Zhang:
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees. CoRR abs/2305.11726 (2023) - [i11]Yuanyu Wan, Chang Yao, Mingli Song, Lijun Zhang:
Non-stationary Online Convex Optimization with Arbitrary Delays. CoRR abs/2305.12131 (2023) - [i10]Yucheng Liao, Yuanyu Wan, Chang Yao, Mingli Song:
Improved Projection-free Online Continuous Submodular Maximization. CoRR abs/2305.18442 (2023) - [i9]Yuwen Wang, Shunyu Liu, Kaixuan Chen, Tongtian Zhu, Ji Qiao, Mengjie Shi, Yuanyu Wan, Mingli Song:
Adversarial Erasing with Pruned Elements: Towards Better Graph Lottery Ticket. CoRR abs/2308.02916 (2023) - [i8]Bo Xue, Yimu Wang, Yuanyu Wan, Jinfeng Yi, Lijun Zhang:
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards. CoRR abs/2310.18701 (2023) - 2022
- [j5]Yuanyu Wan, Wei-Wei Tu, Lijun Zhang:
Strongly adaptive online learning over partial intervals. Sci. China Inf. Sci. 65(10) (2022) - [j4]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) - [j3]Yuanyu Wan, Wei-Wei Tu, Lijun Zhang:
Online strongly convex optimization with unknown delays. Mach. Learn. 111(3): 871-893 (2022) - [j2]Yuanyu Wan, Lijun Zhang:
Efficient Adaptive Online Learning via Frequent Directions. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 6910-6923 (2022) - [c8]Yuanyu Wan, Wei-Wei Tu, Lijun Zhang:
Online Frank-Wolfe with Arbitrary Delays. NeurIPS 2022 - [i7]Yuanyu Wan, Wei-Wei Tu, Lijun Zhang:
Online Frank-Wolfe with Unknown Delays. CoRR abs/2204.04964 (2022) - 2021
- [c7]Yuanyu Wan, Lijun Zhang:
Approximate Multiplication of Sparse Matrices with Limited Space. AAAI 2021: 10058-10066 - [c6]Yuanyu Wan, Bo Xue, Lijun Zhang:
Projection-free Online Learning in Dynamic Environments. AAAI 2021: 10067-10075 - [c5]Yuanyu Wan, Lijun Zhang:
Projection-free Online Learning over Strongly Convex Sets. AAAI 2021: 10076-10084 - [c4]Guanghui Wang, Yuanyu Wan, Tianbao Yang, Lijun Zhang:
Online Convex Optimization with Continuous Switching Constraint. NeurIPS 2021: 28636-28647 - [i6]Yuanyu Wan, Guanghui Wang, Lijun Zhang:
Projection-free Distributed Online Learning with Strongly Convex Losses. CoRR abs/2103.11102 (2021) - [i5]Yuanyu Wan, Wei-Wei Tu, Lijun Zhang:
Online Strongly Convex Optimization with Unknown Delays. CoRR abs/2103.11354 (2021) - [i4]Guanghui Wang, Yuanyu Wan, Tianbao Yang, Lijun Zhang:
Online Convex Optimization with Continuous Switching Constraint. CoRR abs/2103.11370 (2021) - 2020
- [j1]Yuanyu Wan, Lijun Zhang:
Accelerating adaptive online learning by matrix approximation. Int. J. Data Sci. Anal. 9(4): 389-400 (2020) - [c3]Yuanyu Wan, Wei-Wei Tu, Lijun Zhang:
Projection-free Distributed Online Convex Optimization with $O(\sqrt{T})$ Communication Complexity. ICML 2020: 9818-9828 - [i3]Yuanyu Wan, Lijun Zhang:
Approximate Multiplication of Sparse Matrices with Limited Space. CoRR abs/2009.03527 (2020) - [i2]Yuanyu Wan, Lijun Zhang:
Projection-free Online Learning over Strongly Convex Sets. CoRR abs/2010.08177 (2020)
2010 – 2019
- 2018
- [c2]Yuanyu Wan, Nan Wei, Lijun Zhang:
Efficient Adaptive Online Learning via Frequent Directions. IJCAI 2018: 2748-2754 - [c1]Yuanyu Wan, Lijun Zhang:
Accelerating Adaptive Online Learning by Matrix Approximation. PAKDD (2) 2018: 405-417 - [i1]Yuanyu Wan, Jinfeng Yi, Lijun Zhang:
Matrix Completion from Non-Uniformly Sampled Entries. CoRR abs/1806.10308 (2018)
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-10-07 21:14 CEST 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:
