Temporal Probability Calibration
Tim Leathart, Maksymilian Polaczuk

TL;DR
This paper addresses the challenge of calibrating class probability estimates from sequential data, proposing adaptive methods that improve calibration for incomplete sequences in various applications.
Contribution
It introduces novel calibration techniques tailored for sequential models with incomplete data, outperforming traditional methods in effectiveness.
Findings
Proposed methods significantly improve probability calibration accuracy.
Adaptive calibration schemes outperform traditional techniques on sequential data.
Effective across multiple application domains.
Abstract
In many applications, accurate class probability estimates are required, but many types of models produce poor quality probability estimates despite achieving acceptable classification accuracy. Even though probability calibration has been a hot topic of research in recent times, the majority of this has investigated non-sequential data. In this paper, we consider calibrating models that produce class probability estimates from sequences of data, focusing on the case where predictions are obtained from incomplete sequences. We show that traditional calibration techniques are not sufficiently expressive for this task, and propose methods that adapt calibration schemes depending on the length of an input sequence. Experimental evaluation shows that the proposed methods are often substantially more effective at calibrating probability estimates from modern sequential architectures for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Time Series Analysis and Forecasting · Data Stream Mining Techniques
