paper-with-me

홈 › Papers

Icing on the Cake: Automatic Code Summarization at Ericsson

2024-08-19 · Giriprasad Sridhara, Sujoy Roychowdhury, Sumit Soman, Ranjani H G, Ricardo Britto

This paper presents our findings on the automatic summarization of Java methods within Ericsson, a global telecommunications company. We evaluate the performance of an approach called Automatic Semantic Augmentation of Prompts (ASAP), which uses a Large Language Model (LLM) to generate leading summary comments for Java methods. ASAP enhances the $LLM's$ prompt context by integrating static program analysis and information retrieval techniques to identify similar exemplar methods along with their developer-written Javadocs, and serves as the baseline in our study. In contrast, we explore and compare the performance of four simpler approaches that do not require static program analysis, information retrieval, or the presence of exemplars as in the ASAP method. Our methods rely solely on the Java method body as input, making them lightweight and more suitable for rapid deployment in commercial software development environments. We conducted experiments on an Ericsson software project and replicated the study using two widely-used open-source Java projects, Guava and Elasticsearch, to ensure the reliability of our results. Performance was measured across eight metrics that capture various aspects of similarity. Notably, one of our simpler approaches performed as well as or better than the ASAP method on both the Ericsson project and the open-source projects. Additionally, we performed an ablation study to examine the impact of method names on Javadoc summary generation across our four proposed approaches and the ASAP method. By masking the method names and observing the generated summaries, we found that our approaches were statistically significantly less influenced by the absence of method names compared to the baseline. This suggests that our methods are more robust to variations in method names and may derive summaries more comprehensively from the method body than the ASAP approach.

📄 PDF Abstract BibTeX arXiv:2408.09735

Code (0)

등록된 구현이 없습니다.

Tasks

Code SummarizationInformation RetrievalLarge Language ModelRetrieval

Similar Papers 제목 키워드 기반

Icing on the Cake: An Easy and Quick Post-Learnig Method You Can Try After Deep Learning

2018-07-17 · Tomohiko Konno, Michiaki Iwazume

We found an easy and quick post-learning method named "Icing on the Cake" to enhance a classification performance in deep learning. The method is that we train only the final classifier again after an ordinary training i…

Deep LearningGeneral Classification

Representing and Generating Levels Over Time through Playtrace Reconstructive Partitioning

2026-07-13 · Emily Halina, Matthew Guzdial arxiv

Video games are a dynamic medium experienced over time. While there are many Procedural Content Generation (PCG) approaches for generating video game levels, they often use representations that abstract away this dynamic…

CAKES: Channel-wise Automatic KErnel Shrinking for Efficient 3D Networks

2020-03-28 · Qihang Yu, Yingwei Li, Jieru Mei, Yuyin Zhou 외

3D Convolution Neural Networks (CNNs) have been widely applied to 3D scene understanding, such as video analysis and volumetric image recognition. However, 3D networks can easily lead to over-parameterization which incur…

3D Medical Imaging SegmentationAction RecognitionMedical Image SegmentationNeural Architecture Search+2

HOTCAKE: Higher Order Tucker Articulated Kernels for Deeper CNN Compression

2020-02-28 · Rui Lin, Ching-Yun Ko, Zhuolun He, Cong Chen 외

The emerging edge computing has promoted immense interests in compacting a neural network without sacrificing much accuracy. In this regard, low-rank tensor decomposition constitutes a powerful tool to compress convoluti…

Edge-computingTensor Decomposition

The Cake that is Intelligence and Who Gets to Bake it: An AI Analogy and its Implications for Participation

2025-02-05 · Martin Mundt, Anaelia Ovalle, Felix Friedrich, A Pranav 외

In a widely popular analogy by Turing Award Laureate Yann LeCun, machine intelligence has been compared to cake - where unsupervised learning forms the base, supervised learning adds the icing, and reinforcement learning…