OOD Score Instability Revealed by Reference Resampling
Key takeaways
- OOD scores are estimates whose stability depends on the reference set.
- "Verdict instability" quantifies this variability through reference resampling.
- Distance-based scores often assign high values to reproducible verdicts.
- Only local dispersion estimators align with practitioner expectations for OOD detection.
Who benefits
Summary
Researchers introduce "verdict instability," a metric that quantifies the variability of out-of-distribution (OOD) scores when the reference set is resampled. They show that while distance-based scores assign high values to reproducible verdicts, only local dispersion estimators align with practitioner expectations regarding OOD detection.
Why it matters
Understanding and quantifying OOD score instability is vital for building trustworthy AI systems, especially in high-stakes applications where reliable detection of novel or anomalous inputs is paramount.
How to implement this in your domain
- 1Incorporate "verdict instability" as a new metric when evaluating and deploying out-of-distribution detection systems.
- 2Analyze the reference sets used for OOD detectors to understand their impact on score stability and potential class imbalance issues.
- 3Prioritize OOD detection methods that rely on local dispersion estimators for more intuitively aligned OOD verdicts.
- 4Develop strategies for abstention or human-in-the-loop intervention based on OOD scores, considering their measured instability.
Original post by Donghoon Lee, Shinjin Kang
"arXiv:2609.00691v1 Announce Type: new Abstract: Post-hoc out-of-distribution detectors are fitted on a finite reference set, so every score they produce is an estimate. If we had chosen a different set, some verdicts would have moved. We measure that movement by resampling the re…"
View on XOriginally posted by Donghoon Lee, Shinjin Kang on X · view source
Want to go deeper?
Turn these trends into skills with Learnijoy's hands-on AI & tech courses.
Explore coursesMore in AI Research
Subspace Levenberg-Marquardt Algorithms Boost Neural Network Training
This research evaluates subspace Levenberg-Marquardt (LM) algorithms, such as KSLM and HSLM, for training neural networks on regression and classification tasks. These methods address the high computational and memory costs of classical LM, offering more efficient second-order optimization compared to first-order methods like SGD and Adam.
Neural Networks Show Varied Conceptual Separation Internally
A study examined "conceptual separation" in CNNs and LLMs, analyzing how internal activations represent concepts. It found that CNNs form coherent representations for familiar concepts, while LLMs show clear separation for distinct domains but collapse distinctions for ambiguous topics.
FCCA Boosts Low-Resource LLM Adaptation with Fewer Parameters
Researchers introduced Frozen-Core Cross-Covariance Adaptation (FCCA), a new parameter-efficient fine-tuning method that significantly improves LLM performance with a minimal trainable parameter budget. FCCA achieves results comparable to LoRA and DoRA while optimizing orders of magnitude fewer parameters by carefully selecting fixed core coordinates.