aiqbench analysis
This research introduces MICRO, an active search framework designed to optimize the allocation of annotation budgets between costly strong feedback and cheaper quality ratings for detecting severe errors in machine learning models. By jointly modeling these feedback types and using clustering with rollout estimation, the method significantly improves error discovery rates compared to existing policies across various budget constraints. The work addresses a critical efficiency challenge in aligning AI systems by maximizing the detection of high-severity failures without exhausting limited human evaluation resources.
MICRO: Multi-Fidelity Active Search for Severe Error Discovery
arXiv:2609.26025v1 Announce Type: new Abstract: Human feedback can vary in cost and informativeness. Strong feedback can reveal severe errors but is costly, so cheaper quality ratings can help decide which items to annotate. We propose MICRO (Multi-Fidelity Impact Clustered Rollout), an active search framework that allocates a shared budget to these feedback types to maximise confirmed severe error discoveries. MICRO jointly models ratings and annotation losses conditional on item features to steer acquisition. It clusters acquisitions by their predicted impact on severity probabilities to select diverse candidates, then uses rollout to estimate their discovery value. Experiments on WMT20 English-German show that ratings improve both loss reconstruction and severity prediction. MICRO achieves the highest mean discovery count across four budget and rating cost settings, with similar performance to adapted MF-ENS in one and significant gains over all six comparison policies, including two rollout controls, in the other three $(p<.001)$.
Abstract:Human feedback can vary in cost and informativeness. Strong feedback can reveal severe errors but is costly, so cheaper quality ratings can help decide which items to annotate. We propose MICRO (Multi-Fidelity Impact Clustered Rollout), an active search framework that allocates a shared budget to these feedback types to maximise confirmed severe error discoveries. MICRO jointly models ratings and annotation losses conditional on item features to steer acquisition. It clusters acquisitions by their predicted impact on severity probabilities to select diverse candidates, then uses rollout to estimate their discovery value. Experiments on WMT20 English-German show that ratings improve both loss reconstruction and severity prediction. MICRO achieves the highest mean discovery count across four budget and rating cost settings, with similar performance to adapted MF-ENS in one and significant gains over all six comparison policies, including two rollout controls, in the other three $(p<.001)$.
Machine Learning (cs.LG); Computation and Language (cs.CL)
arXiv:2609.26025 [cs.LG]
(or arXiv:2609.26025v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.26025 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 241 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026

The Two-Century Path That Made Quantum Computing Inevitable
Quantum Computing Report · Sep 28, 2026

[AINews] not much happened today
Latent Space · Sep 10, 2026

[AINews] not much happened today
Latent Space · Sep 18, 2026