Skip to content
Preprint

GramLoop: Training-Free Gram-Gated Replay for Robust Dense Prediction

Aug 2026 · 0 citations · 28 references
Computer Science

TL;DR

GramLoop is introduced, a training-free framework that replays a short transformer window and controls each replay through final-layer cosine-Gram consistency, which improves object detection and semantic segmentation under corruptions, perturbations, and natural shifts.

Abstract

We aim to improve frozen DINOv3 dense-prediction models under distribution shift by adding inference computation inside the visual backbone, without changing model weights, task adapters, or prediction heads. The challenge is that repeated transformer-block computation must refine dense features without disrupting the pairwise patch relations that DINOv3 uses to preserve spatial structure. We introduce GramLoop, a training-free framework that replays a short transformer window and controls each replay through final-layer cosine-Gram consistency. Each proposal is propagated through the frozen suffix, measured against the standard DINOv3 trajectory, and accepted through a patchwise gate at the replay-window endpoint. Across object detection and semantic segmentation under corruptions, perturbations, and natural shifts, GramLoop improves all five shifted benchmarks over the paired DINOv3 baseline. On COCO-O, it improves mAP by +0.252 and Effective Robustness by +0.250, while preserving clean ADE20K performance. Code will be released at https://github.com/cheyan9/GramLoop.

View source

Similar papers

Preprint Aug 2026

Support Operation Factorization: Compositional Readout of Frozen Vision Encoders under Controlled Interventions

An injectively aligned leave-one-cell-out protocol over support x operation grids and SO-OPF, a readout that factors cell energy into support salience and a competitive operation posterior, and a readout that factors cell energy into support salience and a competitive operation posterior are introduced.

Zhong-Yao Wang, Wan-Li Ouyang, Tao-Yong Cui et al. · 0 citations
Conference Open access Sep 2026

History Doesn’t Repeat, but Its Patterns Echo: A Parallel Pairwise Negative-Sampling Framework for Temporal Link Prediction

This paper proposes ATNSF, a temporal graph learning framework with a hybrid negative sampling strategy that uses a portion of historical edges as hard negatives and introduces a pairwise sampled softmax loss that contrasts each positive instance with a batch of negatives to learn more discriminative representations.

Yong-Chun Jiang, Heng Zhang, Jian Gao et al. · 0 citations
#machine learning Preprint Sep 2026

UE5M3 FP4 Block Scaling for Stable Language Model Pretraining

Stable 4-bit floating-point (FP4) pretraining is difficult because the E2M1 payload represents only a narrow range of magnitudes. NVIDIA's Transformer Engine \nv{} recipe addresses this with current-tensor scaling, a randomized Hadamard transform (RHT), and bfloat16 (BF16) final layers, adding work outside the FP4 matr...

R. Hu, Carlo Luschi, Paul Balanca · 1 citation
#small language model Preprint Aug 2026

SHIFT-LLM: Distribution Shift Correction in Depth-Pruned LLMs

SHIFT-LLM, a training-free post-pruning correction framework that inserts a Linear Residual Adapter at each pruning site, consistently recovers accuracy lost to depth pruning across most configurations, achieving gains up to +15.7 points on Llama-3.1-8B-Instruct.

Ali Bahri, Hang Li, Hongliang Li et al. · 0 citations
Preprint Aug 2026

Cut-ViT: Task-Specific Model Pruning via Gram Anchoring Subspace Consistency

This work proposes a task-specific pruning pipeline, named Cut-ViT, which first construct gram anchoring matrices from both spatial and semantic perspectives, and performs the subspace decomposition to extract the corresponding subspace bases.

Jianjian Yin, Liulei Li, Tao Chen et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.