paper-with-me

Papers

The Larger the Better? Improved LLM Code-Generation via Budget Reallocation

2024-03-31 · Michael Hassid, Tal Remez, Jonas Gehring, Roy Schwartz, Yossi Adi

It is a common belief that large language models (LLMs) are better than smaller-sized ones. However, larger models also require significantly more time and compute during inference. This begs the question: what happens when both models operate under the same budget? (e.g., compute, run-time). To address this question, we analyze code generation LLMs of various sizes and make comparisons such as running a 70B model once vs. generating five outputs from a 13B model. We consider a standard unit-test setup, which can be used to select the correct output from the smaller model. Our findings reveal that the repeated use of smaller models can yield consistent improvements, with gains of up to 15% across five tasks. On the other hand, in scenarios where unit-tests are unavailable, a ranking-based selection of candidates from the smaller model falls short of the performance of a single output from larger ones. Our results highlight the potential of using smaller models instead of larger ones, and the importance of studying approaches for ranking LLM outputs.

📄 PDF Abstract BibTeX arXiv:2404.00725

Code (1)

slp-rl/budget-realloc 공식 구현

Tasks

Code Generation

Similar Papers 제목 키워드 기반

Model Cascading for Code: A Cascaded Black-Box Multi-Model Framework for Cost-Efficient Code Completion with Self-Testing

2024-05-24 · Boyuan Chen, Mingzhi Zhu, Brendan Dolan-Gavitt, Muhammad Shafique 외

The rapid advancement of large language models (LLMs) has significantly improved code completion tasks, yet the trade-off between accuracy and computational cost remains a critical challenge. While using larger models an…

Code CompletionCode GenerationmodelText Generation

Beyond pass@k: Redundancy-Aware RLVR for Multi-Sample Code Generation

2026-05-27 · Le Bronnec Florian, Alexandre Verine, Rio Yokota, Benjamin Negrevergne arxiv

LLMs for code generation are commonly evaluated in repeated-sampling settings using Pass@k, where multiple candidate programs are executed against unit tests under a finite sampling budget. While recent verifier-based re…

Reinforcement LearningCode Generation

A.S.E: A Repository-Level Benchmark for Evaluating Security in AI-Generated Code

2025-08-25 · Keke Lian, Bin Wang, Lei Zhang, Libo Chen 외 arxiv

The increasing adoption of large language models (LLMs) in software engineering necessitates rigorous security evaluation of their generated code. However, existing benchmarks often lack relevance to real-world AI-assist…

Code Generation

Reasoning Cache: Continual Improvement Over Long Horizons via Short-Horizon RL

2026-02-03 · Ian Wu, Yuxiao Qu, Amrith Setlur, Aviral Kumar arxiv

Large Language Models (LLMs) that can continually improve beyond their training budgets are able to solve increasingly difficult problems by adapting at test time, a property we refer to as extrapolation. However, standa…

Reinforcement LearningResponse Generation

CoT2-Meta: Budgeted Metacognitive Control for Test-Time Reasoning

2026-03-30 · Siyuan Ma, Bo Gao, Zikai Xiao, Hailong Wang 외 arxiv

Recent test-time reasoning methods improve performance by generating more candidate chains or searching over larger reasoning trees, but they typically lack explicit control over when to expand, what to prune, how to rep…