{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T15:46:59Z","timestamp":1786117619695,"version":"build-2736575974"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T00:00:00Z","timestamp":1785974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"funder":[{"name":"Frontier Technology Project of the Natural Science Foundation of Jiangxi Province","award":["20253BAC260003"],"award-info":[{"award-number":["20253BAC260003"]}]},{"name":"Distinguished Youth Fund Project of the Natural Science Foundation of Jiangxi Province","award":["20242BAB23011"],"award-info":[{"award-number":["20242BAB23011"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2026,8,31]]},"abstract":"<jats:p>The success of prompt learning when adapted to the fully qualified type name (FQN) inference has been demonstrated in the literature. However, the understanding of its success is limited in model outputs and model structures. In this article, we conduct a thorough study on the behaviors of prompt learning in FQN inference from the perspectives of sensitivity and usefulness. Rather than simply masking some knowledge, we first perform sensitivity analysis on five aspects to reveal how much FQN knowledge to include, how much to mask, and where to mask, and then yield an efficient configuration strategy. We further conduct a usefulness analysis in three aspects to demonstrate the superiority of the proposed configuration strategy. This suggests that the strong performance of our model is attributable to the homogeneity among large code pre-training, FQN prompt learning, and type inference as a fill-in-blank task. Finally, we summarize a practical guideline on best practices and pitfalls to avoid when applying prompt learning to FQN inference and other software engineering (SE) tasks.<\/jats:p>","DOI":"10.1145\/3821415","type":"journal-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:12:46Z","timestamp":1783005166000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On Prompt Learning for FQN Inference: Sensitivity and Usefulness Analysis"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2009-5637","authenticated-orcid":false,"given":"Zhiwen","family":"Luo","sequence":"first","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8877-4267","authenticated-orcid":false,"given":"Qing","family":"Huang","sequence":"additional","affiliation":[{"name":"Jiangxi Provincial Key Laboratory for High Performance Computing and State International Science and Technology Cooperation Base of Network Supporting Software, College of Artificial Intelligence, Jiangxi Normal University, Nanchang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7663-1421","authenticated-orcid":false,"given":"Zhenchang","family":"Xing","sequence":"additional","affiliation":[{"name":"Data61, CSIRO, Canberra, Australia and Australian National University, Canberra, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5212-7068","authenticated-orcid":false,"given":"Jiamou","family":"Sun","sequence":"additional","affiliation":[{"name":"Data61, CSIRO, Canberra, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9466-1672","authenticated-orcid":false,"given":"Qinghua","family":"Lu","sequence":"additional","affiliation":[{"name":"Data61, CSIRO, Canberra, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8718-1716","authenticated-orcid":false,"given":"Jiaxing","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Computer Information Engineering, Jiangxi Normal University, Nanchang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,6]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00032"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.109"},{"key":"e_1_3_1_4_2","volume-title":"Proceedings of theAdvances in Neural Information Processing Systems","volume":"32","author":"Zhou Yaqin","year":"2019","unstructured":"Yaqin Zhou, Shangqing Liu, Jingkai Siow, Xiaoning Du, and Yang Liu. 2019. Devign: Effective vulnerability identification by learning comprehensive program semantics via graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 32."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3416551"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3421472"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180260"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-Companion58688.2023.00013"},{"key":"e_1_3_1_9_2","unstructured":"Zhiyu Fan Xiang Gao Abhik Roychoudhury and Shin Hwei Tan. 2022. Improving automatically generated code from codex via automated program repair. arXiv:2205.10583. Retrieved from https:\/\/arxiv.org\/abs\/2205.10583"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2016.69"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321663"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME46990.2020.00099"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449790"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.69"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510061"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME46990.2020.00099"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568313"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3551349.3556912"},{"key":"e_1_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Zhangyin Feng Daya Guo Duyu Tang Nan Duan Xiaocheng Feng Ming Gong Linjun Shou Bing Qin Ting Liu Daxin Jiang et al. 2020. CodeBERT: A pre-trained model for programming and natural languages. arXiv:2002.08155. Retrieved from https:\/\/arxiv.org\/abs\/2002.08155","DOI":"10.18653\/v1\/2020.findings-emnlp.139"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678576"},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Yue Wang Weishi Wang Shafiq Joty and Steven C. H. Hoi. 2021. CodeT5: Identifier-aware unified pre-trained encoder-decoder models for code understanding and generation. arXiv:2109.00859. Retrieved from https:\/\/arxiv.org\/abs\/2109.00859","DOI":"10.18653\/v1\/2021.emnlp-main.685"},{"key":"e_1_3_1_22_2","unstructured":"Daniel Fried Armen Aghajanyan Jessy Lin Sida Wang Eric Wallace Freda Shi Ruiqi Zhong Wen tau Yih Luke Zettlemoyer and Mike Lewis. 2023. InCoder: A generative model for code infilling and synthesis. arXiv:2204.05999. Retrieved from https:\/\/arxiv.org\/abs\/2204.05999"},{"key":"e_1_3_1_23_2","unstructured":"Daya Guo Shuo Ren Shuai Lu Zhangyin Feng Duyu Shujie Tang Long Liu Nan Zhou A. Duan Svy-648 Shengyu et al. 2022. Analyzing codeBERT\u2019s performance on natural language code search. In ACL Workshop on NLP for Programming 1\u201313."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2346"},{"key":"e_1_3_1_25_2","unstructured":"Yonghui Wu Mike Schuster Zhifeng Chen Quoc V. Le Mohammad Norouzi Wolfgang Macherey Maxim Krikun Yuan Cao Qin Gao Klaus Macherey et al. 2016. Google\u2019s neural machine translation system: Bridging the gap between human and machine translation. arXiv:1609.08144. Retrieved from https:\/\/arxiv.org\/abs\/1609.08144"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180230"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.3115\/1220355.1220427"},{"key":"e_1_3_1_28_2","unstructured":"Yinhan Liu Myle Ott Naman Goyal Jingfei Du Mandar Joshi Danqi Chen Omer Levy Mike Lewis Luke Zettlemoyer and Veselin Stoyanov. Roberta. 2019. A robustly optimized BERT pretraining approach. arXiv:1907.11692. Retrieved from https:\/\/arxiv.org\/abs\/1907.11692"},{"key":"e_1_3_1_29_2","unstructured":"Hamel Husain Ho-Hsiang Wu Tiferet Gazit Miltiadis Allamanis and Marc Brockschmidt. 2019. CodeSearchNet challenge: Evaluating the state of semantic code search. arXiv:1909.09436. Retrieved from https:\/\/arxiv.org\/abs\/1909.09436"},{"key":"e_1_3_1_30_2","unstructured":"Mikel Artetxe Shruti Bhosale Naman Goyal Todor Mihaylov Myle Ott Sam Shleifer Xi Victoria Lin Jingfei Du Srinivasan Iyer Ramakanth Pasunuru et al. 2021. Efficient large scale language modeling with mixtures of experts. arXiv:2112.10684. Retrieved from https:\/\/arxiv.org\/abs\/2112.10684"},{"key":"e_1_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Yuxian Gu Xu Han Zhiyuan Liu and Minlie Huang. 2021. PPT: Pre-trained prompt tuning for few-shot learning. In Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) 8410\u20138423.","DOI":"10.18653\/v1\/2022.acl-long.576"},{"key":"e_1_3_1_32_2","unstructured":"Yujin Kim Jaehoon Oh Sungnyun Kim and Se-Young Yun. 2022. How to fine-tune models with few samples: Update data augmentation and test-time augmentation. arXiv:2205.07874. Retrieved from https:\/\/arxiv.org\/abs\/2205.07874"},{"key":"e_1_3_1_33_2","unstructured":"Baptiste Roziere Jonas Gehring Fabian Gloeckle Sten Sootla Itai Gat Xiaoqing Ellen Tan Yossi Adi Jingyu Liu Romain Sauvestre Tal Remez et al. 2023. Code Llama: Open foundation models for code. arXiv:2308.12950. Retrieved from https:\/\/arxiv.org\/abs\/2308.12950"},{"key":"e_1_3_1_34_2","unstructured":"Raymond Li Loubna Ben Allal Yangtian Zi Niklas Muennighoff Denis Kocetkov Chenghao Mou Marc Marone Christopher Akiki Jia Li Jenny Chim et al. 2023. StarCoder: May the source be with you! arXiv:2305.06161. Retrieved from https:\/\/arxiv.org\/abs\/2305.06161"},{"key":"e_1_3_1_35_2","unstructured":"Pengfei Liu Weizhe Yuan Jinlan Fu Zhengbao Jiang Hiroaki Hayashi and Graham Neubig. 2021. Pre-train prompt and predict: A systematic survey of prompting methods in natural language processing. arXiv:2107.13586. Retrieved from https:\/\/arxiv.org\/abs\/2107.13586"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591752"},{"key":"e_1_3_1_37_2","unstructured":"Chaozheng Wang Yuanhang Yang Cuiyun Gao Yun Peng Hongyu Zhang and Michael R. Lyu. 2022. No more fine-tuning? An experimental evaluation of prompt tuning in code intelligence. arXiv:2207.11680. Retrieved from https:\/\/arxiv.org\/abs\/2207.11680"},{"key":"e_1_3_1_38_2","doi-asserted-by":"crossref","unstructured":"Harshit Joshi Jos\u00e9 Cambronero Sumit Gulwani Vu Le Ivan Radicek and Gust Verbruggen. 2023. Repair is nearly generation: Multilingual program repair with LLMs. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 37 5131\u20135140.","DOI":"10.1609\/aaai.v37i4.25642"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3416591"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01048"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"e_1_3_1_42_2","doi-asserted-by":"crossref","unstructured":"Kun Bu Yuanchao Liu and Xiaolong Ju. 2024. Efficient utilization of pre-trained models: A review of sentiment analysis via prompt learning. Knowledge-Based Systems 283 C (January 2024) 111148.","DOI":"10.1016\/j.knosys.2023.111148"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591752"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3332787"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1049\/icp.2023.2947"},{"key":"e_1_3_1_46_2","first-page":"2377","volume-title":"Proceedings of the 2022 IEEE\/ACM 44th International Conference on Software Engineering (ICSE)","author":"Wan Yao","year":"2022","unstructured":"Yao Wan, Wei Zhao, Hongyu Zhang, Yulei Sui, Guandong Xu, and Hairong Jin. 2022. What do they capture?\u2014A structural analysis of pre-trained language models for source code. In Proceedings of the 2022 IEEE\/ACM 44th International Conference on Software Engineering (ICSE), 2377\u20132388."},{"key":"e_1_3_1_47_2","unstructured":"Luca Buratti Saurabh Pujar Mihaela A. Bornea Scott McCarley Yunhui Zheng Gaetano Rossiello Alessandro Morari Jim Laredo Veronika Thost Yufan Zhuang et al. 2020. Exploring software naturalness through neural language models. arXiv:2006.12641. Retrieved from https:\/\/arxiv.org\/abs\/2006.12641"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-65647-7_3"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3821415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T14:20:46Z","timestamp":1786026046000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3821415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,6]]},"references-count":47,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,8,31]]}},"alternative-id":["10.1145\/3821415"],"URL":"https:\/\/doi.org\/10.1145\/3821415","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,6]]},"assertion":[{"value":"2024-09-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}