Measurement Under Selection: Decoy-Calibrated Failure Audits for Language Models
Not on the map. Why?
Abstract (arXiv)
Knowing how often a language model fails does not explain where its errors concentrate. When auditors examine many explanations, the strongest observed pattern may arise by chance. We introduce Janus, a procedure for checking proposed error patterns before reporting them. Janus starts with a fixed list of yes/no properties of the examples being evaluated, such as whether the input is long. For each property, it compares the model's error rates on examples with that property and those without it. To see how large a difference can arise by chance, it repeats this calculation after shuffling the yes/no labels across examples without changing the group sizes. These shuffled properties are called decoys. A pattern is reported only if the size of its error difference meets a threshold set using decoys. On separate held-out examples, the same group must still have the higher error rate and the difference must meet a minimum, which was chosen in advance. In a controlled experiment, where the model must find a code in documents containing tables of staff, projects, and renewal codes, Janus confirms five related patterns of higher error rates on tasks requiring more lookups across tables. It also confirms a sixth pattern: lower error rates on examples with the needed information at the ends of the tables. In our samples from the MuSiQue and LongBench v2 public benchmarks, SliceLine finds groups with high error rates, while Janus reports no confirmed error patterns for the example properties we chose to test. For comparison, we use standard tests that shuffle errors and account for testing many candidates. With the same holdout check, they confirm two to six controlled patterns, depending on the test and threshold, and none on either benchmark. In simulations with no real error patterns, Janus reports false patterns more often than Benjamini-Hochberg, depending on the decoy count.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 15 of its 21 references that are in the map. First posted on arXiv 8 Jun 2026.
Builds on
15 of 21 references.
References · 15
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
- 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 916
- 2024LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitaskscited by 379
- 2022Domino: Discovering Systematic Errors with Cross-Modal Embeddingscited by 156
- 2016Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selectioncited by 121
- 2014Controlling the false discovery rate via knockoffscited by 97
- 2021The Spotlight: A General Method for Discovering Systematic Errors in Deep Learning Modelscited by 63
- 2023Statistical Inference for Fairness Auditingcited by 20
- 2025HiBug2: Efficient and Interpretable Error Slice Discovery for Comprehensive Model Debuggingcited by 11
- 2023Error Discovery by Clustering Influence Embeddingscited by 8
- 2024LADDER: Language-Driven Slice Discovery and Error Rectification in Vision Classifierscited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Selection-Aware Stress Testing for Interactive Agentscited by 0
- 2026Selection-Aware Stress Testing for Interactive Agents31 Aug 2026