Pith. sign in

REVIEW 2 major objections 2 minor 1 cited by

Conditional Predictive Inference for General Structured Data with Group Symmetries

T0 review · 2 major / 2 minor · reviewed 2026-05-20 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read C-SymmPI achieves near-conditional coverage for predictive inference under group symmetries beyond exchangeability.

desk verdict C-SymmPI adds near-conditional coverage to SymmPI by recasting the problem as miscoverage over a user function class, but the practical strength depends on how well that class matches the group-induced heterogeneity. read the letter →

arxiv 2605.17934 v1 pith:LWUNLZYE submitted 2026-05-18 stat.ME math.STstat.MLstat.TH

Yichen Shen , Mengxin Yu This is my paper · ORCID
classification stat.MEmath.STstat.MLstat.TH
keywords conditionalpredictiveinferencegroupsymmetriesnear-conditionalcoveragestructureddatadistribution-freemethodsnetworksclustersC-SymmPI
checked against Cost.FunctionalEquationalexander_duality_circle_linking
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces C-SymmPI to extend distribution-free predictive inference to structured data with group symmetries such as networks and clusters. It targets near-conditional coverage that accounts for data heterogeneity instead of only marginal averages. The method reformulates conditional coverage as control of miscoverage error over a user-specified function class, inspired by relaxed multi-accuracy. Under the assumption that the data distribution is invariant under the symmetries, it supplies theoretical guarantees and convergence rates for linear and RKHS classes, recovering exchangeable results as special cases. Practical projection and sampling algorithms are given to handle high-dimensional observations and large groups, with demonstrations on hierarchical and network examples showing more stable conditional coverage.

What carries the argument

Reformulation of conditional coverage as miscoverage error over a user-specified function class under distributional invariance.

What would settle it

A dataset constructed so that the distribution changes under the group transformations, where the observed miscoverage rates exceed the rates predicted by the convergence bounds.

Watch

Extended reading notes

Core claim

C-SymmPI is a framework for distribution-free predictive inference that attains near-conditional coverage for general data structures with group symmetries. It reformulates the conditional coverage goal as minimization of miscoverage error over a user-specified function class. Under distributional invariance, the framework establishes theoretical guarantees and derives convergence rates for linear and reproducing kernel Hilbert space function classes, while recovering prior exchangeable results as special cases. Efficient algorithms are developed for high-dimensional data via projection and for large or infinite groups via sampling, with empirical validation on hierarchical and network data.

Load-bearing premise

The data distribution is invariant under the group symmetries.

Editorial extensions

If this is right

  • Near-conditional coverage guarantees become available for network data and cluster-level data.
  • Convergence rates are obtained for linear and RKHS function classes.
  • State-of-the-art exchangeable results are recovered as special cases.
  • Projection-based and sampling-based algorithms enable computation for high-dimensional observations and large groups.
  • Empirical results indicate more informative and stable conditional coverage with improved accuracy on hierarchical and network data.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The approach could support uncertainty quantification for predictors on relational or graph data where symmetries are natural.
  • Sampling-based computation may extend to continuous symmetry groups such as rotations by drawing finite approximations.
  • The framework might integrate with black-box models to handle heterogeneity across clusters or sub-populations in practice.
  • Extensions could address time-series or imaging data with periodic or spatial symmetries if the invariance holds.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces C-SymmPI, a framework for achieving near-conditional coverage in distribution-free predictive inference for data with group symmetries beyond exchangeability. It reformulates conditional coverage as a miscoverage error over a user-specified function class F (inspired by relaxed multi-accuracy), establishes theoretical guarantees and convergence rates under distributional invariance for linear and RKHS classes, develops projection-based and sampling-based algorithms for computational efficiency, and provides empirical results on hierarchical and network data while recovering exchangeable results as special cases.

Significance. If the central claims hold with explicit controls on approximation quality, the work would meaningfully extend predictive inference to structured non-exchangeable settings such as networks and clusters, where marginal coverage is often insufficient due to heterogeneity. The derivation of convergence rates for concrete function classes and the recovery of prior exchangeable results as special cases are positive features that strengthen the contribution.

