Early and Revocable Time Series Classification

• URL: http://arxiv.org/abs/2109.10285v2
• Date: Wed, 22 Sep 2021 16:16:49 GMT
• Title: Early and Revocable Time Series Classification
• Abstract summary: This paper introduces a new problem called early and revocabletimeseries classification. We propose anew cost-based framework and derive two new approaches from it. The ability of revok-ing decisions significantly improves performance over the irrevocable regime.
• Score: 0.028675177318965035
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many approaches have been proposed for early classification of time series in light of itssignificance in a wide range of applications including healthcare, transportation and fi-nance. Until now, the early classification problem has been dealt with by considering onlyirrevocable decisions. This paper introduces a new problem calledearly and revocabletimeseries classification, where the decision maker can revoke its earlier decisions based on thenew available measurements. In order to formalize and tackle this problem, we propose anew cost-based framework and derive two new approaches from it. The first approach doesnot consider explicitly the cost of changing decision, while the second one does. Exten-sive experiments are conducted to evaluate these approaches on a large benchmark of realdatasets. The empirical results obtained convincingly show (i) that the ability of revok-ing decisions significantly improves performance over the irrevocable regime, and (ii) thattaking into account the cost of changing decision brings even better results in general.Keywords:revocable decisions, cost estimation, online decision making

Related papers

• Robust Strategic Classification under Decision-Dependent Cost Uncertainty [3.1351527202068445]
  Humans have been found to game'' algorithmic decision systems by altering their input data (at a cost to them) in order to favorably change the algorithmic outcomes they receive (at a cost to the algorithm)<n>This paper proposes and analyzes a two-stage robust optimization framework with a decision-dependent uncertainty set to capture such dependencies.<n>We highlight that awareness of policy-dependent costs not only reduces uncertainty, but also better curtails gaming of the algorithmic system over time.
  arXiv  Detail & Related papers  (2026-06-29T11:15:11Z)
• Early Classification of Time Series in Non-Stationary Cost Regimes [0.1259953341639576]
  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.
  arXiv  Detail & Related papers  (2026-01-31T22:09:56Z)
• Aligning Learning and Endogenous Decision-Making [5.84228364962637]
  We introduce an end-to-end method under endogenous uncertainty to train ML models to be aware of their downstream.<n>We also introduce a robust optimization variant that accounts for uncertainty in ML models.<n>We prove guarantees that this robust approach can capture near-optimal decisions with high probability as a function of data.
  arXiv  Detail & Related papers  (2025-07-01T15:22:56Z)
• A Principled Approach to Randomized Selection under Uncertainty: Applications to Peer Review and Grant Funding [68.43987626137512]
  We propose a principled framework for randomized decision-making based on interval estimates of the quality of each item.<n>We introduce MERIT, an optimization-based method that maximizes the worst-case expected number of top candidates selected.<n>We prove that MERIT satisfies desirable axiomatic properties not guaranteed by existing approaches.
  arXiv  Detail & Related papers  (2025-06-23T19:59:30Z)
• Treatment Effect Estimation for Optimal Decision-Making [65.30942348196443]
  We study optimal decision-making based on two-stage CATE estimators.<n>We propose a novel two-stage learning objective that retargets the CATE to balance CATE estimation error and decision performance.
  arXiv  Detail & Related papers  (2025-05-19T13:24:57Z)
• An Identifiable Cost-Aware Causal Decision-Making Framework Using Counterfactual Reasoning [18.324601057882386]
  We propose a minimum-cost causal decision (MiCCD) framework via counterfactual reasoning to solve the necessary cause.<n> Emphasis is placed on making counterfactual reasoning processes identifiable in the presence of mixed anomaly data.<n>MiCCD outperforms conventional methods across multiple metrics, including F1-score, cost efficiency, and ranking quality(nDCG@k values)
  arXiv  Detail & Related papers  (2025-05-13T08:41:45Z)
• Enhancing Language Model Rationality with Bi-Directional Deliberation Reasoning [73.77288647011295]
  This paper introduces BI-Directional DEliberation Reasoning (BIDDER) to enhance the decision rationality of language models. Our approach involves three key processes:. Inferring hidden states to represent uncertain information in the decision-making process from historical data;. Using hidden states to predict future potential states and potential outcomes;. Integrating historical information (past contexts) and long-term outcomes (future contexts) to inform reasoning.
  arXiv  Detail & Related papers  (2024-07-08T16:48:48Z)
