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

Badal Singh

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

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

Artificial intelligence and machine learning · 1

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 · 50% Program analysis · 50%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code completion
0.412019
Open Vocabulary Learning on Source Code with a Graph-Structured Cache · ICML 2019
Program analysis
code representation learning
0.412019
Open Vocabulary Learning on Source Code with a Graph-Structured Cache · ICML 2019
Natural language and speech › Information extraction and text analysis
open vocabulary learning
0.112019
Open Vocabulary Learning on Source Code with a Graph-Structured Cache · ICML 2019

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

graph-structured cache · 0.8graph neural network · 0.8
YearPublicationVenuePosition
2019 Open Vocabulary Learning on Source Code with a Graph-Structured Cache
abstract
Machine learning models that take computer program source code as input typically use Natural Language Processing (NLP) techniques. However, a major challenge is that code is written using an open, rapidly changing vocabulary due to, e.g., the coinage of new variable and method names. Reasoning over such a vocabulary is not something for which most NLP methods are designed. We introduce a Graph-Structured Cache to address this problem; this cache contains a node for each new word the model encounters with edges connecting each word to its occurrences in the code. We find that combining this graph-structured cache strategy with recent Graph-Neural-Network-based models for supervised learning on code improves the models’ performance on a code completion task and a variable naming task — with over 100% relative improvement on the latter — at the cost of a moderate increase in computation time.
Milan Cvitkovic, Badal Singh, Anima Anandkumar
ICML2