major comments (2)
  1. [Theoretical guarantees section (around the reformulation and Theorem on near-conditional coverage)] The near-conditional coverage guarantee (abstract and main theoretical section) is stated to hold under distributional invariance, yet the bound depends on how well the user-specified class F approximates the conditional expectation induced by the group action. No explicit condition or bound on the approximation error ||E[· | group orbit] - proj_F|| is provided; without it, the guarantee can reduce to marginal coverage with arbitrarily large slack when F fails to capture cluster- or network-induced heterogeneity.
  2. [Convergence rates for linear/RKHS classes] Convergence rates are derived for linear and RKHS classes under distributional invariance. It is not shown how these rates extend to general group symmetries on networks or clusters when the function class must represent orbit-specific features (e.g., cluster indicators); the rates may not transfer without additional verification that F is rich enough relative to the group action.
minor comments (2)
  1. [Abstract] The abstract and introduction use 'near-conditional coverage' without a precise quantitative definition of the slack term; adding an explicit expression for the additive error would improve clarity.
  2. [Introduction / Preliminaries] Notation for the group action and the function class F could be introduced earlier with a small illustrative example (e.g., a simple cluster symmetry) to aid readers unfamiliar with the multi-accuracy connection.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments, which help clarify the scope and limitations of our framework. We address each major comment below and indicate the planned revisions.

read point-by-point responses

  1. Referee: [Theoretical guarantees section (around the reformulation and Theorem on near-conditional coverage)] The near-conditional coverage guarantee (abstract and main theoretical section) is stated to hold under distributional invariance, yet the bound depends on how well the user-specified class F approximates the conditional expectation induced by the group action. No explicit condition or bound on the approximation error ||E[· | group orbit] - proj_F|| is provided; without it, the guarantee can reduce to marginal coverage with arbitrarily large slack when F fails to capture cluster- or network-induced heterogeneity.

    Authors: We agree that the near-conditional guarantee is expressed in terms of the approximation quality of F to the orbit-conditional expectation, and that this slack can be large for poorly chosen F. This dependence is intentional in the relaxed multi-accuracy style reformulation, allowing users to select F according to known structure (e.g., cluster indicators). To address the concern, we will add an explicit remark in the theoretical guarantees section stating that the bound reduces to marginal coverage when F is the constant class, together with concrete guidance and examples for bounding the approximation error under common group actions such as hierarchical clustering and network symmetries. This is a partial revision that expands existing discussion rather than introducing new theorems. revision: partial

  2. Referee: [Convergence rates for linear/RKHS classes] Convergence rates are derived for linear and RKHS classes under distributional invariance. It is not shown how these rates extend to general group symmetries on networks or clusters when the function class must represent orbit-specific features (e.g., cluster indicators); the rates may not transfer without additional verification that F is rich enough relative to the group action.

    Authors: The convergence rates are derived for any linear or RKHS class satisfying the stated boundedness and invariance conditions; they therefore apply whenever the user selects an F that is rich enough to represent the relevant orbit-specific features. In the hierarchical-data experiments we already employ linear classes that include cluster indicators, which are orbit-specific. We will add a short clarifying paragraph in the convergence-rates section that explicitly verifies this richness condition for the network and cluster examples, noting that the rates carry over under the same invariance assumptions once F contains a basis for the orbit features. This revision will be made. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; derivation relies on external multi-accuracy reformulation and distributional invariance

full rationale

The paper's central step reformulates conditional coverage as miscoverage over a user-specified function class F, explicitly inspired by relaxed multi-accuracy (an external concept). Theoretical guarantees and convergence rates for linear/RKHS classes are derived from distributional invariance under group symmetries, with exchangeable results recovered as special cases. No equation or claim reduces by construction to a fitted parameter inside the paper, nor does any load-bearing premise collapse to a self-citation whose content is unverified or defined circularly within this work. The extension from SymmPI is additive rather than self-referential, and the framework remains falsifiable via approximation error of F relative to the group orbit. This is the typical self-contained case.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claim rests primarily on the domain assumption of distributional invariance under group symmetries and the modeling choice of a user-specified function class for the miscoverage reformulation; no free parameters or new invented entities are indicated in the abstract.

