Conformal Predictions under Markovian Data

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zheng, Frédéric, Proutiere, Alexandre
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916331550408704
author Zheng, Frédéric
Proutiere, Alexandre
author_facet Zheng, Frédéric
Proutiere, Alexandre
contents We study the split Conformal Prediction method when applied to Markovian data. We quantify the gap in terms of coverage induced by the correlations in the data (compared to exchangeable data). This gap strongly depends on the mixing properties of the underlying Markov chain, and we prove that it typically scales as $\sqrt{t_\mathrm{mix}\ln(n)/n}$ (where $t_\mathrm{mix}$ is the mixing time of the chain). We also derive upper bounds on the impact of the correlations on the size of the prediction set. Finally we present $K$-split CP, a method that consists in thinning the calibration dataset and that adapts to the mixing properties of the chain. Its coverage gap is reduced to $t_\mathrm{mix}/(n\ln(n))$ without really affecting the size of the prediction set. We finally test our algorithms on synthetic and real-world datasets.
format Preprint
id arxiv_https___arxiv_org_abs_2407_15277
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Conformal Predictions under Markovian Data
Zheng, Frédéric
Proutiere, Alexandre
Machine Learning
Statistics Theory
We study the split Conformal Prediction method when applied to Markovian data. We quantify the gap in terms of coverage induced by the correlations in the data (compared to exchangeable data). This gap strongly depends on the mixing properties of the underlying Markov chain, and we prove that it typically scales as $\sqrt{t_\mathrm{mix}\ln(n)/n}$ (where $t_\mathrm{mix}$ is the mixing time of the chain). We also derive upper bounds on the impact of the correlations on the size of the prediction set. Finally we present $K$-split CP, a method that consists in thinning the calibration dataset and that adapts to the mixing properties of the chain. Its coverage gap is reduced to $t_\mathrm{mix}/(n\ln(n))$ without really affecting the size of the prediction set. We finally test our algorithms on synthetic and real-world datasets.
title Conformal Predictions under Markovian Data
topic Machine Learning
Statistics Theory
url https://arxiv.org/abs/2407.15277