Selection Without Signal, Recovery Through Expression: A Measurement Study of Post-Hoc Falsification Operators for Frozen Small Code Models

πŸ“… 2026-06-15
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
Frozen small code models often generate programs that appear plausible yet are incorrect, necessitating post-hoc correction mechanisms that do not require fine-tuning. This work systematically evaluates 26 semantic post-processing operators and finds they generally fail to surpass the Best-of-N baseline, identifying three key bottlenecks: the coverage wall, capability scissors, and consensus trap. To address these limitations, the paper introduces two harmless and effective non-semantic methods: Manifestation-layer Recovery (M1) and Adaptive Cutoff Early-stopping (ACE). M1 significantly improves performance on 12 HumanEval+ tasks for DeepSeek-Coder-1.3B (p = 2.4e-4), while ACE reduces computational cost by approximately 19%. Both methods achieve zero harm and demonstrate consistent gains across multiple models and benchmarks.
πŸ“ Abstract
Frozen small code models (<=1.5B parameters, run locally without fine-tuning) suit offline and privacy-constrained use, but often emit plausible-but-wrong programs. A natural remedy is a post-hoc operator that selects, verifies, repairs, or re-processes the model's samples without retraining; in principled form it is Popperian: attack each candidate with a severe test, keep what survives. We measure whether such operators help. Under one deterministic execution oracle and a leakage-free, matched-compute protocol, 26 semantic post-hoc operators (selection, verification, repair, elimination, portfolios, sound vetoes, generation conditioning) are evaluated against Best-of-N (BoN); on the cells and benchmarks tested, none improves held-out accuracy over BoN. The negative is mechanistic: a coverage wall (systematic hard-task failures deeper sampling does not rescue), a capability scissors (a competent generator leaves almost no discriminable error among visible-test passers), and a near-empty consensus trap (the visible-pass-but-hidden-wrong majority a leakage-free selector needs rarely co-occurs with a correct alternative). A distribution-free do-no-harm bound cannot certify a harm rate <=alpha at zero observed harm unless n>=45. Two operators help on a different axis, outside the semantic output space. An expression-layer recovery (M1), the only accuracy gain here, recovers correct programs the standard extractor discards (robust extraction and public-test signature alignment); it does no harm (b10=0), is leakage-free, and lifts DeepSeek-Coder-1.3B by +12 tasks on HumanEval+ (p=2.4e-4). An adaptive consensus early-stop (ACE) is a calibrated compute-saving control (~19% saving, zero harm). M1 and the selection negative replicate on HumanEval+ and MBPP+ across three model cells. The lesson: fix the harness and measure coverage before blaming semantic post-hoc reasoning.
Problem

Research questions and friction points this paper is trying to address.

frozen small code models
post-hoc falsification operators
code generation accuracy
semantic verification
model output reliability
Innovation

Methods, ideas, or system contributions that make the work stand out.

expression-layer recovery
post-hoc falsification
frozen code models
coverage wall
leakage-free selection
πŸ”Ž Similar Papers
2024-02-08International Conference on Machine LearningCitations: 6
2024-07-01Conference on Empirical Methods in Natural Language ProcessingCitations: 2