• Online Decision Mediation [72.80902932543474]
  Consider learning a decision support assistant to serve as an intermediary between (oracle) expert behavior and (imperfect) human behavior. In clinical diagnosis, fully-autonomous machine behavior is often beyond ethical affordances.
  arXiv  Detail & Related papers  (2023-10-28T05:59:43Z)
• Multi-Armed Bandits with Generalized Temporally-Partitioned Rewards [0.4194295877935867]
  In some real-world applications, feedback about a decision is delayed and may arrive via partial rewards that are observed with different delays. We propose a novel problem formulation called multi-armed bandits with generalized temporally-partitioned rewards. We derive a lower bound on the performance of any uniformly efficient algorithm for the considered problem.
  arXiv  Detail & Related papers  (2023-03-01T16:22:22Z)
• Online Learning under Budget and ROI Constraints via Weak Adaptivity [57.097119428915796]
  Existing primal-dual algorithms for constrained online learning problems rely on two fundamental assumptions. We show how such assumptions can be circumvented by endowing standard primal-dual templates with weakly adaptive regret minimizers. We prove the first best-of-both-worlds no-regret guarantees which hold in absence of the two aforementioned assumptions.
  arXiv  Detail & Related papers  (2023-02-02T16:30:33Z)
• RISE: Robust Individualized Decision Learning with Sensitive Variables [1.5293427903448025]
  A naive baseline is to ignore sensitive variables in learning decision rules, leading to significant uncertainty and bias. We propose a decision learning framework to incorporate sensitive variables during offline training but not include them in the input of the learned decision rule during model deployment.
  arXiv  Detail & Related papers  (2022-11-12T04:31:38Z)
• Causal Fairness Analysis [68.12191782657437]
  We introduce a framework for understanding, modeling, and possibly solving issues of fairness in decision-making settings. The main insight of our approach will be to link the quantification of the disparities present on the observed data with the underlying, and often unobserved, collection of causal mechanisms. Our effort culminates in the Fairness Map, which is the first systematic attempt to organize and explain the relationship between different criteria found in the literature.
  arXiv  Detail & Related papers  (2022-07-23T01:06:34Z)
• Limitations of a proposed correction for slow drifts in decision criterion [0.0]
  We propose a model-based approach for disambiguating systematic updates from random drifts. We show that this approach accurately recovers the latent trajectory of drifts in decision criterion. Our results highlight the advantages of incorporating assumptions about the generative process directly into models of decision-making.
  arXiv  Detail & Related papers  (2022-05-22T19:33:19Z)
• Modularity in Reinforcement Learning via Algorithmic Independence in Credit Assignment [79.5678820246642]
  We show that certain action-value methods are more sample efficient than policy-gradient methods on transfer problems that require only sparse changes to a sequence of previously optimal decisions. We generalize the recently proposed societal decision-making framework as a more granular formalism than the Markov decision process.
  arXiv  Detail & Related papers  (2021-06-28T21:29:13Z)
• Confidence-Budget Matching for Sequential Budgeted Learning [69.77435313099366]
  We formalize decision-making problems with querying budget. We consider multi-armed bandits, linear bandits, and reinforcement learning problems. We show that CBM based algorithms perform well in the presence of adversity.
  arXiv  Detail & Related papers  (2021-02-05T19:56:31Z)
• The foundations of cost-sensitive causal classification [3.7493611543472953]
  This study integrates cost-sensitive and causal classification by elaborating a unifying evaluation framework. We prove that conventional classification is a specific case of causal classification in terms of a range of performance measures. The proposed framework paves the way toward the development of cost-sensitive causal learning methods.
  arXiv  Detail & Related papers  (2020-07-24T15:33:48Z)
• Fairness in Learning-Based Sequential Decision Algorithms: A Survey [22.252241233231263]
  We will focus on two types of sequential decisions: past decisions have no impact on the underlying user population and thus no impact on future data. In each case the impact of various fairness interventions on the underlying population is examined.
  arXiv  Detail & Related papers  (2020-01-14T15:49:57Z)

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.