arXiv (All)
open access
Better Policies, Worse Verifier Audits
Verifier stacks increasingly sit inside post-training and test-time compute loops. We study a specific control loop: a component verifier is evaluated on fresh policy outputs against the full success label and refreshed when that aggregate score falls. For a conjunctive target $y = F \wedge M$, its
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Align Before You Combine: Reference Space Calibration for Supervision Without Ground Truth#1233564
- StableJudge: A Lightweight Adversarial Defense Framework for LLM-as-a-Judge#1341697
- Dataset Inference for Data Provenance and Privacy Auditing in Tabular Foundation Models#1388844
- Learning Proportional Committees from Violation Feedback#799339
- Learning Proportional Committees from Violation Feedback#797916
Record · ID 1413270
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive