Early Classification of Time Series in Non-Stationary Cost Regimes

• URL: http://arxiv.org/abs/2602.00918v1
• Date: Sat, 31 Jan 2026 22:09:56 GMT
• Title: Early Classification of Time Series in Non-Stationary Cost Regimes
• Abstract summary: Early Classification of Time Series (ECTS) addresses decisionmaking problems in which predictions must be made as early as possible.<n>Most existing methods assume that the time-dependent decision costs governing the learning objective are known, fixed, and correctly specified.<n>We study under two practically relevant forms of cost non-stationarity: drift in the balance between misclassification and decision delay costs, and realizations of decision costs that deviate from the nominal training-time model.
• Score: 0.1259953341639576
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Early Classification of Time Series (ECTS) addresses decision-making problems in which predictions must be made as early as possible while maintaining high accuracy. Most existing ECTS methods assume that the time-dependent decision costs governing the learning objective are known, fixed, and correctly specified. In practice, however, these costs are often uncertain and may change over time, leading to mismatches between training-time and deployment-time objectives. In this paper, we study ECTS under two practically relevant forms of cost non-stationarity: drift in the balance between misclassification and decision delay costs, and stochastic realizations of decision costs that deviate from the nominal training-time model. To address these challenges, we revisit representative ECTS approaches and adapt them to an online learning setting. Focusing on separable methods, we update only the triggering model during deployment, while keeping the classifier fixed. We propose several online adaptations and baselines, including bandit-based and RL-based approaches, and conduct controlled experiments on synthetic data to systematically evaluate robustness under cost non-stationarity. Our results demonstrate that online learning can effectively improve the robustness of ECTS methods to cost drift, with RL-based strategies exhibiting strong and stable performance across varying cost regimes.

Related papers

• Decision-Aware Training for Sample-Based Generative Models [0.08594140167290099]
  We propose decision-aware training for sample-based generative models, augmenting the energy score objective with a differentiable decision loss that directly penalises the cost incurred by acting on the model's forecast.<n>We validate our method on one synthetic and two real-world tasks, showing targeted improvements in cost-sensitive regions while retaining full probabilistic forecasts.
  arXiv  Detail & Related papers  (2026-07-01T17:02:23Z)
• Multimodal Learning on Low-Quality Data with Conformal Predictive Self-Calibration [72.0672328514289]
  Multimodal learning often grapples with the challenge of low-quality data.<n>We propose a unified framework, termed Conformal Predictive Self-Calibration.<n>Our framework consistently outperforms existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-05T14:48:52Z)
• Cost-optimal Sequential Testing via Doubly Robust Q-learning [17.865867651025717]
  We study the problem of learning cost-optimal sequential decision policies from retrospective data.<n>We develop a doubly robust Q-learning framework for estimating optimal policies.
  arXiv  Detail & Related papers  (2026-04-13T08:26:27Z)
• Scalable Decision Focused Learning via Online Trainable Surrogates [9.624413875440233]
  We propose an acceleration method based on replacing costly loss function evaluations with an efficient surrogate.<n>Unlike previously defined surrogates, our approach relies on unbiased estimators reducing the risk of spurious local optima.<n>In our results, the method reduces costly inner solver calls, with a solution quality comparable to other state-of-the-art techniques.
  arXiv  Detail & Related papers  (2025-12-03T15:09:21Z)
• e1: Learning Adaptive Control of Reasoning Effort [88.51897900019485]
  Increasing the thinking budget of AI models can significantly improve accuracy, but not all questions warrant the same amount of reasoning.<n>Users may prefer to allocate different amounts of reasoning effort depending on how they value output quality versus latency and cost.<n>We propose Adaptive Effort Control, a self-adaptive reinforcement learning method that trains models to use a user-specified fraction of tokens.
  arXiv  Detail & Related papers  (2025-10-30T23:12:21Z)
• Cost-Optimal Active AI Model Evaluation [71.2069549142394]
  Development of generative AI systems requires continual evaluation, data acquisition, and annotation.<n>We develop novel, cost-aware methods for actively balancing the use of a cheap, but often inaccurate, weak rater.<n>We derive a family of cost-optimal policies for allocating a given annotation budget between weak and strong raters.
  arXiv  Detail & Related papers  (2025-06-09T17:14:41Z)
