Pruning Extensions and Efficiency Trade-Offs for Sustainable Time Series Classification

• URL: http://arxiv.org/abs/2604.07953v1
• Date: Thu, 09 Apr 2026 08:19:10 GMT
• Title: Pruning Extensions and Efficiency Trade-Offs for Sustainable Time Series Classification
• Abstract summary: Time series classification (TSC) enables important use cases, however lacks a unified understanding of performance trade-offs across models, datasets, and hardware.<n>This paper introduces a holistic evaluation framework that explicitly explores the balance of predictive performance and resource consumption in TSC.
• Score: 6.238381725498364
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Time series classification (TSC) enables important use cases, however lacks a unified understanding of performance trade-offs across models, datasets, and hardware. While resource awareness has grown in the field, TSC methods have not yet been rigorously evaluated for energy efficiency. This paper introduces a holistic evaluation framework that explicitly explores the balance of predictive performance and resource consumption in TSC. To boost efficiency, we apply a theoretically bounded pruning strategy to leading hybrid classifiers - Hydra and Quant - and present Hydrant, a novel, prunable combination of both. With over 4000 experimental configurations across 20 MONSTER datasets, 13 methods, and three compute setups, we systematically analyze how model design, hyperparameters, and hardware choices affect practical TSC performance. Our results showcase that pruning can significantly reduce energy consumption by up to 80% while maintaining competitive predictive quality, usually costing the model less than 5% of accuracy. The proposed methodology, experimental results, and accompanying software advance TSC toward sustainable and reproducible practice.

Related papers

• FACT: A Simple and Efficient Framework for Active Finetuning [23.983494767170644]
  We propose FACT, a three-phase hierarchical finetuning framework featuring both efficiency and simplicity.<n>Under low sampling ratios, our framework achieves remarkable performance gains of over 20% on the ViT model for CIFAR10, CIFAR100, and ImageNet-1k benchmarks.<n>This systematic approach establishes new state-of-the-art performance while maintaining parameter efficiency, proving particularly effective when labeled data is scarce.
  arXiv  Detail & Related papers  (2026-06-01T11:08:31Z)
• VLA-ATTC: Adaptive Test-Time Compute for VLA Models with Relative Action Critic Model [54.35791816657227]
  We introduce textbfVLA-ATTC', a framework that endows VLA models with adaptive test-time compute.<n>VLA-ATTC employs an uncertainty-based cognitive clutch'' to dynamically transition from reflexive execution to a TTC deliberation phase.<n>On the LIBERO-LONG benchmark, VLA-ATTC reduces the failure rate of the SOTA model PI0.5 by over 50%.
  arXiv  Detail & Related papers  (2026-05-02T02:13:11Z)
• From ARIMA to Attention: Power Load Forecasting Using Temporal Deep Learning [0.0]
  This paper performs an empirical evaluation of a traditional statistical model and deep learning approaches for predicting short-term energy load.<n>Four models, namely ARIMA, LSTM, BiLSTM, and Transformer, were leveraged on the PJM Hourly Energy Consumption data.<n>The Transformer model, which relies on self-attention algorithms, produced the best results with 3.8 percent of MAPE.
  arXiv  Detail & Related papers  (2026-02-21T10:51:49Z)
• An Analysis of Optimizer Choice on Energy Efficiency and Performance in Neural Network Training [0.0]
  This paper presents a comprehensive study investigating the relationship between choice and energy efficiency in neural network training.<n>We conducted 360 controlled experiments across three benchmark datasets (MNIST, CIFAR-10, CIFAR-100) using eight popular Adas.<n>Our findings reveal substantial trade-offs between training speed, accuracy, and environmental impact that vary across datasets and model complexity.
  arXiv  Detail & Related papers  (2025-09-16T20:20:22Z)
• EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving [64.15371139980802]
  Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP)<n>We show that different test-time scaling strategies for ATP models introduce significant computational overhead for inference.<n>We propose two complementary methods that can be integrated into a unified EconRL pipeline for amplified benefits.
  arXiv  Detail & Related papers  (2025-09-16T03:00:13Z)
• The Energy Cost of Reasoning: Analyzing Energy Usage in LLMs with Test-time Compute [5.83525198890183]
  Scaling large language models (LLMs) has driven significant advancements, yet it faces diminishing returns and escalating energy demands.<n>This work explores how test-time compute can serve as an energy-efficient complement to conventional scaling strategies.
  arXiv  Detail & Related papers  (2025-05-20T02:35:59Z)
• EfficientLLM: Efficiency in Large Language Models [64.3537131208038]
  Large Language Models (LLMs) have driven significant progress, yet their growing counts and context windows incur prohibitive compute, energy, and monetary costs.<n>We introduce EfficientLLM, a novel benchmark and the first comprehensive empirical study evaluating efficiency techniques for LLMs at scale.
  arXiv  Detail & Related papers  (2025-05-20T02:27:08Z)
• Energy-Efficient Transformer Inference: Optimization Strategies for Time Series Classification [0.0]
  This study presents a systematic investigation of optimization techniques, focusing on structured pruning and quantization methods for transformer architectures.<n>Our experimental results demonstrate that static quantization reduces energy consumption by 29.14% while maintaining classification performance, and L1 pruning achieves a 63% improvement in inference speed with minimal accuracy degradation.
  arXiv  Detail & Related papers  (2025-02-23T16:04:56Z)
• Impact of ML Optimization Tactics on Greener Pre-Trained ML Models [46.78148962732881]
  This study aims to (i) analyze image classification datasets and pre-trained models, (ii) improve inference efficiency by comparing optimized and non-optimized models, and (iii) assess the economic impact of the optimizations. We conduct a controlled experiment to evaluate the impact of various PyTorch optimization techniques (dynamic quantization, torch.compile, local pruning, and global pruning) to 42 Hugging Face models for image classification. Dynamic quantization demonstrates significant reductions in inference time and energy consumption, making it highly suitable for large-scale systems.
  arXiv  Detail & Related papers  (2024-09-19T16:23:03Z)
• GOHSP: A Unified Framework of Graph and Optimization-based Heterogeneous Structured Pruning for Vision Transformer [76.2625311630021]
  Vision transformers (ViTs) have shown very impressive empirical performance in various computer vision tasks. To mitigate this challenging problem, structured pruning is a promising solution to compress model size and enable practical efficiency. We propose GOHSP, a unified framework of Graph and Optimization-based Structured Pruning for ViT models.
  arXiv  Detail & Related papers  (2023-01-13T00:40:24Z)
• CAFE: Learning to Condense Dataset by Aligning Features [72.99394941348757]
  We propose a novel scheme to Condense dataset by Aligning FEatures (CAFE) At the heart of our approach is an effective strategy to align features from the real and synthetic data across various scales. We validate the proposed CAFE across various datasets, and demonstrate that it generally outperforms the state of the art.
  arXiv  Detail & Related papers  (2022-03-03T05:58:49Z)
• Conformer-based Hybrid ASR System for Switchboard Dataset [99.88988282353206]
  We present and evaluate a competitive conformer-based hybrid model training recipe. We study different training aspects and methods to improve word-error-rate as well as to increase training speed. We conduct experiments on Switchboard 300h dataset and our conformer-based hybrid model achieves competitive results.
  arXiv  Detail & Related papers  (2021-11-05T12:03:18Z)

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.