assumptions (1)
  • domain assumption Data distribution is invariant under the group symmetries
    Invoked to derive theoretical guarantees and convergence rates for linear and RKHS function classes.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Conditional Predictive Inference for General Structured Data with Group Symmetries." pith.science (2026). https://pith.science/paper/LWUNLZYE

@misc{pith2026260517934,
  author       = {Pith},
  title        = {Pith review of: Conditional Predictive Inference for General Structured Data with Group Symmetries},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LWUNLZYE}},
  note         = {Machine review of arXiv:2605.17934}
}
read the original abstract

We study distribution-free predictive inference for data with group symmetries, aiming to establish near-conditional coverage guarantees beyond exchangeability for structured data. While many predictive inference methods achieve a target coverage level, most provide marginal coverage. In practice, conditional predictive inference is often preferred, as it quantifies uncertainty for black-box predictions given observed attributes, thereby accommodating heterogeneity. Although many efforts have pursued efficient conditional coverage, existing methods rely on the i.i.d. or exchangeable assumption, often violated in structured settings such as networks, clusters, and imaging data. Recently, SymmPI introduced a unified approach to predictive inference under group symmetries beyond exchangeability; nevertheless, its guarantees remain marginal and do not account for population heterogeneity. To bridge this gap, we introduce C-SymmPI, a framework that achieves near-conditional coverage under general data structures with group symmetries, extending beyond exchangeability to cover networks, cluster-level data, and related structures. Inspired by relaxed multi-accuracy, our approach reformulates conditional coverage as miscoverage error over a user-specified function class. We establish theoretical guarantees under distributional invariance and distribution shift, and derive convergence rates for linear and RKHS function classes, recovering state-of-the-art results in the exchangeable setting as special cases. For computational efficiency, we develop two variants: a projection-based algorithm for high-dimensional observations, and a sampling-based algorithm for large or infinite groups. We demonstrate effectiveness on hierarchical and network data. Empirical results show that C-SymmPI delivers more informative and stable conditional coverage with improved accuracy compared to existing methods.

Figures

Figures reproduced from arXiv: 2605.17934 by the authors.

