REVIEW 10 cited by
RepoHyper: Search-Expand-Refine on Semantic Graphs for Repository-Level Code Completion
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
Signed reviews
read the original abstract
Code Large Language Models (CodeLLMs) have demonstrated impressive proficiency in code completion tasks. However, they often fall short of fully understanding the extensive context of a project repository, such as the intricacies of relevant files and class hierarchies, which can result in less precise completions. To overcome these limitations, we present \tool, a multifaceted framework designed to address the complex challenges associated with repository-level code completion. Central to RepoHYPER is the {\em Repo-level Semantic Graph} (RSG), a novel semantic graph structure that encapsulates the vast context of code repositories. Furthermore, RepoHyper leverages Expand and Refine retrieval method, including a graph expansion and a link prediction algorithm applied to the RSG, enabling the effective retrieval and prioritization of relevant code snippets. Our evaluations show that \tool markedly outperforms existing techniques in repository-level code completion, showcasing enhanced accuracy across various datasets when compared to several strong baselines. Our implementation of RepoHYPER can be found at https://github.com/FSoft-AI4Code/RepoHyper.
Forward citations
Cited by 10 Pith papers
-
RepoReasoner: Evaluating Repository-Level Code Reasoning Ability of Long-Context Language Models
RepoReasoner is a repository-level code-reasoning benchmark with output-prediction and call-chain tasks; the best LLM reaches only 69.1% Pass@1 even with oracle context, with low recall in dependency tracing.
-
Enhancing Project-Specific Code Completion by Inferring Internal API Information
A retrieval-augmented code completion method that infers project-internal APIs from a rough draft and a static knowledge base, beating existing repo-level baselines.
-
Risk Assessment Framework for Code LLMs via Leveraging Internal States
PtTrust pre-trains a sparse autoencoder on LLM hidden states at line boundaries, then trains a small ranker to identify erroneous code lines, reporting state-of-the-art cross-task and cross-language results.
-
Optimizing Datasets for Code Summarization: Is Code-Comment Coherence Enough?
Filtering code summarization training data by code-comment coherence gives no better results than random selection, and halving the training set does not hurt performance.
-
Correctness Assessment of Code Generated by Large Language Models Using Internal Representations
Internal hidden states of code LLMs carry a usable signal about whether the generated code is correct, and a lightweight probing classifier on those states predicts test-passing with F1 around 0.7 to 0.8 across benchmarks.
-
Improving FIM Code Completions via Context & Curriculum Based Learning
Fine-tuning FIM code models on curriculum examples with retrieved context improves completion quality and live acceptance, with the largest gains for small models.
-
Repository-Level Graph Representation Learning for Enhanced Security Patch Detection
RepoSPD builds repository-level code-property graphs for security patch detection and reports accuracy improvements of 11.90% and 3.10% over prior baselines on two extended C/C++ datasets.
-
CodeXEmbed: A Generalist Embedding Model Family for Multiligual and Multi-task Code Retrieval
A family of code embedding models (400M to 7B) trained with multi-stage LoRA achieves top CoIR scores and competitive BEIR text scores, improving code RAG.
-
ContextModule: Improving Code Completion via Repository-level Contextual Information
Feeding code-completion models a developer's recent file history, similar code, and key symbol definitions raised completion acceptance rates in internal ByteDance deployments by an estimated 15 percent.
-
Adaptive Request Scheduling for CodeLLM Serving with SLA Guarantees
SABER uses a fitted scalability curve and deadline-aware admission control to dynamically size continuous batches, improving SLA-compliant throughput by up to 26% over the best static configuration.
Discussion (0). Continue with ORCID to comment.