Challenge: Large Language Models (LLMs) excel at code-related tasks but struggle in real software repositories.
Approach: They propose a large-scale agent that injects repository context at inference time to improve both latency and code-generation quality by proactively exploring repository files during indexing and constructing speculative context.
Outcome: Experiments show that SpecAgent achieves 9–11% relative performance gains compared to baselines while significantly reducing inference latency.

Similar Papers

CodeAgent: Enhancing Code Generation with Tool-Integrated Agent Systems for Real-World Repo-level Coding Challenges (2024.acl-long)

Copied to clipboard

Challenge: Large Language Models excel in simple tasks such as generating standalone code units, but real-world software development often involves complex code repositories with complex dependencies and extensive documentation.
Approach: They propose a novel LLM-based agent framework that employs external tools for effective repo-level code generation.
Outcome: The proposed framework outperforms commercial products like Github Copilot in the humanEval benchmark and shows that it is adaptable and efficient across multiple code generation tasks.
Decoding the Market’s Pulse: Context-Enriched Agentic Retrieval Augmented Generation for Predicting Post-Earnings Price Shocks (2026.eacl-long)

Copied to clipboard

Challenge: Existing methods for forecasting large stock price movements after corporate earnings calls are prone to **narrative bias** Existing approaches lack temporal-causal reasoning and are unable to predict large stock prices.
Approach: They propose a retrieval-augmented framework that deploys a team of cooperative LLM agents . they retrieve structured evidence from a Causal-Temporal Knowledge Graph built from financial statements and earnings calls .
Outcome: The proposed framework outperforms larger LLMs and fine-tuned models in macro-F1, MCC, and Sharpe for the same forecasting horizon.
DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) decoding in large language models is latency-bounded by strictly sequential token generation.
Approach: They propose a diffusion-based drafter that proposes multi-token candidates and then verifies them in parallel by the target model.
Outcome: The proposed drafter generates multi-token proposals in a single forward pass while remaining compatible with standard AR verifiers.
DReSD: Dense Retrieval for Speculative Decoding (2025.findings-acl)

Copied to clipboard

Challenge: Speculative decoding (SD) uses an efficient draft model to propose the next few tokens, which are verified by the LLM in a single forward call, reducing latency while preserving its outputs.
Approach: They propose a draft model that proposes the next few tokens from a non-parametric datastore and uses a framework that uses approximate nearest neighbour search with contextualised token embeddings to retrieve the most semantically relevant sequences for SD.
Outcome: The proposed framework achieves (on average) 87% higher acceptance rates, 65% longer accepted tokens and 19% faster generation speeds compared to sparse retrieval (REST).
Speculative Streaming: Efficient and Scalable Speculative Decoding with Multi-Stream Attention (2025.emnlp-main)

Copied to clipboard

Challenge: Speculative decoding is a prominent technique for accelerating LLM inference by leveraging an auxiliary draft model, but its effectiveness is limited by the autoregressive nature of draft generation.
Approach: They propose a method that integrates speculative draft generation directly within the target model using multi-stream attention.
Outcome: The proposed method improves acceptance but also latency and speculation latency, limiting overall speedup.
RACER: Retrieval-Augmented Contextual Rapid Speculative Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for decoding large language models generate one token per step, causing high inference latency.
Approach: They propose a method that integrates retrieved exact patterns with logit-driven future cues.
Outcome: Experiments on Spec-Bench, HumanEval, and MGSM-ZH show that RACER outperforms training-free methods and accelerates inference.
Speculative Verification: Exploiting Information Gain for Speculative Decoding (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are used for many applications but their size and computational cost make inference serving a significant challenge.
Approach: They propose an efficient augmentation to Speculative Decoding (SD) that predicts speculation accuracy and dynamically adapts the verification length to maximize throughput.
Outcome: The proposed model reduces wasted verification on rejected tokens and improves decoding efficiency.
Can We Predict Before Executing Machine Learning Agents? (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to scientific discovery rely on expensive physical execution . a Generate-Execute-Feedback paradigm is costly and slow .
Approach: They propose to internalize execution priors to substitute costly runtime checks with instantaneous predictive reasoning, drawing inspiration from World Models.
Outcome: The proposed framework achieves 61.5% accuracy and robust confidence calibration when primed with a Verified Data Analysis Report.
Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decoding (2024.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have a high inference latency stemming from autoregressive decoding.
Approach: They propose a novel decoding paradigm that drafts multiple tokens and verifies them in parallel . they aim to provide a catalyst for further research on Speculative Decoding .
Outcome: The proposed method drafts multiple tokens and verifies them in parallel . it can be used to accelerate inference in large language models.
HeteroSpec: Leveraging Contextual Heterogeneity for Efficient Speculative Decoding (2026.acl-long)

Copied to clipboard

Challenge: Autoregressive decoding limits the inference throughput of Large Language Models due to its sequential dependency.
Approach: They propose a framework that allocates verification effort in proportion to candidate uncertainty.
Outcome: Speculative decoding achieves an average speedup over state-of-the-art methods . a small subset of high-confidence predictions accounts for most successful verifications .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations