Searcharxiv⌕ Search

arXiv · 2611.11909

Coverage and shape of conformal highest-density sets: A minimax theory

Abstract

We study conditional coverage and geometric efficiency of conformal highest-density sets. The excess volume of such a set over the conditional highest-density set, the smallest set with the required conditional coverage, splits into a coverage error and an excess mass. We show that, among procedures whose volume is accurate up to a constant, the coverage error has the minimax rate of nonparametric regression on the covariate, and that the excess mass has the squared minimax rate of conditional density estimation. The usual split conformal construction calibrates these sets with a single threshold, which corrects the bias of the density estimate only on average over the covariate. We prove that its coverage error can then be of the order of the slower density rate. We therefore propose two-stage calibration, which estimates the coverage of the super-level sets of a density estimate by a regression on the covariate and uses this estimated coverage as the conformity score. Since these sets are fixed at each covariate value, their coverage is as smooth as the conditional density, and, under mild regularity conditions, the coverage error attains the regression rate even when the density estimate is inconsistent. The shape of the set still depends on the accuracy of the density estimate: sup-norm accuracy controls it at the minimax excess-mass rate, whereas accuracy in an integrated norm, even of minimax order, does not. With a local polynomial density estimate, two-stage calibration attains both minimax rates up to logarithmic factors. Simulations and an application to bike-sharing demand illustrate the results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilsang Ohn. 2026-11-10. Coverage and shape of conformal highest-density sets: A minimax theory. https://searcharxiv.com/abs/2611.11909

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

On Minimal Observation Time for Recovering Latent Hawkes Networks

Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.

math.ST↗

Bidirectional Random Projections

This paper analyzes bidirectional random projections for ordinary least squares (OLS) regression under the fixed design setting. Let $(X, Y) \in \mathbb{R}^{n\times p}\times\mathbb{R}^{n}$ be a sample and $W \in \mathbb{R}^{n_1\times n}$, $R \in \mathbb{R}^{p\times p_1}$ be two random projections. We develop an expected excess loss bound for the OLS estimator built on $(WXR, WY)$, extending an established bound for the OLS estimator built on $(XR, Y)$. Our analysis shows that our bound is larger and the gap between the two bounds decays at a rate of approximately $O(1/n_1)$. These findings are confirmed by numerical results.

math.ST↗

Asymptotics for Model Selection in Probabilistic Principal Component Analysis

The probabilistic formulation of principal component analysis promises statistically grounded solutions to the problem of selecting the number of principal components. However, developing tractable model selection methods is complicated by the fact that the probabilistic principal component analysis (PPCA) model exhibits non-standard large sample asymptotics at model singularities, where the Fisher information matrix does not have full rank. In this work, tools from singular learning theory are used to provide a complete description of the marginal likelihood asymptotics for PPCA. The singular Bayesian information criterion (sBIC) along with our asymptotic results provides an effective procedure for selecting the number of principal components. In particular, the sBIC corrects for the overpenalization of the standard dimension-based BIC, which leads to too few principal components being selected, while also selecting the smallest true model with probability converging to one. Our framework extends beyond PPCA, where we also provide expressions for the sBIC that can be used to select between PPCA and factor analysis models. In both simulations and on real data the effectiveness of the proposed sBIC methodology is demonstrated.

math.ST↗