RG-TTA: Regime-Guided Meta-Control for Test-Time Adaptation in Streaming Time Series

• URL: http://arxiv.org/abs/2603.27814v1
• Date: Sun, 29 Mar 2026 18:57:34 GMT
• Title: RG-TTA: Regime-Guided Meta-Control for Test-Time Adaptation in Streaming Time Series
• Abstract summary: Test-time adaptation (TTA) enables neural forecasters to adapt to distribution shifts in streaming time series.<n>We propose Regime-Guided Test-Time Adaptation (RG-TTA), a meta-controller that continuously modulates adaptation intensity based on distributional similarity to previously-seen regimes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Test-time adaptation (TTA) enables neural forecasters to adapt to distribution shifts in streaming time series, but existing methods apply the same adaptation intensity regardless of the nature of the shift. We propose Regime-Guided Test-Time Adaptation (RG-TTA), a meta-controller that continuously modulates adaptation intensity based on distributional similarity to previously-seen regimes. Using an ensemble of Kolmogorov-Smirnov, Wasserstein-1, feature-distance, and variance-ratio metrics, RG-TTA computes a similarity score for each incoming batch and uses it to (i) smoothly scale the learning rate -- more aggressive for novel distributions, conservative for familiar ones -- and (ii) control gradient effort via loss-driven early stopping rather than fixed budgets, allowing the system to allocate exactly the effort each batch requires. As a supplementary mechanism, RG-TTA gates checkpoint reuse from a regime memory, loading stored specialist models only when they demonstrably outperform the current model (loss improvement >= 30%). RG-TTA is model-agnostic and strategy-composable: it wraps any forecaster exposing train/predict/save/load interfaces and enhances any gradient-based TTA method. We demonstrate three compositions -- RG-TTA, RG-EWC, and RG-DynaTTA -- and evaluate 6 update policies (3 baselines + 3 regime-guided variants) across 4 compact architectures (GRU, iTransformer, PatchTST, DLinear), 14 datasets (6 real-world multivariate benchmarks + 8 synthetic regime scenarios), and 4 forecast horizons (96, 192, 336, 720) under a streaming evaluation protocol with 3 random seeds (672 experiments total). Regime-guided policies achieve the lowest MSE in 156 of 224 seed-averaged experiments (69.6%), with RG-EWC winning 30.4% and RG-TTA winning 29.0%. Overall, RG-TTA reduces MSE by 5.7% vs TTA while running 5.5% faster; RG-EWC reduces MSE by 14.1% vs standalone EWC.

Related papers

• On the Design of Qwen3.8-Next Architecture: Evaluation, Efficiency, and Training Stability [57.03393882933515]
  We describe the architecture and ablations of Qwen3.8-Flash-Next, a sparse mixture-of-experts model with 125B parameters, 6B activated per token, and 51B parameters of n-gram embedding tables held off the accelerator.<n>On fourteen pre-training benchmarks the model leads the 397B-A17B predecessor on eight and trails it on the rest by at most 2.6 points, at 1/3 the activated parameters, 1/3 the training tokens, and roughly 1/9 the training FLOPs.
  arXiv  Detail & Related papers  (2026-08-31T06:35:07Z)
• DG-FedReuse: Proxy-Gradient-Gated Cached-Update Reuse with Matched Sparse Uplink Accounting [0.0]
  DG-FedReuse is a simulator-level mechanism that allows selected clients to contribute cached updates.<n>Experiments cover six image-classification datasets, 50 virtual clients, Dirichlet label clients, and three seeds.<n> DG-FedReuse yields 83.36-85.42% modeled update-data-field uplink saving, compared with 76.88% for matched Top-K FedAvg.
  arXiv  Detail & Related papers  (2026-08-05T19:30:04Z)
• ReBRAC-v2: The Return of the King [9.34711333978267]
  We introduce ReBRAC-v2, which directly trains an exact-likelihood normalizing flow as the RL actor.<n>Rather than tuning this recipe separately for every task, we develop a single shared configuration.<n>Across ten common state-based OGBench categories, ReBRAC-v2 averages 74.8 compared to 52.3 for the next-best aggregate result.
  arXiv  Detail & Related papers  (2026-08-02T12:42:20Z)
