arXiv:cs.LG(机器学习,全量分类)· Marco Pollanen·· 9 小时前AI 评分41
模型发布门禁该有多严?测试相关性如何推高可靠性成本
The Price of Correlated Tests: How Strict Should a Model Release Gate Be?
AI 导读
研究把模型发布门禁当作设计问题:在满足既定可靠性目标的前提下保留尽可能多的好模型。在两类潜因子模型下,若两类共享同一潜相关性,更严的门禁总能提升可靠性,因此最优门禁是仍达标的最宽松门禁。测试间相关性决定代价:99% 目标在独立测试下需 8 项,潜相关性 0.3 时需 74 项,0.5 时需 5,182 项,此时不足十分之一的好模型被保留。
正文
Abstract:Before a machine learning model ships, it often has to pass a suite of automated tests. Requiring every test to pass looks safe, yet it can reject many models that would have served users well, and it does not say how trustworthy a passing model actually is. We treat the release gate as a design problem: choose how many tests a model must pass so that cleared models meet a stated reliability target, while keeping as many good models as possible. A two-class latent-factor model makes both costs explicit and reduces each calculation to a one-dimensional integral. We prove that when both classes share the same latent correlation, a stricter gate always raises reliability, so the gate that keeps the most good models is the most lenient one that still meets the target. Under pass-all gating, any reliability target short of perfection is attainable within the model, but the share of good models kept tends to zero as the suite grows. Correlation between tests sets the price. In one configuration, a 99 percent target needs 8 independent tests, but 74 tests at a latent correlation of 0.3 and 5,182 at 0.5, where the gate keeps fewer than one good model in ten. We also give a validation procedure, built on exact binomial bounds, that certifies a gate from labelled data even when the gate is chosen from a fixed shortlist.
| Comments: | 6 pages, 1 figure, 4 tables. Submitted to ACDSA 2027 |
| Subjects: | Machine Learning (stat.ML); Machine Learning (cs.LG); Methodology (stat.ME) |
| MSC classes: | 62P30, 62F25, 62H25 |
| ACM classes: | I.2.6; G.3; D.2.5 |
| Cite as: | arXiv:2610.00993 [stat.ML] |
| (or arXiv:2610.00993v1 [stat.ML] for this version) | |
| https://doi.org/10.48550/arXiv.2610.00993 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Marco Pollanen [view email]
[v1]
Thu, 1 Oct 2026 03:27:54 UTC (98 KB)
来源:arXiv:cs.LG(机器学习,全量分类) · arxiv.org