default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZaiyi Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Qixin Zhang, Zongqi Wan, Zengde Deng, Zaiyi Chen, Xiaoming Sun, Jialin Zhang, Yu Yang:
Boosting Gradient Ascent for Continuous DR-submodular Maximization. CoRR abs/2401.08330 (2024)- [i10]Xiangfeng Wang, Zaiyi Chen, Zheyong Xie, Tong Xu, Yongyi He, Enhong Chen:
In-Context Former: Lightning-fast Compressing Context for Large Language Model. CoRR abs/2406.13618 (2024) - 2023
- [c12]Qixin Zhang, Zengde Deng, Zaiyi Chen, Kuangqi Zhou, Haoyuan Hu, Yu Yang:
Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback. AISTATS 2023: 3515-3537 - [c11]Qixin Zhang
, Zengde Deng, Xiangru Jian, Zaiyi Chen, Haoyuan Hu, Yu Yang:
Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization. CIKM 2023: 3330-3339 - [c10]Yuwei Chen, Zengde Deng, Yinzhi Zhou, Zaiyi Chen, Yujie Chen, Haoyuan Hu:
An Online Algorithm for Chance Constrained Resource Allocation. ICASSP 2023: 1-5 - [c9]Qixin Zhang, Wenbing Ye, Zaiyi Chen, Haoyuan Hu, Enhong Chen, Yu Yang:
Nearly Optimal Competitive Ratio for Online Allocation Problems with Two-sided Resource Constraints and Finite Requests. ICML 2023: 41786-41818 - [i9]Yuwei Chen, Zengde Deng, Yinzhi Zhou, Zaiyi Chen, Yujie Chen, Haoyuan Hu:
An Online Algorithm for Chance Constrained Resource Allocation. CoRR abs/2303.03254 (2023) - 2022
- [c8]Qixin Zhang, Zengde Deng, Zaiyi Chen, Haoyuan Hu, Yu Yang:
Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function. ICML 2022: 26116-26134 - [i8]Qixin Zhang, Zengde Deng, Zaiyi Chen, Yu Yang:
Continuous Submodular Maximization: Boosting via Non-oblivious Function. CoRR abs/2201.00703 (2022) - [i7]Qixin Zhang, Zengde Deng, Zaiyi Chen, Kuangqi Zhou, Haoyuan Hu, Yu Yang:
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback. CoRR abs/2208.07632 (2022) - [i6]Qixin Zhang, Zengde Deng, Xiangru Jian, Zaiyi Chen, Haoyuan Hu, Yu Yang:
Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization. CoRR abs/2208.08681 (2022) - 2021
- [i5]Hui Zhong, Zaiyi Chen, Chuan Qin, Zai Huang, Vincent W. Zheng, Tong Xu, Enhong Chen:
Adam revisited: a weighted past gradients perspective. CoRR abs/2101.00238 (2021) - [i4]Qixin Zhang, Wenbing Ye, Zaiyi Chen, Haoyuan Hu, Enhong Chen, Yang Yu:
Online Allocation with Two-sided Resource Constraints. CoRR abs/2112.13964 (2021) - 2020
- [j1]Hui Zhong, Zaiyi Chen, Chuan Qin, Zai Huang, Vincent W. Zheng, Tong Xu, Enhong Chen:
Adam revisited: a weighted past gradients perspective. Frontiers Comput. Sci. 14(5): 145309 (2020)
2010 – 2019
- 2019
- [c7]Yisen Wang, Xingjun Ma, Zaiyi Chen, Yuan Luo, Jinfeng Yi, James Bailey:
Symmetric Cross Entropy for Robust Learning With Noisy Labels. ICCV 2019: 322-330 - [c6]Zaiyi Chen, Zhuoning Yuan, Jinfeng Yi, Bowen Zhou, Enhong Chen, Tianbao Yang:
Universal Stagewise Learning for Non-Convex Problems with Convergence on Averaged Solutions. ICLR (Poster) 2019 - [c5]Zaiyi Chen, Yi Xu, Haoyuan Hu, Tianbao Yang:
Katalyst: Boosting Convex Katayusha for Non-Convex Problems with a Large Condition Number. ICML 2019: 1102-1111 - [i3]Dongdong Chen, Yisen Wang, Jinfeng Yi, Zaiyi Chen, Zhi-Hua Zhou:
Joint Semantic Domain Alignment and Target Classifier Learning for Unsupervised Domain Adaptation. CoRR abs/1906.04053 (2019) - [i2]Yisen Wang, Xingjun Ma, Zaiyi Chen, Yuan Luo, Jinfeng Yi, James Bailey:
Symmetric Cross Entropy for Robust Learning with Noisy Labels. CoRR abs/1908.06112 (2019) - 2018
- [c4]Zaiyi Chen, Yi Xu, Enhong Chen, Tianbao Yang:
SADAGRAD: Strongly Adaptive Stochastic Gradient Methods. ICML 2018: 912-920 - [c3]Mingrui Liu, Xiaoxuan Zhang, Zaiyi Chen, Xiaoyu Wang, Tianbao Yang:
Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate. ICML 2018: 3195-3203 - [i1]Zaiyi Chen:
Efficient Rank Minimization via Solving Non-convexPenalties by Iterative Shrinkage-Thresholding Algorithm. CoRR abs/1809.05292 (2018) - 2016
- [c2]Linli Xu, Zaiyi Chen, Qi Zhou, Enhong Chen, Nicholas Jing Yuan, Xing Xie:
Aligned Matrix Completion: Integrating Consistency and Independency in Multiple Domains. ICDM 2016: 529-538 - 2015
- [c1]Zaiyi Chen, Linli Xu, Enhong Chen, Biao Chang, Zhefeng Wang, Yitan Li:
Selecting Social Media Responses to News: A Convex Framework Based On Data Reconstruction. SDM 2015: 541-549
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-08-27 22:01 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:
