arXiv Machine Learning

How Many Categories Are Enough? Distribution-Free Certification Limits for Few-Shot Anomaly Thresholds

The paper investigates how many normal samples are required to reliably set an alarm threshold for few‑shot anomaly detectors, focusing on distribution‑free certification limits. Using a frozen DINOv2 PCA residual ranker on 15 MVTec and 12 VisA categories, the authors show that simple leave‑one‑image‑out calibration is limited by resolution and shift, leading to empirical false‑alarm rates far above the nominal level. They derive a category‑count feasibility calculus, demonstrating that at least 14, 29, and 59 independent category draws are needed for 95% upper confidence bounds at α=0.20, 0.10, and 0.05, and propose the CRESS protocol to split source categories into reference, proposal, and certification roles. whyItMatters":"The study provides concrete numerical thresholds for the amount of source evidence needed to guarantee reliable anomaly detection in new categories, informing practical deployment of few‑shot detectors."

arXiv Computer Vision
Sep 4

SafeRestore: Detector-Relative Risk Certificates for Selective Industrial Image Restoration

SafeRestore introduces a framework for certifying when an industrial image restoration should be automatically returned to a detector or require human review. It ranks five restoration candidates using action‑specific fitted scores, selects a threshold gate on tuning data, and evaluates the gate on a separate certification sample with two one‑sided exact binomial bounds—one for evidence‑loss incidents and one for excess‑activation incidents. In a retrospective study of 4,591 Carinthia‑S images, the protocol demonstrates auditable risk‑coverage behavior, with varying pass rates across different policies and morphologies.

By Shaoliang Yang, Jun Wang
arXiv Machine Learning
Sep 11

A distribution-free certification framework for trustworthy crash-severity prediction

The paper introduces a distribution‑free certification layer that can be applied to any crash‑severity prediction model without modifying the model itself. It provides guarantees for ordinal outcomes, per‑class validity, transfer of coverage to unobserved severities, and one‑sided certificates under deployment shift, all grounded in a functional of the true data law. The framework is evaluated on 5.2 million Texas records, demonstrating a model‑independent lower bound on set width for vulnerable road users and is released as an open‑source package with theorem‑level tests.

By Amir Rafe, Subasish Das
arXiv AI
Sep 1

Benchmark Contamination: A Taxonomy Organized by Defeated Mitigation

The paper introduces a new taxonomy for benchmark contamination that categorizes leakage by the mitigation it defeats—direct, derivative, temporal, distributional, and acquired—covering both training‑time and evaluation‑time scenarios. It proposes a four‑field disclosure protocol to record contamination status alongside benchmark scores, and provides a JSON schema, validator, and examples. An empirical study of 41 documents using a pre‑registered instrument shows limited reporting of contamination types and variable reliability, highlighting gaps in current disclosure practices.

By Johanna Angulo, V\'ictor Yeste, Hector Espinos-Morato
arXiv Machine Learning
Sep 24

When Accuracy Gaps Fail to Certify: Auditing Cross-Domain Recalibration of LLM Judges

The study examines whether accuracy gaps between source and target tasks can certify the failure of scalar recalibration maps for large language model judges. Across thirteen judges, two generators, eight domains, and 1,176 transfers, the accuracy gap only provides a weak lower bound on target calibration error and can predict opposite outcomes. Even with a finite‑sample lower certificate, the method shows low power (0.13) and does not reliably indicate when recalibration will fail.

By Fariya Afrin, Ibne Farabi Shihab