CORE: Robust OOD Detection via Orthogonal Scoring

๐กSOTA OOD detection robust across architectures via orthogonal confidence-residual split.
โก 30-Second TL;DR
What Changed
Decomposes penultimate features into orthogonal confidence and residual subspaces
Why It Matters
CORE improves OOD detection consistency across diverse models, addressing limitations of logit- and feature-based methods. Enables more reliable AI deployments in safety-critical applications.
What To Do Next
Implement CORE by decomposing your model's penultimate features and scoring orthogonal subspaces.
Key Points
- โขDecomposes penultimate features into orthogonal confidence and residual subspaces
- โขResidual carries class-specific in-distribution directional signature
- โขCombines normalized scores to mitigate independent failure modes
- โขRanks first in 3/5 benchmarks, highest average AUROC across setups
๐ง Deep Insight
Background and context from public sources โ not the original article. 9 sources cited.
๐ Enhanced Key Takeaways
- โขCORE identifies a 'directional signature' in the residual subspace (orthogonal to the predicted class weight) that remains stable for in-distribution data but deviates for OOD samples, even when those samples trigger high-confidence logits.
- โขThe method leverages the mathematical independence of orthogonal subspaces to ensure that failure modes of the confidence signal and the membership signal do not overlap, providing a safety net when one signal is compromised.
- โขEmpirical testing across ResNet, ViT, SwinV2, and DeiT architectures demonstrates that CORE maintains a high grand average AUROC (84.9%) without the architecture-specific performance degradation common in activation-shaping methods like ASH.
- โขCORE introduces a z-score normalized summation technique that allows the combination of disparate signal scales (logits vs. feature norms) without requiring manual hyperparameter tuning for each new dataset.
๐ Competitor Analysisโธ Show
| Method | Type | Computational Overhead | Key Mechanism | Benchmark Rank (Avg AUROC) |
|---|---|---|---|---|
| CORE | Post-hoc / Orthogonal | Negligible ($O(d)$) | Orthogonal Subspace Decomposition | 1st (84.9%) |
| Energy | Post-hoc / Logit | Minimal | Log-sum-exp of logits | Competitive (Baseline) |
| ReAct | Post-hoc / Activation | Minimal | Activation Truncation (Rectification) | High (Architecture Sensitive) |
| ASH | Post-hoc / Activation | Minimal | Activation Pruning/Shaping | High (Penultimate Layer only) |
| KNN | Post-hoc / Feature | High ($O(N)$) | Nearest Neighbor Distance | High (Memory Intensive) |
๐ ๏ธ Technical Deep Dive
Detailed implementation and architectural details of the CORE framework:
- Feature Decomposition: The penultimate feature vector $z$ is decomposed into $z = z_{\parallel} + z_{\perp}$, where $z_{\parallel}$ is the projection onto the weight vector $w_c$ of the predicted class $c$, and $z_{\perp}$ is the orthogonal residual.
- Subspace Scoring: The confidence score is derived from the magnitude of $z_{\parallel}$ (which directly influences the logit), while the membership score is derived from the directional consistency of $z_{\perp}$.
- Normalization Strategy: To combine these signals, CORE applies z-score normalization: $S_{combined} = \frac{S_{\parallel} - \mu_{\parallel}}{\sigma_{\parallel}} + \frac{S_{\perp} - \mu_{\perp}}{\sigma_{\perp}}$, where $\mu$ and $\sigma$ are estimated from a small held-out in-distribution validation set.
- Complexity: The operation requires only a single vector projection and two norm calculations per inference, maintaining $O(d)$ time complexity where $d$ is the feature dimension.
๐ฎ Future ImplicationsAI analysis grounded in cited sources
โณ Timeline
๐ Sources (9)
Factual claims are grounded in the sources below. Forward-looking analysis is AI-generated interpretation.
Weekly AI Recap
Read this week's curated digest of top AI events โ
๐Related Updates
AI-curated news aggregator. All content rights belong to original publishers.
Original source: ArXiv AI โ
This is a summary, not the original. Read the source, or get the weekly briefing.
Weekly AI briefing
One email a week. Unsubscribe anytime.