default search action
Yancheng Yuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Qian Li, Defeng Sun
, Yancheng Yuan
An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints. SIAM J. Optim. 34(2): 2038-2066 (2024) - [c8]Keqin Peng, Liang Ding, Yancheng Yuan, Xuebo Liu, Min Zhang, Yuanxin Ouyang, Dacheng Tao:
Revisiting Demonstration Selection Strategies in In-Context Learning. ACL (1) 2024: 9090-9101 - [c7]Yuni Lai, Bailin Pan, Kaihuang Chen, Yancheng Yuan, Kai Zhou:
Collective Certified Robustness against Graph Injection Attacks. ICML 2024 - [c6]Jiayi Liao
LLaRA: Large Language-Recommendation Assistant. SIGIR 2024: 1785-1795 - [i15]Keqin Peng, Liang Ding, Yancheng Yuan, Xuebo Liu, Min Zhang, Yuanxin Ouyang, Dacheng Tao:
Revisiting Demonstration Selection Strategies in In-Context Learning. CoRR abs/2401.12087 (2024) - [i14]Yuni Lai, Bailin Pan, Kaihuang Chen, Yancheng Yuan, Kai Zhou:
Collective Certified Robustness against Graph Injection Attacks. CoRR abs/2403.01423 (2024) - [i13]Maojun Sun
LAMBDA: A Large Model Based Data Agent. CoRR abs/2407.17535 (2024) - [i12]Chen-Lu Ding, Jiancan Wu, Wei Lin, Shiyang Shen, Xiang Wang, Yancheng Yuan:
Adaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Number. CoRR abs/2407.20119 (2024) - 2023
- [c5]Zhengyi Yang, Jiancan Wu, Zhicai Wang, Xiang Wang, Yancheng Yuan, Xiangnan He:
Generate What You Prefer: Reshaping Sequential Recommendation via Guided Diffusion. NeurIPS 2023 - [c4]An Zhang, Jingnan Zheng, Xiang Wang, Yancheng Yuan
Invariant Collaborative Filtering to Popularity Distribution Shift. WWW 2023: 1240-1251 - [i11]An Zhang, Jingnan Zheng, Xiang Wang, Yancheng Yuan, Tat-Seng Chua:
Invariant Collaborative Filtering to Popularity Distribution Shift. CoRR abs/2302.05328 (2023) - [i10]Ziwen Wang, Yancheng Yuan, Jiaming Ma, Tieyong Zeng, Defeng Sun:
Randomly Projected Convex Clustering Model: Motivation, Realization, and Cluster Recovery Guarantees. CoRR abs/2303.16841 (2023) - [i9]Zhengyi Yang, Jiancan Wu, Zhicai Wang, Xiang Wang, Yancheng Yuan, Xiangnan He:
Generate What You Prefer: Reshaping Sequential Recommendation via Guided Diffusion. CoRR abs/2310.20453 (2023) - [i8]Zhengyi Yang, Jiancan Wu, Yanchen Luo, Jizhi Zhang, Yancheng Yuan, An Zhang, Xiang Wang, Xiangnan He:
Large Language Model Can Interpret Latent Space of Sequential Recommender. CoRR abs/2310.20487 (2023) - [i7]Jiayi Liao, Sihang Li, Zhengyi Yang, Jiancan Wu, Yancheng Yuan, Xiang Wang:
LLaRA: Aligning Large Language Models with Sequential Recommenders. CoRR abs/2312.02445 (2023) - [i6]Xingqiao Li, Jindong Gu, Zhiyong Wang, Yancheng Yuan, Bo Du, Fengxiang He:
XAI for In-hospital Mortality Prediction via Multimodal ICU Data. CoRR abs/2312.17624 (2023) - 2022
- [j4]Guang Cheng
On the Test Accuracy and Effective Control of the COVID-19 Pandemic: A Case Study in Singapore. INFORMS J. Appl. Anal. 52(6): 524-538 (2022) - [j3]Yancheng Yuan
A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering. SIAM J. Optim. 32(3): 2294-2318 (2022) - [i5]Shiye Lei, Fengxiang He, Yancheng Yuan, Dacheng Tao:
Understanding deep learning via decision boundary. CoRR abs/2206.01515 (2022) - 2021
- [j2]Defeng Sun, Kim-Chuan Toh, Yancheng Yuan:
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm. J. Mach. Learn. Res. 22: 9:1-9:32 (2021) - [c3]Xiang Wang, Tinglin Huang
Learning Intents behind Interactions with Knowledge Graph for Recommendation. WWW 2021: 878-887 - [i4]Xiang Wang, Tinglin Huang, Dingxian Wang, Yancheng Yuan, Zhenguang Liu, Xiangnan He, Tat-Seng Chua:
Learning Intents behind Interactions with Knowledge Graph for Recommendation. CoRR abs/2102.07057 (2021) - 2020
- [j1]Defeng Sun
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35(1): 87-115 (2020)
2010 – 2019
- 2019
- [i3]Yancheng Yuan, Meixia Lin, Defeng Sun, Kim-Chuan Toh:
On the Closed-form Proximal Mapping and Efficient Algorithms for Exclusive Lasso Models. CoRR abs/1902.00151 (2019) - 2018
- [c2]Yancheng Yuan, Defeng Sun, Kim-Chuan Toh:
An Efficient Semismooth Newton Based Algorithm for Convex Clustering. ICML 2018: 5704-5712 - [i2]Yancheng Yuan, Defeng Sun, Kim-Chuan Toh:
An Efficient Semismooth Newton Based Algorithm for Convex Clustering. CoRR abs/1802.07091 (2018) - [i1]Defeng Sun, Kim-Chuan Toh, Yancheng Yuan:
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm. CoRR abs/1810.02677 (2018) - 2014
- [c1]Yao Peng, Juyong Zhang, Yancheng Yuan
Robust interactive image segmentation via iterative refinement. ICIP 2014: 4383-4387
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:21 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: