mlsanityData to 14 Oct 2026

Importance Sampling is All You Need: Predict LLM's performance on new benchmark by reusing existing benchmark

arXiv 2508.01203 ↗First posted 2 Aug 2025cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

With the rapid advancement of large language models , code generation has become a key benchmark for evaluating LLM capabilities. However, existing benchmarks face two major challenges: (1) the escalating cost of constructing high-quality test suites and reference solutions, and (2) the increasing risk of data contamination, which undermines the reliability of benchmark-based evaluations. In this paper, we propose BIS, a prompt-centric evaluation framework that enables ground-truth-free prediction of LLM performance on code generation tasks. Rather than executing generated code, BIS estimates performance metrics by analyzing the prompt distribution alone. Built on importance sampling theory and implemented using Importance Weighted Autoencoders, our method reweights samples from existing annotated benchmarks to estimate performance on new, unseen benchmarks. To stabilize the estimation, we introduce weight truncation strategies and compute marginal expectations across the fitted distributions. BIS serves as a complementary tool that supports benchmark development and validation under constrained resources, offering actionable and quick feedback for prompt selection and contamination assessment. We conduct extensive experiments involving 8,000 evaluation points across 4 CodeLlama models and 9 diverse benchmarks. Our framework achieves an average absolute prediction error of 1.1% for code correctness scores, with best- and worst-case errors of 0.3% and 1.9%, respectively. It also generalizes well to other metrics, attaining average absolute errors of 2.15% for pass@1. These results demonstrate the reliability and broad applicability of BIS, which can significantly reduce the cost and effort of benchmarking LLMs in code-related tasks.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 42 references that are in the map. First posted on arXiv 2 Aug 2025.

Builds on

20 of 42 references.

References · 20

  1. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  2. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
  3. 2023Code Llama: Open Foundation Models for Codecited by 2,139
  4. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,920
  5. 2016Variational Inference: A Review for Statisticianscited by 1,472
  6. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
  7. 2024BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructionscited by 546
  8. 2020CodeBLEU: a Method for Automatic Evaluation of Code Synthesiscited by 479
  9. 2015Importance Weighted Autoencoderscited by 456
  10. 2018Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Networkcited by 420
  11. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 264
  12. 2023Task Contamination: Language Models May Not Be Few-Shot Anymorecited by 99
8 more
  1. 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 95
  2. 2023TinyGSM: achieving >80% on GSM8k with small language modelscited by 70
  3. 2024TestGenEval: A Real World Unit Test Generation and Test Completion Benchmarkcited by 52
  4. 2024A Survey on Evaluating Large Language Models in Code Generation Taskscited by 44
  5. 2024Changing Answer Order Can Decrease MMLU Accuracycited by 42
  6. 2024Top Leaderboard Ranking = Top Coding Proficiency, Always? EvoEval: Evolving Coding Benchmarks via LLMcited by 40
  7. 2025LessLeak-Bench: A First Investigation of Data Leakage in LLMs Across 83 Software Engineering Benchmarkscited by 37
  8. 2024Does Data Contamination Detection Work (Well) for LLMs? A Survey and Evaluation on Detection Assumptionscited by 26

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.