Conformal prediction is a generic methodology for finite-sample valid distribution-free prediction. This technique has garnered a lot of attention in the literature partly because it can be applied with any machine learning algorithm that provides point predictions to yield valid prediction regions. Of course, the efficiency (width/volume) of the resulting prediction region depends on the performance of the machine learning algorithm. In this paper, we consider the problem of obtaining the smallest conformal prediction region given a family of machine learning algorithms. We provide two general-purpose selection algorithms and consider coverage as well as width properties of the final prediction region. The first selection method yields the smallest width prediction region among the family of conformal prediction regions for all sample sizes, but only has an approximate coverage guarantee. The second selection method has a finite sample coverage guarantee but only attains close to the smallest width. The approximate optimal width property of the second method is quantified via an oracle inequality. Asymptotic oracle inequalities are also considered when the family of algorithms is given by ridge regression with different penalty parameters.
翻译:复杂预测是一种通用的方法,用于有限抽样有效无分布式预测。这一技术在文献中引起了许多注意,部分原因是它可以用于任何机器学习算法,提供点预测,以产生有效的预测区域。当然,由此得出的预测区域的效率(宽/容量)取决于机器学习算法的性能。在本文中,我们考虑了获得最小的符合预测区域的问题,并给出了一套机器学习算法。我们提供了两种通用选择算法,并考虑了最后预测区域的覆盖范围和宽度特性。第一个选择法为所有样本大小的符合预测区域提供了最小的宽度预测区域,但只有大致的覆盖面保证。第二个选择法具有有限的抽样范围保证,但只达到最小的宽度。第二种方法的大致最佳宽度属性通过一个或骨骼的不平等加以量化。当使用不同惩罚参数的山脊回归来给出算法时,也考虑了亚性或末性不平等。