paper-with-me

홈 › Papers

Fast and Memory-Efficient Neural Code Completion

2020-04-28 · Alexey Svyatkovskiy, Sebastian Lee, Anna Hadjitofi, Maik Riechert, Juliana Franco, Miltiadis Allamanis

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.

📄 PDF Abstract BibTeX arXiv:2004.13651

Code (0)

등록된 구현이 없습니다.

Tasks

Code CompletionLanguage ModellingLearning-To-RankReranking

Similar Papers 제목 키워드 기반

Full Line Code Completion: Bringing AI to Desktop

2024-05-14 · Anton Semenkin, Vitaliy Bibaev, Yaroslav Sokolov, Kirill Krylov 외

In recent years, several industrial solutions for the problem of multi-token code completion appeared, each making a great advance in the area but mostly focusing on cloud-based runtime and avoiding working on the end us…

Code Completion

Fast Algorithm for Low-Rank Tensor Completion in Delay-Embedded Space

2022-01-01 · CVPR 2022 1 · Ryuki Yamamoto, Hidekata Hontani, Akira Imakura, Tatsuya Yokota

Tensor completion using multiway delay-embedding transform (MDT) (or Hankelization) suffers from the large memory requirement and high computational cost in spite of its high potentiality for the image modeling. Rece…

FasTer: Fast Tensor Completion with Nonconvex Regularization

2018-07-23 · Quanming Yao, James T. Kwok, Bo Han

Low-rank tensor completion problem aims to recover a tensor from limited observations, which has many real-world applications. Due to the easy optimization, the convex overlapping nuclear norm has been popularly used for…

Memory-Guided Point Cloud Completion for Dental Reconstruction

2025-12-03 · Jianan Sun, Yukang Huang, Dongzhihan Wang, Mingyu Fan arxiv

Partial dental point clouds often suffer from large missing regions caused by occlusion and limited scanning views, which bias encoder-only global features and force decoders to hallucinate structures. We propose a retri…

Point Cloud CompletionPoint Clouds

Grassmannian Optimization for Online Tensor Completion and Tracking with the t-SVD

2020-01-30 · Kyle Gilman, Davoud Ataee Tarzanagh, Laura Balzano

We propose a new fast streaming algorithm for the tensor completion problem of imputing missing entries of a low-tubal-rank tensor using the tensor singular value decomposition (t-SVD) algebraic framework. We show the t-…