Pith. sign in

REVIEW 1 cited by

A Convolutional Attention Network for Extreme Summarization of Source Code

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1602.03001 v2 pith:YXQ47Y6O submitted 2016-02-09 cs.LG cs.CLcs.SE

classification cs.LGcs.CLcs.SE
keywords attentionfeaturesattentionalcodeinputmechanismsnetworkneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Attention mechanisms in neural networks have proved useful for problems in which the input and output do not have fixed dimension. Often there exist features that are locally translation invariant and would be valuable for directing the model's attention, but previous attentional architectures are not constructed to learn such features specifically. We introduce an attentional neural network that employs convolution on the input tokens to detect local time-invariant and long-range topical attention features in a context-dependent way. We apply this architecture to the problem of extreme summarization of source code snippets into short, descriptive function name-like summaries. Using those features, the model sequentially generates a summary by marginalizing over two attention mechanisms: one that predicts the next summary token based on the attention weights of the input tokens and another that is able to copy a code token as-is directly into the summary. We demonstrate our convolutional attention neural network's performance on 10 popular Java projects showing that it achieves better performance compared to previous attentional mechanisms.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LLMCup: Ranking-Enhanced Comment Updating with LLMs

    cs.SE 2025-07 conditional novelty 6.0 of 10

    LLMCup combines multi-prompt LLM comment generation with a learned ranker, achieving 0.383 exact-match accuracy on the CUP test set versus 0.257 for HebCup and 0.177 for CUP.

Pith tools