GRIT: Out-of-Distribution Robustness from Finite and Noisy Invariant Pairs
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2606. 16050v1 Announce Type: cross Abstract: Robust deep learning under heavy-tailed and impulsive noise remains challenging because conventional losses such as mean squared error (MSE) exhibit unbounded sensitivity to outliers.
arXiv:2610.33063v1 Announce Type: cross Abstract: Deployed vision models auto-accept confident predictions, so high-confidence errors propagate silently. Maximum Softmax Probability (MSP), the standa...
arXiv:2408. 01139v4 Announce Type: replace Abstract: Perturbation robustness evaluates the vulnerabilities of models, arising from a variety of perturbations, such as data corruptions and adversarial attacks.
The paper introduces SR‑BEVS, a sparse recovery learning technique that enhances both clean accuracy and robustness to real‑world corruptions for camera‑based bird’s‑eye view (BEV) 3D object detection models. By pruning weights based on magnitude, generating diverse sparse models, retraining them with varied learning rates, and averaging the recovered models into a single dense model, the method achieves up to 33.8% improvement in corruption robustness and a 1.8% gain in clean accuracy over the Fast‑BEV baseline on the nuScenes dataset. The approach adds no inference overhead and preserves a connected low‑loss basin, suggesting applicability to other BEV models.
arXiv:2606. 01723v1 Announce Type: cross Abstract: Real-world regression often exhibits shortcuts: attributes that are spuriously correlated with continuous targets in training, yet unreliable under deployment shifts; regressing targets using such shortcuts may fail catastrophically at test time.
The paper introduces CLEAR, a lightweight, task‑agnostic post‑hoc method that enhances evidential robustness in deep learning models without retraining. CLEAR uses held‑out calibration data to map the geometry of the model’s latent space, then generates perturbation views at inference to detect latent conflict. When high conflict is found, CLEAR selectively reduces evidential strength while preserving evidence for latent‑consistent inputs, achieving significant improvements in OOD and adversarial AUROC on ImageNet→CUB and running much faster than competing methods.