paper-with-me

홈 › Papers

TreeRanker: Fast and Model-agnostic Ranking System for Code Suggestions in IDEs

2025-08-04 · Daniele Cipollone, Egor Bogomolov, Arie van Deursen, Maliheh Izadi arxiv

Token-level code completion is one of the most critical features in modern Integrated Development Environments (IDEs). It assists developers by suggesting relevant identifiers and APIs during coding. While completions are typically derived from static analysis, their usefulness depends heavily on how they are ranked, as correct predictions buried deep in the list are rarely seen by users. Most current systems rely on hand-crafted heuristics or lightweight machine learning models trained on user logs, which can be further improved to capture context information and generalize across projects and coding styles. In this work, we propose a new scoring approach to ranking static completions using language models in a lightweight and model-agnostic way. Our method organizes all valid completions into a prefix tree and performs a single greedy decoding pass to collect token-level scores across the tree. This enables a precise token-aware ranking without needing beam search, prompt engineering, or model adaptations. The approach is fast, architecture-agnostic, and compatible with already deployed models for code completion. These findings highlight a practical and effective pathway for integrating language models into already existing tools within IDEs, and ultimately providing smarter and more responsive developer assistance.

📄 PDF Abstract BibTeX arXiv:2508.02455

Code (0)

등록된 구현이 없습니다.

Tasks

Prompt EngineeringCode Completion

Similar Papers 제목 키워드 기반

Learning to Fast Unrank in Collaborative Filtering Recommendation

2025-11-10 · Junpeng Zhao, Lin Li, Ming Li, Amran Bhuiyan 외 arxiv

Modern data-driven recommendation systems risk memorizing sensitive user behavioral patterns, raising privacy concerns. Existing recommendation unlearning methods, while capable of removing target data influence, suffer …

Collaborative FilteringRecommendation Systems

Reinforcement Speculative Decoding for Fast Ranking

2025-05-23 · Yingpeng Du, Tianjun Wei, Zhu Sun, Jie Zhang

Large Language Models (LLMs) have been widely adopted in ranking systems such as information retrieval (IR) systems and recommender systems (RSs). To alleviate the latency of auto-regressive decoding, some studies explor…

Information RetrievalRecommendation SystemsReinforcement Learning (RL)

Zero Shot on the Cold-Start Problem: Model-Agnostic Interest Learning for Recommender Systems

2021-08-31 · Philip J. Feng, Pingjun Pan, Tingting Zhou, Hongxiang Chen 외

User behavior has been validated to be effective in revealing personalized preferences for commercial recommendations. However, few user-item interactions can be collected for new users, which results in a null space for…

Recommendation Systems

Learning to Rank Rationales for Explainable Recommendation

2022-06-10 · Zhichao Xu, Yi Han, Tao Yang, Anh Tran 외

State-of-the-art recommender system (RS) mostly rely on complex deep neural network (DNN) model structure, which makes it difficult to provide explanations along with RS decisions. Previous researchers have proved that p…

Explainable RecommendationLearning-To-RankOpen-Ended Question AnsweringPersuasiveness+1

Cascaded Fast and Slow Models for Efficient Semantic Code Search

2021-10-15 · Akhilesh Deepak Gotmare, Junnan Li, Shafiq Joty, Steven C. H. Hoi

The goal of natural language semantic code search is to retrieve a semantically relevant code snippet from a fixed set of candidates using a natural language query. Existing approaches are neither effective nor efficient…

Code SearchRe-RankingRetrieval