arXiv AI

Gradient-based Model Shortcut Detection for Time Series Classification

The paper "Gradient-based Model Shortcut Detection for Time Series Classification" investigates how deep neural networks (DNNs) can develop shortcut learning behaviors in time series classification tasks, where models may rely on spurious correlations in the training data. It introduces a gradient‑based detection method that identifies point‑based shortcuts without needing test data or clean training classes, and evaluates this approach on UCR time series datasets.

arXiv AI
Sep 16

ICON Decomposition: Auditing deep neural networks for shortcuts by decomposing layer-wise representations using concepts

The paper introduces ICON Decomposition, a method for auditing deep neural networks by decomposing layer-wise representations into independent concept contributions. Unlike existing techniques that rely on linear probes or concept activation vectors, ICON quantifies the variance share each concept explains while conditioning on all other concepts and the outcome, allowing comparison across layers and concept types. Experiments on simulated data, skin‑cancer, and neuroimaging models show that ICON more accurately recovers true concept importance and can distinguish learned shortcuts from correlated concepts, as validated by retraining and out‑of‑distribution tests.

By Roshan Prakash Rane, Marco Simnacher, Manuel Pfeuffer, Marc-Andre Schulz, Nys Tjade Siegel, Maximilian Dreyer, Frederik Pahde, Wojciech Samek, Sonja Greven, Kerstin Ritter
arXiv AI
Jul 1

A time-series classification framework for individual-level absenteeism prediction under severe class imbalance

arXiv:2606. 31532v1 Announce Type: new Abstract: Staff absenteeism imposes substantial operational costs in high-demand work environments such as healthcare, emergency services, meat processing, construction, and courier and delivery services, where proactive workforce planning depends on reliable individual-level absence prediction.

By Kwong Ho Li, Matthew Roughan, Wathsala Karunarathne
arXiv AI
Oct 16

ICON decomposition: Multivariate concept auditing reveals shortcuts that neural networks rely on

The paper introduces ICON decomposition, a method for auditing neural networks by decomposing the variance of intermediate representations into contributions from Independent Canonical Concepts (ICON). Unlike traditional decodability metrics, ICON isolates each concept’s influence while conditioning on all other concepts and the outcome, providing a clearer view of which concepts truly drive predictions. Experiments on simulated data and real-world skin‑cancer and neuroimaging tasks show ICON outperforms seven baseline methods and successfully distinguishes genuine shortcuts from merely correlated features.

By Roshan Prakash Rane, Marco Simnacher, Manuel Pfeuffer, Marc-Andre Schulz, Nys Tjade Siegel, Maximilian Dreyer, Frederik Pahde, Wojciech Samek, Sonja Greven, Kerstin Ritter
arXiv Machine Learning
Oct 19

RTSM: Adapting Recursive Models to Multivariate Time-Series Classification

The paper introduces the Recursive Time-Series Model (RTSM), a deep-learning architecture that uses a learned convolutional temporal tokenizer, a single-state weight‑tied refinement module, and a pooled classification readout to classify multivariate time‑series data. On the 30 UEA datasets, RTSM achieves a mean accuracy of 72.81% under validation‑based configuration, surpassing all 17 evaluated deep‑learning models and outperforming MambaSL by 1.60 percentage points. Ablation studies show that the proposed tokenizer and single‑state design outperform simpler convolutional embeddings and two‑state variants, and the full classifier reaches 86.10% mean accuracy compared to 84.79% for a tokenizer‑only classifier.

By Georg Tenzing, Anna Tegon, Luca Benini, Thorir Mar Ingolfsson
arXiv AI
Oct 1

A Time-Aware Bag-of-Receptive-Fields for Interpretable Irregular Time Series Classification

The paper introduces a Time-Aware Bag-of-Receptive-Fields (BORF) for classifying irregular time series, extending the original BORF to handle non-uniform sampling, missing data, and variable lengths. It adds a time-weighted normalization that weights observations by their time deltas, enabling pattern extraction that reflects the true temporal distribution. The method maintains linear time complexity and is evaluated against state‑of‑the‑art irregular time‑series classifiers, achieving competitive performance while providing human‑interpretable explanations.

By Francesco Spinnato