Transductive conformal predictors

This paper discusses a transductive version of conformal predictors. This version is computationally inefficient for big test sets, but it turns out that apparently crude “Bonferroni predictors” are about as good in their information efficiency and vastly superior in computational efficiency.

[1]  Alexander Gammerman,et al.  Conformal Prediction under Hypergraphical Models , 2013, AIAI.

[2]  Shun-ichi Amari,et al.  A Theory of Pattern Recognition , 1968 .

[3]  Alexander Gammerman,et al.  Machine learning classification with confidence: Application of transductive conformal predictors to MRI-based diagnostic and prognostic markers in depression , 2011, NeuroImage.

[4]  Harris Papadopoulos,et al.  Qualified Prediction for Large Data Sets in the Case of Pattern Recognition , 2002, International Conference on Machine Learning and Applications.

[5]  Raghu Kacker,et al.  Digital Library of Mathematical Functions , 2003 .

[6]  E. Lehmann,et al.  Nonparametrics: Statistical Methods Based on Ranks , 1976 .

[7]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[8]  Yann LeCun,et al.  Efficient Pattern Recognition Using a New Transformation Distance , 1992, NIPS.

[9]  Vladimir Vovk,et al.  On-line confidence machines are well-calibrated , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[10]  W. Gasarch,et al.  The Book Review Column 1 Coverage Untyped Systems Simple Types Recursive Types Higher-order Systems General Impression 3 Organization, and Contents of the Book , 2022 .

[11]  Vladimir Vovk,et al.  Cross-conformal predictors , 2012, Annals of Mathematics and Artificial Intelligence.

[12]  E. Lehmann.  Testing Statistical Hypotheses , 1960 .

[13]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[14]  Henrik Boström,et al.  Evolved decision trees as conformal predictors , 2013, 2013 IEEE Congress on Evolutionary Computation.