Zhang, Yue
Soochow University
13 papers on CoChatORCID 0000-0002-5214-2268
Most cited papers
- Verified
A Survey on Evaluation of Large Language Models
Chang, Y., Wang, X., Wang, J., Wu, Y., Yang, L., Zhu, K., Chen, H., Yi, X., Wang, C., Wang, Y., et al. (2024) · ACM Transactions on Intelligent Systems and Technology
Topic ModelingNatural Language Processing Techniques
Cited by 4,254
- Verified
A Survey on Evaluation of Large Language Models
Chang, Y., Wang, X., Wang, J., Wu, Y., Yang, L., Zhu, K., Chen, H., Yi, X., Wang, C., Wang, Y., et al. (2023) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 3,159
- Verified
Siren's Song in the AI Ocean: A Survey on Hallucination in Large Language Models
Zhang, Y., Li, Y., Cui, L., Cai, D., Liu, L., Fu, T., Huang, X., Zhao, E., Zhang, Y., Xu, C., et al. (2023) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 544
- Verified · note
Siren's Song in the AI Ocean: A Survey on Hallucination in Large Language Models
Zhang, Y., Li, Y., Cui, L., Cai, D., Liu, L., Fu, T., Huang, X., Zhao, E., Zhang, Y., Chen, Y., et al. (2025) · Computational Linguistics
Topic ModelingNatural Language Processing Techniques
Cited by 534
- Verified
Template-Based Named Entity Recognition Using BART
Cui, L., Wu, Y., Liu, J., Yang, S., & Zhang, Y. (2021) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 342
- Verified
A Graph-to-Sequence Model for AMR-to-Text Generation
Song, L., Zhang, Y., Wang, Z., & Gildea, D. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Natural Language Processing TechniquesTopic Modeling
Cited by 216
- Verified
RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation
Zhang, F., Chen, B., Zhang, Y., Keung, J., Liu, J., Zan, D., Mao, Y., Lou, J.-G., & Chen, W. (2023) · Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing
Software Engineering ResearchTopic Modeling
Cited by 173
- Verified
PromptRobust: Towards Evaluating the Robustness of Large Language Models on Adversarial Prompts
Zhu, K., Wang, J., Zhou, J., Wang, Z., Chen, H., Wang, Y., Yang, L., Ye, W., Zhang, Y., Gong, N. Z., et al. (2023) · arXiv
Adversarial Robustness in Machine LearningTopic Modeling
Cited by 153
- Verified
PromptRobust: Towards Evaluating the Robustness of Large Language Models on Adversarial Prompts
Zhu, K., Wang, J., Zhou, J., Wang, Z., Chen, H., Wang, Y., Yang, L., Ye, W., Zhang, Y., Gong, N., et al. (2023) · Proceedings of the 1st ACM Workshop on Large AI Systems and Models with Privacy and Safety Analysis
Adversarial Robustness in Machine LearningTopic Modeling
Cited by 151
- Verified · note
MuTual: A Dataset for Multi-Turn Dialogue Reasoning
Cui, L., Wu, Y., Liu, S., Zhang, Y., & Zhou, M. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics
Speech and dialogue systemsIntelligent Tutoring Systems and Adaptive Learning
Cited by 110
- Verified
Can Generative Pre-trained Language Models Serve As Knowledge Bases for Closed-book QA?
Wang, C., Liu, P., & Zhang, Y. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers)
Topic ModelingNatural Language Processing Techniques
Cited by 55
- Verified
Logiqa 2.0—An improved dataset for logical reasoning in natural language understanding
Liu, H., Liu, J., Cui, L., Teng, Z., Duan, N., Zhou, M., & Zhang, Y. (2023) · IEEE/ACM Transactions on Audio Speech and Language Processing
Topic ModelingNatural Language Processing Techniques
Cited by 26
- Verified
SemGloVe: Semantic Co-Occurrences for GloVe From BERT
Gan, L., Teng, Z., Zhang, Y., Zhu, L., Wu, F., & Yang, Y. (2022) · IEEE/ACM Transactions on Audio, Speech, and Language Processing
Topic ModelingNatural Language Processing Techniques
Cited by 22
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free