• A Framework for Early Sepsis Prediction via Self-Supervised (JEPA) and Federated Representation Learning [0.0]
  Early sepsis prediction from electronic health records is challenged by irregular sampling, high missingness, and class imbalance.<n>We show that self-supervised pretraining with task-aware fine-tuning yields features that are both sharp near onset and robust across prediction horizons.
  arXiv  Detail & Related papers  (2026-07-18T07:27:04Z)
• RAVEN: A Regime-Aware Variable-context Expert Network for Financial Time Series Forecasting [83.06074370551887]
  A fixed context window is mismatched to the time-varying optimal look-back of non-stationary price processes.<n>We propose a Mixture-of-Experts framework designed to adaptively determine the temporal context for each input sample.<n> Experiments on cumulative log-return prediction (HS300, S&P500) and fund sales forecasting demonstrate that RAVEN achieves SOTA performances, improves Pearson correlation by 9.2% on HS300 and 20.2% on S&P500, and reduces MSE by 18.2% on fund sales forecasting.
  arXiv  Detail & Related papers  (2026-06-23T02:11:04Z)
• SPLICE: Latent Diffusion over JEPA Embeddings for Conformal Time-Series Inpainting [0.5076419064097734]
  Generative models for time-series imputation achieve strong reconstruction accuracy, yet provide no finite-sample reliability guarantees.<n>We introduce SPLICE, a modular framework coupling latent generative imputation with distribution-free, online-adaptive prediction intervals.<n>A pooled JEPA encoder trained on nine feeds transfers to four unseen domains, matching or exceeding per-dataset oracles with only a quick bridge fine-tuning.
  arXiv  Detail & Related papers  (2026-04-30T18:27:08Z)
• Learning Rate Engineering: From Coarse Single Parameter to Layered Evolution [11.642796814179926]
  We systematize learning rate scheduling into five generations: (Gen1) global fixed learning rates, (Gen2) global scheduling, (Gen3) parameter-level adaptation, (Gen4) layer-level differentiation, and (Gen5) joint layer-time scheduling.<n>We propose Discriminative Adaptive Layer Scaling (DALS), a unified framework that integrates phase-adaptive cosine scheduling, depth-aware Grokfast filtering, and LARS-style trust ratios into a single coherent gradient.<n>We benchmark 18 strategies including three DALS variants across all five generations on five datasets: synthetic, CIFAR-10 (from scratch), RTE
  arXiv  Detail & Related papers  (2026-04-30T01:13:48Z)
• TEMPO: Scaling Test-time Training for Large Reasoning Models [87.61789183311856]
  Test-time training (TTT) adapts model parameters on unlabeled test instances during inference time.<n>We propose TEMPO, a TTT framework that interleaves policy refinement on unlabeled questions with periodic critic recalibration on a labeled dataset.
  arXiv  Detail & Related papers  (2026-04-21T10:01:04Z)
• Adaptive Regime-Aware Stock Price Prediction Using Autoencoder-Gated Dual Node Transformers with Reinforcement Learning Control [1.2362187555287152]
  Existing approaches treat all market states uniformly or require manual regime labeling, which is expensive and quickly becomes stale as market dynamics evolve.<n>This paper introduces an adaptive prediction framework that adaptively identifies deviations from normal market conditions and routes data through specialized prediction pathways.<n> Experiments on 20 S&P 500 stocks spanning 1982 to 2025 demonstrate that the proposed framework achieves 0.68% MAPE for one-day predictions without the reinforcement controller and 0.59% MAPE with the full adaptive system.
  arXiv  Detail & Related papers  (2026-03-19T16:55:33Z)
