REVIEW 2 cited by
CD-split and HPD-split: efficient conformal regions in high dimensions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Conformal methods create prediction bands that control average coverage assuming solely i.i.d. data. Although the literature has mostly focused on prediction intervals, more general regions can often better represent uncertainty. For instance, a bimodal target is better represented by the union of two intervals. Such prediction regions are obtained by CD-split , which combines the split method and a data-driven partition of the feature space which scales to high dimensions. CD-split however contains many tuning parameters, and their role is not clear. In this paper, we provide new insights on CD-split by exploring its theoretical properties. In particular, we show that CD-split converges asymptotically to the oracle highest predictive density set and satisfies local and asymptotic conditional validity. We also present simulations that show how to tune CD-split. Finally, we introduce HPD-split, a variation of CD-split that requires less tuning, and show that it shares the same theoretical guarantees as CD-split. In a wide variety of our simulations, CD-split and HPD-split have better conditional coverage and yield smaller prediction regions than other methods.
Forward citations
Cited by 2 Pith papers
-
PATH: Next-Interval Prediction via Autoregressive Tree Hierarchy on Tabular Data
PATH, an autoregressive tree-hierarchy model over discretized regression targets, achieves the shortest mean normalized prediction interval length on a 56-dataset benchmark while maintaining mean coverage above the 90...
-
Predictive Inference With Fast Feature Conformal Prediction
FFCP approximates feature conformal prediction with a gradient-normalized score, cutting runtime about 50x while maintaining coverage guarantees.
Discussion (0). Continue with ORCID to comment.