• When to retrain a machine learning model [0.0]
  A significant challenge in maintaining real-world machine learning models is responding to the continuous and unpredictable evolution of data.<n>We propose an uncertainty-based method that makes decisions by continually forecasting the evolution of model performance evaluated with a bounded metric.
  arXiv  Detail & Related papers  (2025-05-20T20:55:56Z)
• RLER-TTE: An Efficient and Effective Framework for En Route Travel Time Estimation with Reinforcement Learning [5.4674463400564886]
  En Route Travel Time Estimation aims to learn driving patterns from traveled routes to achieve rapid and accurate real-time predictions.<n>Existing methods ignore the complexity and dynamism of real-world traffic systems, resulting in significant gaps in efficiency and accuracy in real-time scenarios.<n>This paper proposes a novel framework that redefines the path implementation of ER-TTE to achieve highly efficient and effective predictions.
  arXiv  Detail & Related papers  (2025-01-26T11:49:34Z)
• Temporal-Difference Variational Continual Learning [77.92320830700797]
  We propose new learning objectives that integrate the regularization effects of multiple previous posterior estimations.<n>Our approach effectively mitigates Catastrophic Forgetting, outperforming strong Variational CL methods.
  arXiv  Detail & Related papers  (2024-10-10T10:58:41Z)
• Towards Effective Evaluations and Comparisons for LLM Unlearning Methods [97.2995389188179]
  This paper seeks to refine the evaluation of machine unlearning for large language models.<n>It addresses two key challenges -- the robustness of evaluation metrics and the trade-offs between competing goals.
  arXiv  Detail & Related papers  (2024-06-13T14:41:00Z)
• Provably Cost-Sensitive Adversarial Defense via Randomized Smoothing [26.26867107261039]
  We study the problem of robust learning against adversarial perturbations under cost-sensitive scenarios.<n>Our solution introduces a provably robust learning algorithm to certify and optimize for cost-sensitive robustness.<n>In addition, we design a robust training method that improves certified cost-sensitive robustness without compromising model accuracy.
  arXiv  Detail & Related papers  (2023-10-12T21:39:16Z)
• Towards Robust Continual Learning with Bayesian Adaptive Moment Regularization [51.34904967046097]
  Continual learning seeks to overcome the challenge of catastrophic forgetting, where a model forgets previously learnt information. We introduce a novel prior-based method that better constrains parameter growth, reducing catastrophic forgetting. Results show that BAdam achieves state-of-the-art performance for prior-based methods on challenging single-headed class-incremental experiments.
  arXiv  Detail & Related papers  (2023-09-15T17:10:51Z)
• Rethinking Cost-sensitive Classification in Deep Learning via Adversarial Data Augmentation [4.479834103607382]
  Cost-sensitive classification is critical in applications where misclassification errors widely vary in cost. This paper proposes a cost-sensitive adversarial data augmentation framework to make over- parameterized models cost-sensitive. Our method can effectively minimize the overall cost and reduce critical errors, while achieving comparable performance in terms of overall accuracy.
  arXiv  Detail & Related papers  (2022-08-24T19:00:30Z)
• Temporal-Difference Value Estimation via Uncertainty-Guided Soft Updates [110.92598350897192]
  Q-Learning has proven effective at learning a policy to perform control tasks. estimation noise becomes a bias after the max operator in the policy improvement step. We present Unbiased Soft Q-Learning (UQL), which extends the work of EQL from two action, finite state spaces to multi-action, infinite state Markov Decision Processes.
  arXiv  Detail & Related papers  (2021-10-28T00:07:19Z)
• Uncertainty Weighted Actor-Critic for Offline Reinforcement Learning [63.53407136812255]
  Offline Reinforcement Learning promises to learn effective policies from previously-collected, static datasets without the need for exploration. Existing Q-learning and actor-critic based off-policy RL algorithms fail when bootstrapping from out-of-distribution (OOD) actions or states. We propose Uncertainty Weighted Actor-Critic (UWAC), an algorithm that detects OOD state-action pairs and down-weights their contribution in the training objectives accordingly.
  arXiv  Detail & Related papers  (2021-05-17T20:16:46Z)

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.