pith. sign in

arxiv: 2004.13651 · v4 · pith:R7EMJL4Jnew · submitted 2020-04-28 · 💻 cs.SE · cs.LG

Fast and Memory-Efficient Neural Code Completion

classification 💻 cs.SE cs.LG
keywords completionneuralcodedesigndevelopmentframeworkmodelmodels
0
0 comments X
read the original abstract

Code completion is one of the most widely used features of modern integrated development environments (IDEs). While deep learning has made significant progress in the statistical prediction of source code, state-of-the-art neural network models consume hundreds of megabytes of memory, bloating the development environment. We address this in two steps: first we present a modular neural framework for code completion. This allows us to explore the design space and evaluate different techniques. Second, within this framework we design a novel reranking neural completion model that combines static analysis with granular token encodings. The best neural reranking model consumes just 6 MB of RAM, - 19x less than previous models - computes a single completion in 8 ms, and achieves 90% accuracy in its top five suggestions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Security of deterministic key distribution with higher-dimensional systems

    quant-ph 2025-05 unverdicted novelty 5.0

    Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic u...