Adaptive Structured Pruning of Convolutional Neural Networks for Time Series Classification

📅 2026-02-13
📈 Citations: 0
✨ Influential: 0
📄 PDF

Technology Category

Machine Learning: Time-Series/Data StreamsPlanning, Routing, and Scheduling: Optimization of Spatio-temporal SystemsCognitive Modeling & Cognitive Systems: Neural Spike Coding

Application Category

Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphsWeb Mining and Content Analysis: Bridging structured and unstructured dataUser Modeling, Personalization and Recommendation: On-Device user modeling, personalization, and recommendation
📝 Abstract
Deep learning models for Time Series Classification (TSC) have achieved strong predictive performance but their high computational and memory requirements often limit deployment on resource-constrained devices. While structured pruning can address these issues by removing redundant filters, existing methods typically rely on manually tuned hyperparameters such as pruning ratios which limit scalability and generalization across datasets. In this work, we propose Dynamic Structured Pruning (DSP), a fully automatic, structured pruning framework for convolution-based TSC models. DSP introduces an instance-wise sparsity loss during training to induce channel-level sparsity, followed by a global activation analysis to identify and prune redundant filters without needing any predefined pruning ratio. This work tackles computational bottlenecks of deep TSC models for deployment on resource-constrained devices. We validate DSP on 128 UCR datasets using two different deep state-of-the-art architectures: LITETime and InceptionTime. Our approach achieves an average compression of 58% for LITETime and 75% for InceptionTime architectures while maintaining classification accuracy. Redundancy analyses confirm that DSP produces compact and informative representations, offering a practical path for scalable and efficient deep TSC deployment.
Problem

Research questions and friction points this paper is trying to address.

Time Series Classification
Structured Pruning
Resource-Constrained Devices
Model Compression
Computational Efficiency
Innovation

Methods, ideas, or system contributions that make the work stand out.

Dynamic Structured Pruning
Time Series Classification
Channel-level Sparsity
Automatic Pruning
Model Compression
🔎 Similar Papers
No similar papers found.