• A Controlled Comparison of Deep Learning Architectures for Multi-Horizon Financial Forecasting: Evidence from 918 Experiments [0.0]
  Multi-horizon price forecasting is central to portfolio allocation, risk management, and algorithmic trading.<n>Deep learning architectures have proliferated faster than rigorous financial benchmarks can evaluate them.<n>ModernTCN achieves the best mean rank (1.333) with a 75 percent first-place rate, followed by PatchTST (2..000)
  arXiv  Detail & Related papers  (2026-02-27T03:27:04Z)
• Regularized Meta-Learning for Improved Generalization [0.0]
  Regularized meta-learning is a stable and deployment-efficient stacking strategy for high-dimensional ensemble systems.<n>A four-stage pipeline combines redundancy-aware projection, statistical meta-feature augmentation, and cross-validated regularized meta-models.<n>On the Playground Series S6E1 benchmark, the proposed framework achieves an out-of-fold RMSE of 8.582, improving over simple averaging (8.894) and conventional Ridge stacking (8.627), while matching greedy hill climbing (8.603) with substantially lower runtime (4 times faster)
  arXiv  Detail & Related papers  (2026-02-12T22:55:32Z)
• Towards a Science of Scaling Agent Systems [79.64446272302287]
  We formalize a definition for agent evaluation and characterize scaling laws as the interplay between agent quantity, coordination structure, modelic, and task properties.<n>We derive a predictive model using coordination metrics, that cross-validated R2=0, enabling prediction on unseen task domains.<n>We identify three effects: (1) a tool-coordination trade-off: under fixed computational budgets, tool-heavy tasks suffer disproportionately from multi-agent overhead, and (2) a capability saturation: coordination yields diminishing or negative returns once single-agent baselines exceed 45%.
  arXiv  Detail & Related papers  (2025-12-09T06:52:21Z)
• One Size Does Not Fit All: Architecture-Aware Adaptive Batch Scheduling with DEBA [9.344832445480415]
  We introduce DEBA, an adaptive batch scheduler that monitors gradient variance, gradient norm variation and loss variation.<n>We demonstrate that the architecture fundamentally determines adaptation efficacy.
  arXiv  Detail & Related papers  (2025-11-05T19:19:39Z)
• Exploring Wavelet Transformations for Deep Learning-based Machine Condition Diagnosis [0.0]
  This research transforms time-series current signals into time-frequency 2D representations via Wavelet Transform. The study employs five WT-based techniques: WT-Amor, WT-Bump, WT-Morse, WSST-Amor, and WSST-Bump. The DL models for WT-Amor, WT-Bump, and WT-Morse showed remarkable effectiveness with peak model accuracy of 90.93, 89.20, and 93.73%, respectively.
  arXiv  Detail & Related papers  (2024-08-19T02:06:33Z)
• ERNIE-SPARSE: Learning Hierarchical Efficient Transformer Through Regularized Self-Attention [48.697458429460184]
  Two factors, information bottleneck sensitivity and inconsistency between different attention topologies, could affect the performance of the Sparse Transformer. This paper proposes a well-designed model named ERNIE-Sparse. It consists of two distinctive parts: (i) Hierarchical Sparse Transformer (HST) to sequentially unify local and global information, and (ii) Self-Attention Regularization (SAR) to minimize the distance for transformers with different attention topologies.
  arXiv  Detail & Related papers  (2022-03-23T08:47:01Z)
• Sequence Transduction with Graph-based Supervision [96.04967815520193]
  We present a new transducer objective function that generalizes the RNN-T loss to accept a graph representation of the labels. We demonstrate that transducer-based ASR with CTC-like lattice achieves better results compared to standard RNN-T.
  arXiv  Detail & Related papers  (2021-11-01T21:51:42Z)
• Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging [48.99717153937717]
  We present WAGMA-SGD, a wait-avoiding subgroup that reduces global communication via weight exchange.<n>We train ResNet-50 on ImageNet; Transformer for machine translation; and deep reinforcement learning for navigation at scale.<n>Compared with state-of-the-art decentralized SGD variants, WAGMA-SGD significantly improves training throughput.
  arXiv  Detail & Related papers  (2020-04-30T22:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.