Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jinglian Wu

dblp:369/7679 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 67% Software maintenance and evolution · 33%
Artificial intelligence
1 paper
Transfer learning and domain adaptation · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation › code documentation generation
code comment generation
0.712023
On-the-Fly Adapting Code Summarization on Trainable Cost-Effective Language Models · NeurIPS 2023
Program synthesis and code generation
code summarization
0.712023
On-the-Fly Adapting Code Summarization on Trainable Cost-Effective Language Models · NeurIPS 2023
Software maintenance and evolution
program comprehension
0.712023
On-the-Fly Adapting Code Summarization on Trainable Cost-Effective Language Models · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

unlearning · 1.3sample retrieval · 1.3language model fine-tuning · 1.3
YearPublicationVenuePosition
2023 On-the-Fly Adapting Code Summarization on Trainable Cost-Effective Language Models
abstract
Deep learning models are emerging to summarize source code to comment, facilitating tasks of code documentation and program comprehension. Scaled-up large language models trained on large open corpus have achieved good performance in such tasks. However, in practice, the subject code in one certain project can be specific, which may not align with the overall training corpus. Some code samples from other projects may be contradictory and introduce inconsistencies when the models try to fit all the samples. In this work, we introduce a novel approach, Adacom, to improve the performance of comment generators by on-the-fly model adaptation. This research is motivated by the observation that deep comment generators often need to strike a balance as they need to fit all the training samples. Specifically, for one certain target code $c$, some training samples $S_p$ could have made more contributions while other samples $S_o$ could have counter effects. However, the traditional fine-tuned models need to fit both $S_p$ and $S_o$ from a global perspective, leading to compromised performance for one certain target code $c$. In this context, we design Adacom to (1) detect whether the model might have a compromised performance on a target code $c$ and (2) retrieve a few helpful training samples $S_p$ that have contradictory samples in the training dataset and, (3) adapt the model on the fly by re-training the $S_p$ to strengthen the helpful samples and unlearn the harmful samples. Our extensive experiments on 7 comment generators and 4 public datasets show that (1) can significantly boost the performance of comment generation (BLEU4 score by on average 14.9\%, METEOR by 12.2\%, and ROUGE-L by 7.4\%), (2) the adaptation on one code sample is cost-effective and acceptable as an on-the-fly solution, and (3) can adapt well on out-of-distribution code samples.
Yufan Cai 0001, Yun Lin 0001, Chenyan Liu, Jinglian Wu, Yifan Zhang 0019, Yeyun Gong, Jin Song Dong 0001
NeurIPS4