A Policy for Early Sequence Classification
Not on the map. Why?
Abstract (arXiv)
Sequences are often not received in their entirety at once, but instead, received incrementally over time, element by element. Early predictions yielding a higher benefit, one aims to classify a sequence as accurately as possible, as soon as possible, without having to wait for the last element. For this early sequence classification, we introduce our novel classifier-induced stopping. While previous methods depend on exploration during training to learn when to stop and classify, ours is a more direct, supervised approach. Our classifier-induced stopping achieves an average Pareto frontier AUC increase of 11.8% over multiple experiments.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 12 references that are in the map. First posted on arXiv 7 Apr 2023.
Builds on
3 of 12 references.
References · 3
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2018Global overview of Imitation Learningcited by 16
- 2017Convolutional Recurrent Neural Networks for Electrocardiogram Classificationcited by 14
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.
- 2024Early Classification of Time Series: A Survey and Benchmarkcited by 3
- 2023Early Classifying Multimodal Sequencescited by 0
- 2024Early Classification of Time Series: A Survey and Benchmark26 Jun 2024
- 2023Early Classifying Multimodal Sequences2 May 2023