Skip to content

Subspace Optimization for Backpropagation-Free Continual Test-Time Adaptation

Mar 2026 · arXiv.org · Vol abs/2603.28678 · 1 citation · 41 references
Computer Science

TL;DR

PACE is introduced, a backpropagation-free continual test-time adaptation system that directly optimizes the affine parameters of normalization layers that achieves state-of-the-art accuracy across multiple benchmarks under continual distribution shifts, reducing runtime by over 50% compared to existing backpropagation-free methods.

Abstract

We introduce PACE, a backpropagation-free continual test-time adaptation system that directly optimizes the affine parameters of normalization layers. Existing derivative-free approaches struggle to balance runtime efficiency with learning capacity, as they either restrict updates to input prompts or require continuous, resource-intensive adaptation regardless of domain stability. To address these limitations, PACE leverages the Covariance Matrix Adaptation Evolution Strategy with the Fastfood projection to optimize high-dimensional affine parameters within a low-dimensional subspace, leading to superior adaptive performance. Furthermore, we enhance the runtime efficiency by incorporating an adaptation stopping criterion and a domain-specialized vector bank to eliminate redundant computation. Our framework achieves state-of-the-art accuracy across multiple benchmarks under continual distribution shifts, reducing runtime by over 50% compared to existing backpropagation-free methods.

View source

Similar papers

#machine learning Preprint Oct 2026

MuLoRA: Spectrally Balanced Low-Rank Adaptation for Continual Learning

A historical whitening identifies input directions with strong current-task response relative to accumulated historical response, yielding a task-adaptive basis that remains fixed during training, and an orthonormal basis connects these mechanisms by transferring the factor-update spectrum exactly to the induced weight...

Jun-Kang Liu · 1 citation
#machine learning Preprint Oct 2026

RoSA: Rotational Sparse Adaptation for Memory-Efficient Fine-Tuning

Parameter-efficient fine-tuning (PEFT) reduces the cost of adapting foundation models by focusing training on a small parameter subset. Complementary to this idea, we introduce RoSA (Rotational Sparse Adaptation), which narrows adaptation to a subset of layers at a time. RoSA freezes lower layers close to the input thr...

Muhammad Azeem Lodhi, Chao Zhou, Rebekka Burkholz · 0 citations
#machine learning Preprint Aug 2026

Normalized Low-Rank Adaptation

Normalized Low-Rank Adaptation (NoRA) is introduced, a simple yet effective method that normalizes the down-projection matrices during training, improving standard LoRA without requiring repeated normalization throughout training.

Jia-Le Kang, Zi-Yin Yue, Zheng Zhan et al. · 0 citations
Sep 2026

Gradient-coupled continual backpropagation: dynamic plasticity control for nonstationary data streams

This work proposes Gradient-Coupled Continual Backpropagation (G-CBP), which modulates layer-wise replacement rates from normalized gradient norms and constrains early turnover through an Adaptive Moving Envelope, and identifies an empirical reconstruction–perturbation relationship.

Wei-Bang Zhou, Xiang-Sheng Huang, Xiao Yang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Selective Backpropagation for Efficient Few-Shot Class-Incremental Learning

Few-Shot Class-Incremental Learning (FSCIL) requires models to continuously learn new classes from limited samples while retaining prior knowledge, under strict constraints on compute and memory. Existing approaches lie along a difficult trade-off: simple fine-tuning is computationally efficient but suffers from catast...

Eeham Khan, Abdulmoumen Al-Atrash, Ali Ayub · 0 citations

Related blog posts

Microsoft Research Blog Nov 3, 2026

Learn the rules: The hacker mindset

Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.

Google DeepMind Blog Nov 3, 2026

Agentic cheminformatics with Google Antigravity

Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.

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