惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
罗磊的独立博客
V
V2EX
Vercel News
Vercel News
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
I
InfoQ
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
H
Help Net Security
腾讯CDC
D
Docker
P
Proofpoint News Feed
GbyAI
GbyAI
博客园 - 三生石上(FineUI控件)
aimingoo的专栏
aimingoo的专栏

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Asymptotics for conformal inference
Ulysse Gazin · 2024-09-18 · via math.ST updates on arXiv.org

Conformal inference is a versatile tool for building prediction sets in regression or classification. We study the false coverage proportion (FCP) in a simultaneous inference setting with a calibration sample of $n$ points and a test sample of $m$ points. We identify the exact, distribution-free, asymptotic distribution of the FCP when both $n$ and $m$ tend to infinity. This shows in particular that FCP control can be achieved by using the well-known Kolmogorov distribution, and puts forward that the asymptotic variance is decreasing in the ratio $n/m$. We then provide a number of extensions by considering the problems of novelty detection, weighted conformal inference or distribution shift between the calibration sample and the test sample. In particular, our asymptotic results allow to accurately quantify the asymptotic behavior of the errors (a miscovering interval or declaring a false novelty) when weighted conformal inference is used.