arXiv AI

Adaptive Contracts for Cost-Effective AI Delegation

arXiv:2603. 17212v2 Announce Type: replace-cross Abstract: When organizations delegate text generation tasks to AI providers via pay-for-performance contracts, expected payments rise when evaluation is noisy.

arXiv AI
Jun 4

Can Generalist Agents Automate Data Curation?

arXiv:2606. 04261v1 Announce Type: new Abstract: Curating training data is among the most consequential yet labor-intensive parts of modern AI development: practitioners iteratively propose, implement, evaluate, and revise data policies against noisy benchmark feedback.

By Feiyang Kang, Hanze Li, Adam Nguyen, Mahavir Dabas, Jiaqi W. Ma, Frederic Sala, Dawn Song, Ruoxi Jia
arXiv Computation and Language
Aug 27

AutoVerifier: Residual-Guided Non-Parametric Optimization for Reference-Based Answer Verification

AutoVerifier is a residual‑guided, non‑parametric optimization framework designed to improve reference‑based answer verification. It learns verifier inductive biases from recurring errors, records them as rule cards, and promotes them to code modules or prompt guidance only after replay validation ensures no regressions. Experiments on four verifier benchmarks show that AutoVerifier surpasses state‑of‑the‑art verifiers by a large margin.

By Zebei Zhao, Zhihao Shi, Minqi Shi
Hugging Face Trending Papers
Jun 3

Self-Evolving Deep Research via Joint Generation and Evaluation

Large Language Models (LLMs) have become increasingly adopted in daily applications, with deep research standing out as a particularly important capability. Unlike traditional question-answering (QA) tasks, deep research report generation lacks definitive ground-truth, making reward design inherently unverifiable and limiting effective reinforcement learning.

arXiv AI
Sep 15

CHAI for LLMs: Improving Code-Mixed Translation in Large Language Models through Reinforcement Learning with AI Feedback

CHAI for LLMs is a framework that improves large language models’ performance on code‑mixed translation tasks by using LLMs as annotators to create preference data, applying reinforcement learning from AI feedback, incorporating LLM‑generated domain knowledge for iterative refinement, and evaluating on real‑world datasets. The approach yields a 68.45% average win rate over state‑of‑the‑art open‑source models in human‑adjudicated tests. It demonstrates a scalable method to enhance code‑mixed language understanding in open‑source LLMs.

By Wenbo Zhang, Aditya Majumdar, Asif Ekbal, Amulya Yadav