arXiv AI By Yegon Kim, Juho Lee

Mitigating Legibility Tax with Decoupled Prover-Verifier Games

Read the original on arXiv AI →

arXiv:2602. 23248v2 Announce Type: replace Abstract: As large language models become increasingly capable, it is critical that their outputs can be easily checked by less capable systems.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Sep 11

Beyond Solver Verdicts: Generative Reward Models for Autoformalization

The paper identifies a new failure mode in neurosymbolic systems called Verdict‑Preserving‑Unfaithfulness (VPU), where incorrect formal encodings can still pass solver checks. It introduces Generative Verification (GenV), a method that uses a language model to produce a continuous reference‑equivalence score without relying on explicit localization. Experiments show GenV+HN achieves high AUROC, generalizes to unseen translators, and improves downstream agent performance by 11.3 points.

By Vikash Singh, Debargha Ganguly, Aman Goel, Ali Torkamani, Xiaoxue Han, Joseph Lilien, Ferhat Erata, Vipin Chaudhary
arXiv Machine Learning
Oct 5

Online Verification of Language Model Responses Under Cost Constraints

The paper introduces OMVV, an online multi-verifier algorithm that maintains a pool of weak verifiers with varying costs and performance. It adaptively selects a verifier each round using an online score combiner and exponential-weights routing, providing distribution-free guarantees on false-accept and false-reject rates. Experiments on reasoning benchmarks show OMVV achieves higher accuracy at lower verification cost than any single fixed verifier across different budgets.

By Erfan Hajihashemi, Yanning Shen