Local Reference Geometry Residual Augmentation for Imbalanced Time Series Classification

• URL: http://arxiv.org/abs/2609.00093v1
• Date: Mon, 31 Aug 2026 13:50:40 GMT
• Title: Local Reference Geometry Residual Augmentation for Imbalanced Time Series Classification
• Abstract summary: Local Reference Geometry (LRG) is a lightweight feature augmentation module for time series classification.<n>LRG measures local exposure and class-mixture risk, then augments each fixed feature with a standardized signed displacement from nearby training geometry.<n>On controlled UCR/Bake Off Redux imbalance benchmarks, paired raw--LRG comparisons show gains for learned, pretrained, and fixed representations.
• Score: 2.9276026564633617
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Imbalanced time series classification is often addressed by changing the training distribution, objective, logits, or final threshold. These interventions address important biases, yet leave a representation-level question unmeasured: after minority support is reduced, does a learned feature space remain locally reliable around minority regions? We identify a training-local geometry failure: under imbalance, minority cases can lie in sparse, rest-dominated, or mixed feature-space neighborhoods, even when the representation retains useful global class structure. To diagnose and repair this failure, we propose Local Reference Geometry (LRG), a lightweight post-hoc feature augmentation module applied between a fixed feature extractor and the classifier head. Using training features only, LRG measures local exposure and class-mixture risk, then augments each fixed feature with a standardized signed displacement from nearby training geometry and an LDA-projected residual summary. On controlled UCR/Bake Off Redux imbalance benchmarks, paired raw-versus-LRG comparisons show gains for learned, pretrained, and fixed representations, including when LRG is combined with training-level interventions and post-encoder classifier corrections. Ablations show that the gain comes from the signed local residual appended to the original feature, rather than from generic prototype distances, affinity features, scalar statistics, or VLAD-style codes. Further analyses support the proposed local-geometry failure hypothesis: minority neighborhoods become increasingly rest-exposed under imbalance, training-local risk identifies error-prone regions, and LRG gains concentrate in those high-risk regions.

Related papers

• FairReL: Deepfake Detection using Fairness-Aware Representation Learning [13.693865200913741]
  We propose a fairness-aware representation-learning framework that targets subgroup-sensitive components.<n>FairReL uses an SVD-decomposed foundation-model backbone to isolate the fine-tuning-induced residual representation.<n>Experiments on FF++, Celeb-DF, DFD and DFDC show that, against the state-of-the-art fairness-aware detector, FairReL improves unseen-dataset AUC by 3.9% while reducing subgroup FPR disparity by 10.2%.
  arXiv  Detail & Related papers  (2026-08-28T18:34:15Z)
• Estimating Rare Events in Language Models with Proper Evaluation [16.1901795614153]
  We introduce Gradient Activation Adaptive Multi-Level Splitting (GA-AMLS)<n>GA-AMLS adapts rare-event Monte Carlo methods to the continuous activation space of language models.<n>We also propose the Shifted-Power Bregman (SPB) Loss, a proper scoring rule that remains finite for zero-estimates.
  arXiv  Detail & Related papers  (2026-07-20T19:07:43Z)
• How Useful is Causal Invariance for Domain Adaptation in Finite-Sample Settings? [58.740078141879984]
  Machine learning models often degrade when they are deployed on a target distribution that differs from the source distributions they were trained on.<n>Recent work in causality-based domain generalization has shown how shared causal structure can induce invariant predictors.<n>In this paper, we study when full or partial causal knowledge can provably improve supervised domain adaptation.
  arXiv  Detail & Related papers  (2026-06-10T21:07:49Z)
• When Do Local Score Models Extrapolate Across Size? A Diagnostic Theory and Benchmark [0.0]
  We show that architectural locality alone does not guarantee stable size extrapolation.<n>We formalize this mechanism, proving a size-uniform comparison theorem for local marginals.<n> Empirically, we validate the interplay between spatial mixing, smoothed-score quasi-locality, and model receptive fields.
  arXiv  Detail & Related papers  (2026-06-08T16:24:31Z)
• Representation Collapse in Sequential Post-Training of Large Language Models [17.437127662981847]
  We study whether sequential post-training gradually compresses internal representations into low-rank, anisotropic, and homogeneous feature spaces.<n>We analyze supervised fine-tuning, preference optimization, safety/refusal tuning, math and code specialization, and long chain-of-thought tuning under controlled stage orderings.
  arXiv  Detail & Related papers  (2026-05-28T19:59:17Z)
• Calibrating Biased Distribution in VFM-derived Latent Space via Cross-Domain Geometric Consistency [52.52950138164424]
  We show that when leveraging the off-the-shelf (vision) foundation models for feature extraction, the geometric shapes of the resulting feature distributions exhibit remarkable transferability across domains and datasets.<n>We embody our geometric knowledge-guided distribution calibration framework in two popular and challenging settings: federated learning and long-tailed recognition.<n>In long-tailed learning, it utilizes the geometric knowledge transferred from sample-rich categories to recover the true distribution for sample-scarce tail classes.
  arXiv  Detail & Related papers  (2025-08-19T05:22:59Z)
• Local-consistent Transformation Learning for Rotation-invariant Point Cloud Analysis [61.04787144322498]
  We propose a Local-consistent Transformation (LocoTrans) learning strategy for point shape analysis. We first construct the local-consistent reference frame (LCRF) by considering the symmetry of the two axes in LRF. As the consistency only exists in local regions, the relative pose information is still lost in the intermediate layers of the network.
  arXiv  Detail & Related papers  (2024-03-17T06:40:50Z)
• Combating Representation Learning Disparity with Geometric Harmonization [50.29859682439571]
  We propose a novel Geometric Harmonization (GH) method to encourage category-level uniformity in representation learning. Our proposal does not alter the setting of SSL and can be easily integrated into existing methods in a low-cost manner.
  arXiv  Detail & Related papers  (2023-10-26T17:41:11Z)
• Proposal Distribution Calibration for Few-Shot Object Detection [65.19808035019031]
  In few-shot object detection (FSOD), the two-step training paradigm is widely adopted to mitigate the severe sample imbalance. Unfortunately, the extreme data scarcity aggravates the proposal distribution bias, hindering the RoI head from evolving toward novel classes. We introduce a simple yet effective proposal distribution calibration (PDC) approach to neatly enhance the localization and classification abilities of the RoI head.
  arXiv  Detail & Related papers  (2022-12-15T05:09:11Z)
• Center Prediction Loss for Re-identification [65.58923413172886]
  We propose a new loss based on center predictivity, that is, a sample must be positioned in a location of the feature space such that from it we can roughly predict the location of the center of same-class samples. We show that this new loss leads to a more flexible intra-class distribution constraint while ensuring the between-class samples are well-separated.
  arXiv  Detail & Related papers  (2021-04-30T03:57:31Z)
• Deep Interpretable Classification and Weakly-Supervised Segmentation of Histology Images via Max-Min Uncertainty [25.429124017422385]
  Weakly-supervised learning (WSL) has recently triggered substantial interest as it mitigates the lack of pixel-wise annotations. We propose novel regularization terms, which enable the model to seek both non-discriminative and discriminative regions. Our loss integrates: (i) a cross-entropy seeking a foreground, where model confidence about class prediction is high; (ii) a KL regularizer seeking a background, where model uncertainty is high; and (iii) log-barrier terms discouraging unbalanced segmentations.
  arXiv  Detail & Related papers  (2020-11-14T04:45:07Z)

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.