Figure 1
Figure 1. Comparison of prediction sets produced by [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Visual comparison of 90% prediction intervals for a single test point (magenta dot) from one cluster of the simulated linear heterogeneous model. Top row: Methods adaptive to the covariate X (K) nK . Bottom row: Constant-width methods. Left column: SymmPI methods that are adaptive to the hierarchical structure. Center column: Standard conformal methods that pool all data naively. Right column: Single-tree methods th… view at source ↗
Figure 3
Figure 3. Left: 90% prediction intervals for the treatment effects of cluster 145 and its individuals. Middle: Distribution of cluster-level treatment-effect interval lengths across all clusters. Right: Distribution of individual-level treatment-effect interval lengths across all individuals. citation network, which are represented by a document-word matrix and an adjacency matrix, respectively. Leveraging these features, we … view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Examples of undirected graphs along with their adjacency matrices. Relabeling the vertices of a [PITH_FULL_IMAGE:figures/full_fig_p032_4.png]
Figure 5
Figure 5. Figure 5: Left: Prediction intervals produced by C-SymmPI for selected nodes at α = 0.10. Right: Boxplots of interval lengths for C-SymmPI across all test nodes, stratified by predicted-probability region. assumption is less restrictive than the joint exchangeability condition i…

Discussion (0). Continue with ORCID to comment.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Conformal Prediction for Dyadic Regression Under Complex Missingness

    math.ST 2026-06 unverdicted novelty 7.0 of 10

    Introduces finite-sample valid conformal procedures for jointly exchangeable arrays under missingness and proves asymptotic conditional validity for weighted conformal prediction under a graphon missingness model and MNAR.

Reference graph

Works this paper leans on

113 extracted references · 113 canonical work pages · cited by 1 Pith paper

  1. [4]

    Artin, M. (2018). Algebra . Pearson, 2nd edition

    work page 2018

  2. [5]

    Barber, R. F. (2020). Is distribution-free inference possible for binary regression?

    work page 2020

  3. [6]

    F., Candes, E

    Barber, R. F., Candes, E. J., Ramdas, A., and Tibshirani, R. J. (2023). Conformal prediction beyond exchangeability. The Annals of Statistics , 51(2):816--845

    work page 2023

  4. [7]

    and Barber, R

    Bian, M. and Barber, R. F. (2023). Training-conditional coverage for distribution-free predictive inference. Electronic Journal of Statistics , 17(2):2044--2066

    work page 2023

  5. [8]

    Bickel, P. J. and Chen, A. (2009). A nonparametric view of network models and newman--girvan and other modularities. Proceedings of the National Academy of Sciences , 106(50):21068--21073

    work page 2009

  6. [9]

    and Elisseeff, A

    Bousquet, O. and Elisseeff, A. (2002). Stability and generalization. J. Mach. Learn. Res. , 2:499--526

    work page 2002

  7. [10]

    Chernozhukov, V., W \"u thrich, K., and Yinchu, Z. (2018). Exact and robust conformal inference methods for predictive machine learning with dependent data. In Conference On learning theory , pages 732--749. PMLR

    work page 2018

  8. [11]

    Chernozhukov, V., W \"u thrich, K., and Zhu, Y. (2021). Distributional conformal prediction. Proceedings of the National Academy of Sciences , 118(48):e2107794118

    work page 2021

Show all 113 references
  1. [12]

    A., Elder, C

    DeBar, L., Mayhew, M., Benes, L., Bonifay, A., Deyo, R. A., Elder, C. R., Keefe, F. J., Leo, M. C., McMullen, C., Owen-Smith, A., et al. (2022). A primary care--based cognitive behavioral therapy intervention for long-term opioid users with chronic pain: a randomized pragmatic...

    2022

  2. [13]

    Diaconis, P. (1988). Group representations in probability and statistics. Lecture notes-monograph series , 11:i--192

    1988

  3. [14]

    and Spalsbury, A

    Diestel, J. and Spalsbury, A. (2014). The joys of Haar measure . American Mathematical Soc

    2014

  4. [15]

    Dixon, J. D. and Mortimer, B. (1996). Permutation groups , volume 163. Springer Science & Business Media

    1996

  5. [16]

    and Yu, M

    Dobriban, E. and Yu, M. (2024). Symmpi: Predictive inference for data with group symmetries

    2024

  6. [17]

    Duchi, J. C. (2025). A few observations on sample-conditional coverage in conformal prediction

    2025

  7. [18]

    Dunn, R., Wasserman, L., and Ramdas, A. (2023). Distribution-free prediction sets for two-layer hierarchical models. Journal of the American Statistical Association , 118(544):2491--2502

    2023

  8. [19]

    Finzi, M., Stanton, S., Izmailov, P., and Wilson, A. G. (2020). Generalizing convolutional neural networks for equivariance to lie groups on arbitrary continuous data. In International conference on machine learning , pages 3165--3176. PMLR

    2020

  9. [20]

    J., Ramdas, A., and Tibshirani, R

    Foygel Barber, R., Candes, E. J., Ramdas, A., and Tibshirani, R. J. (2021). The limits of distribution-free conditional predictive inference. Information and Inference: A Journal of the IMA , 10(2):455--482

    2021

  10. [22]

    J., and Cand \`e s, E

    Gibbs, I., Cherian, J. J., and Cand \`e s, E. J. (2025). Conformal prediction with conditional guarantees. Journal of the Royal Statistical Society Series B: Statistical Methodology , page qkaf008

    2025

  11. [23]

    S., Riley, P

    Gilmer, J., Schoenholz, S. S., Riley, P. F., Vinyals, O., and Dahl, G. E. (2017). Neural message passing for quantum chemistry. In International conference on machine learning , pages 1263--1272. Pmlr

    2017

  12. [24]

    Giri, N. C. (1996). Group invariance in statistical inference . World Scientific

    1996

  13. [25]

    Guan, L. (2023). Localized conformal prediction: A generalized inference framework for conformal prediction. Biometrika , 110(1):33--50

    2023

  14. [26]

    H \'e bert-Johnson, U., Kim, M., Reingold, O., and Rothblum, G. (2018). Multicalibration: Calibration for the (computationally-identifiable) masses. In International Conference on Machine Learning , pages 1939--1948. PMLR

    2018

  15. [27]

    and Barber, R

    Hore, R. and Barber, R. F. (2024). Conformal prediction with local weights: randomization enables local guarantees

    2024

  16. [28]

    Huang, K., Jin, Y., Candes, E., and Leskovec, J. (2023). Uncertainty quantification over graph with conformalized graph neural networks. Advances in Neural Information Processing Systems , 36:26699--26721

    2023

  17. [29]

    P., Ghorbani, A., and Zou, J

    Kim, M. P., Ghorbani, A., and Zou, J. (2019). Multiaccuracy: Black-box post-processing for fairness in classification. In Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society , pages 247--254

    2019

  18. [30]

    and Bassett Jr, G

    Koenker, R. and Bassett Jr, G. (1978). Regression quantiles. Econometrica: journal of the Econometric Society , pages 33--50

    1978

  19. [31]

    S., Henderson, D., Howard, R

    LeCun, Y., Boser, B., Denker, J. S., Henderson, D., Howard, R. E., Hubbard, W., and Jackel, L. D. (1989). Backpropagation applied to handwritten zip code recognition. Neural computation , 1(4):541--551

    1989

  20. [32]

    and Barber, R

    Lee, Y. and Barber, R. (2021). Distribution-free inference for regression: discrete, continuous, and in between. Advances in Neural Information Processing Systems , 34:7448--7459

    2021

  21. [34]

    and Ren, Z

    Lee, Y. and Ren, Z. (2025). Conditional predictive inference with l^k -coverage control

    2025

  22. [35]

    and Barber, R

    Liang, R. and Barber, R. F. (2025). Algorithmic stability implies training-conditional coverage for distribution-free prediction methods. The Annals of Statistics , 53(4):1457--1482

    2025

  23. [36]

    Lunde, R., Levina, E., and Zhu, J. (2023). Conformal prediction for network-assisted regression

    2023

  24. [37]

    Ma, Z., Ma, Z., and Yuan, H. (2020). Universal latent space model fitting for large networks with edge covariates. Journal of Machine Learning Research , 21(4):1--67

    2020

  25. [38]

    Manski, C. F. (1993). Identification of endogenous social effects: The reflection problem. The review of economic studies , 60(3):531--542

    1993

  26. [39]

    K., Nigam, K., Rennie, J., and Seymore, K

    McCallum, A. K., Nigam, K., Rennie, J., and Seymore, K. (2000). Automating the construction of internet portals with machine learning. Information Retrieval , 3(2):127--163

    2000

  27. [40]

    and Candes, E

    Medarametla, D. and Candes, E. (2021). Distribution-free conditional median inference. Electronic Journal of Statistics , 15(2):4625--4658

    2021

  28. [41]

    Nachbin, L. (1976). The haar integral, re krieger pub

    1976

  29. [42]

    Papadopoulos, H., Proedrou, K., Vovk, V., and Gammerman, A. (2002). Inductive confidence machines for regression. In European conference on machine learning , pages 345--356. Springer

    2002

  30. [44]

    Park, S., Dobriban, E., Lee, I., and Bastani, O. (2022). Pac prediction sets for meta-learning. Advances in neural information processing systems , 35:37920--37931

    2022

  31. [45]

    Qiu, H., Dobriban, E., and Tchetgen Tchetgen, E. (2023). Prediction sets adaptive to unknown covariate shift. Journal of the Royal Statistical Society Series B: Statistical Methodology , 85(5):1680--1705

    2023

  32. [46]

    Romano, Y., Patterson, E., and Candes, E. (2019). Conformalized quantile regression. Advances in neural information processing systems , 32

    2019

  33. [47]

    Romano, Y., Sesia, M., and Candes, E. (2020). Classification with valid and adaptive coverage. Advances in neural information processing systems , 33:3581--3591

    2020

  34. [48]

    Sch \"o lkopf, B., Herbrich, R., and Smola, A. J. (2001). A generalized representer theorem. In International conference on computational learning theory , pages 416--426. Springer

    2001

  35. [49]

    and Vovk, V

    Shafer, G. and Vovk, V. (2008). A tutorial on conformal prediction. Journal of Machine Learning Research , 9(3)

    2008

  36. [51]

    J., Foygel Barber, R., Candes, E., and Ramdas, A

    Tibshirani, R. J., Foygel Barber, R., Candes, E., and Ramdas, A. (2019). Conformal prediction under covariate shift. Advances in neural information processing systems , 32

    2019

  37. [52]

    Vovk, V. (2012). Conditional validity of inductive conformal predictors. In Asian conference on machine learning , pages 475--490. PMLR

    2012

  38. [53]

    Vovk, V., Gammerman, A., and Shafer, G. (2005). Algorithmic learning in a random world . Springer

    2005

  39. [55]

    Xie, R., Barber, R., and Candes, E. (2024). Boosted conformal prediction intervals. Advances in Neural Information Processing Systems , 37:71868--71899

    2024

  40. [56]

    Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.-i., and Jegelka, S. (2018). Representation learning on graphs with jumping knowledge networks. In International conference on machine learning , pages 5453--5462. pmlr

    2018

  41. [57]

    K., and Tchetgen Tchetgen, E

    Yang, Y., Kuchibhotla, A. K., and Tchetgen Tchetgen, E. (2024). Doubly robust calibration of prediction sets under covariate shift. Journal of the Royal Statistical Society Series B: Statistical Methodology , 86(4):943--965

    2024

  42. [58]

    and Candès, E

    Zhang, Y. and Candès, E. J. (2024). Posterior conformal prediction

    2024

  43. [59]

    2023 , eprint=

    Conformal Prediction for Network-Assisted Regression , author=. 2023 , eprint=

    2023

  44. [60]

    Stability and Generalization

    Bousquet, Olivier and Elisseeff, André , biburl =. Stability and Generalization. , url =. J. Mach. Learn. Res. , keywords =

  45. [61]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , pages=

    Conformal prediction with conditional guarantees , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , pages=. 2025 , publisher=

    2025

  46. [62]

    2024 , eprint=

    SymmPI: Predictive Inference for Data with Group Symmetries , author=. 2024 , eprint=

    2024

  47. [63]

    2005 , publisher=

    Algorithmic learning in a random world , author=. 2005 , publisher=

    2005

  48. [64]

    Information and Inference: A Journal of the IMA , volume=

    The limits of distribution-free conditional predictive inference , author=. Information and Inference: A Journal of the IMA , volume=. 2021 , publisher=

    2021

  49. [65]

    Advances in neural information processing systems , volume=

    Conformalized quantile regression , author=. Advances in neural information processing systems , volume=

  50. [66]

    2024 , eprint=

    Posterior Conformal Prediction , author=. 2024 , eprint=

    2024

  51. [67]

    2024 , eprint=

    Conformal prediction with local weights: randomization enables local guarantees , author=. 2024 , eprint=

    2024

  52. [68]

    2025 , eprint=

    A Few Observations on Sample-Conditional Coverage in Conformal Prediction , author=. 2025 , eprint=

    2025

  53. [69]

    arXiv preprint arXiv:2401.01977 , year=

    Conformal causal inference for cluster randomized trials: Model-robust inference without asymptotic approximations , author=. arXiv preprint arXiv:2401.01977 , year=

  54. [70]

    , author=

    A tutorial on conformal prediction. , author=. Journal of Machine Learning Research , volume=

  55. [71]

    arXiv preprint arXiv:2107.07511 , year=

    A gentle introduction to conformal prediction and distribution-free uncertainty quantification , author=. arXiv preprint arXiv:2107.07511 , year=

    arXiv

  56. [72]

    arXiv preprint arXiv:2411.11824 , year=

    Theoretical foundations of conformal prediction , author=. arXiv preprint arXiv:2411.11824 , year=

    arXiv

  57. [73]

    European conference on machine learning , pages=

    Inductive confidence machines for regression , author=. European conference on machine learning , pages=. 2002 , organization=

    2002

  58. [74]

    2020 , eprint=

    Is distribution-free inference possible for binary regression? , author=. 2020 , eprint=

    2020

  59. [75]

    Advances in Neural Information Processing Systems , volume=

    Distribution-free inference for regression: discrete, continuous, and in between , author=. Advances in Neural Information Processing Systems , volume=

  60. [76]

    Electronic Journal of Statistics , volume=

    Distribution-free conditional median inference , author=. Electronic Journal of Statistics , volume=. 2021 , publisher=

    2021

  61. [77]

    Proceedings of the National Academy of Sciences , volume=

    Distributional conformal prediction , author=. Proceedings of the National Academy of Sciences , volume=. 2021 , publisher=

    2021

  62. [78]

    Biometrika , volume=

    Localized conformal prediction: A generalized inference framework for conformal prediction , author=. Biometrika , volume=. 2023 , publisher=

    2023

  63. [79]

    Advances in Neural Information Processing Systems , volume=

    Boosted conformal prediction intervals , author=. Advances in Neural Information Processing Systems , volume=

  64. [80]

    Asian conference on machine learning , pages=

    Conditional validity of inductive conformal predictors , author=. Asian conference on machine learning , pages=. 2012 , organization=

    2012

  65. [81]

    Journal of the ACM (JACM) , volume=

    Distribution-free, risk-controlling prediction sets , author=. Journal of the ACM (JACM) , volume=. 2021 , publisher=

    2021

  66. [82]

    Electronic Journal of Statistics , volume=

    Training-conditional coverage for distribution-free predictive inference , author=. Electronic Journal of Statistics , volume=. 2023 , publisher=

    2023

  67. [83]

    The Annals of Statistics , volume=

    Algorithmic stability implies training-conditional coverage for distribution-free prediction methods , author=. The Annals of Statistics , volume=. 2025 , publisher=

    2025

  68. [84]

    arXiv preprint arXiv:2502.20579 , year=

    Characterizing the Training-Conditional Coverage of Full Conformal Inference in High Dimensions , author=. arXiv preprint arXiv:2502.20579 , year=

  69. [85]

    Journal of the American Statistical Association , volume=

    Distribution-free prediction sets for two-layer hierarchical models , author=. Journal of the American Statistical Association , volume=. 2023 , publisher=

    2023

  70. [86]

    arXiv preprint arXiv:2306.06342 , year=

    Distribution-free inference with hierarchical data , author=. arXiv preprint arXiv:2306.06342 , year=

  71. [87]

    Conference On learning theory , pages=

    Exact and robust conformal inference methods for predictive machine learning with dependent data , author=. Conference On learning theory , pages=. 2018 , organization=

    2018

  72. [88]

    Advances in neural information processing systems , volume=

    Conformal prediction under covariate shift , author=. Advances in neural information processing systems , volume=

  73. [89]

    The Annals of Statistics , volume=

    Conformal prediction beyond exchangeability , author=. The Annals of Statistics , volume=. 2023 , publisher=

    2023

  74. [90]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Prediction sets adaptive to unknown covariate shift , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2023 , publisher=

    2023

  75. [91]

    arXiv preprint arXiv:2310.12964 , year=

    PAC prediction sets under label shift , author=. arXiv preprint arXiv:2310.12964 , year=

  76. [92]

    Advances in Neural Information Processing Systems , volume=

    Uncertainty quantification over graph with conformalized graph neural networks , author=. Advances in Neural Information Processing Systems , volume=

  77. [93]

    Uncertainty in artificial intelligence , pages=

    Distribution-free uncertainty quantification for classification under label shift , author=. Uncertainty in artificial intelligence , pages=. 2021 , organization=

    2021

  78. [94]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Conformal inference of counterfactuals and individual treatment effects , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2021 , publisher=

    2021

  79. [95]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Conformalized survival analysis , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2023 , publisher=

    2023

  80. [96]

    Proceedings of the National Academy of Sciences , volume=

    Conformal prediction under feedback covariate shift for biomolecular design , author=. Proceedings of the National Academy of Sciences , volume=. 2022 , publisher=

    2022

  81. [97]

    2025 , eprint=

    Conditional predictive inference with L^k -coverage control , author=. 2025 , eprint=

    2025

  82. [98]

    2018 , edition =

    Algebra , author =. 2018 , edition =

    2018

  83. [99]

    2014 , publisher=

    The joys of Haar measure , author=. 2014 , publisher=

    2014

  84. [100]

    International Conference on Machine Learning , pages=

    Multicalibration: Calibration for the (computationally-identifiable) masses , author=. International Conference on Machine Learning , pages=. 2018 , organization=

    2018

  85. [101]

    Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society , pages=

    Multiaccuracy: Black-box post-processing for fairness in classification , author=. Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society , pages=

    2019

  86. [102]

    Econometrica: journal of the Econometric Society , pages=

    Regression quantiles , author=. Econometrica: journal of the Econometric Society , pages=. 1978 , publisher=

    1978

  87. [103]

    1996 , publisher=

    Permutation groups , author=. 1996 , publisher=

    1996

  88. [104]

    International conference on machine learning , pages=

    Neural message passing for quantum chemistry , author=. International conference on machine learning , pages=. 2017 , organization=

    2017

  89. [105]

    International conference on machine learning , pages=

    Representation learning on graphs with jumping knowledge networks , author=. International conference on machine learning , pages=. 2018 , organization=

    2018

  90. [106]

    International conference on computational learning theory , pages=

    A generalized representer theorem , author=. International conference on computational learning theory , pages=. 2001 , organization=

    2001

  91. [107]

    Advances in neural information processing systems , volume=

    PAC prediction sets for meta-learning , author=. Advances in neural information processing systems , volume=

  92. [108]

    Proceedings of the National Academy of Sciences , volume=

    A nonparametric view of network models and Newman--Girvan and other modularities , author=. Proceedings of the National Academy of Sciences , volume=. 2009 , publisher=

    2009

  93. [109]

    The review of economic studies , volume=

    Identification of endogenous social effects: The reflection problem , author=. The review of economic studies , volume=. 1993 , publisher=

    1993

  94. [110]

    Annals of Internal Medicine , volume=

    A primary care--based cognitive behavioral therapy intervention for long-term opioid users with chronic pain: a randomized pragmatic trial , author=. Annals of Internal Medicine , volume=. 2022 , publisher=

    2022

  95. [111]

    Information Retrieval , volume=

    Automating the construction of internet portals with machine learning , author=. Information Retrieval , volume=. 2000 , publisher=

    2000

  96. [112]

    Journal of Machine Learning Research , volume=

    Universal latent space model fitting for large networks with edge covariates , author=. Journal of Machine Learning Research , volume=

  97. [113]

    Advances in neural information processing systems , volume=

    Classification with valid and adaptive coverage , author=. Advances in neural information processing systems , volume=

  98. [114]

    1996 , publisher=

    Group invariance in statistical inference , author=. 1996 , publisher=

    1996

  99. [115]

    Lecture notes-monograph series , volume=

    Group representations in probability and statistics , author=. Lecture notes-monograph series , volume=. 1988 , publisher=

    1988

  100. [116]

    1976 , publisher=

    The Haar integral, RE Krieger Pub , author=. 1976 , publisher=

    1976

  101. [117]

    arXiv preprint arXiv:2402.13042 , year=

    Not all distributional shifts are equal: Fine-grained robust conformal inference , author=. arXiv preprint arXiv:2402.13042 , year=

  102. [118]

    arXiv preprint arXiv:2106.09848 , year=

    PAC prediction sets under covariate shift , author=. arXiv preprint arXiv:2106.09848 , year=

  103. [119]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Doubly robust calibration of prediction sets under covariate shift , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2024 , publisher=

    2024

  104. [120]

    Neural computation , volume=

    Backpropagation applied to handwritten zip code recognition , author=. Neural computation , volume=. 1989 , publisher=

    1989

  105. [121]

    International conference on machine learning , pages=

    Generalizing convolutional neural networks for equivariance to lie groups on arbitrary continuous data , author=. International conference on machine learning , pages=. 2020 , organization=

    2020

Pith tools

Reviewed May 20, 2026 · model on record in the stance chip above.