This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Fast Online Value-Maximizing Prediction Sets with Conformal Cost Control

Zhen Lin    Shubhendu Trivedi    Cao Xiao    Jimeng Sun
Abstract

Many real-world multi-label prediction problems involve set-valued predictions that must satisfy specific requirements dictated by downstream usage. We focus on a typical scenario where such requirements, separately encoding value and cost, compete with each other. For instance, a hospital might expect a smart diagnosis system to capture as many severe, often co-morbid, diseases as possible (the value), while maintaining strict control over incorrect predictions (the cost). We present a general pipeline, dubbed as FavMac, to maximize the value while controlling the cost in such scenarios. FavMac can be combined with almost any multi-label classifier, affording distribution-free theoretical guarantees on cost control. Moreover, unlike prior works, it can handle real-world large-scale applications via a carefully designed online update mechanism, which is of independent interest. Our methodological and theoretical contributions are supported by experiments on several healthcare tasks and synthetic datasets - FavMac furnishes higher value compared with several variants and baselines while maintaining strict cost control. Our code is available at https://github.com/zlin7/FavMac

Conformal Prediction, Prediction Sets, Online Prediction, Healthcare Applications

For each data xix_{i}, sort 𝒰(xi)\mathcal{U}(x_{i}) as [Si,(1),,Si,(M)][S_{i,(1)},\ldots,S_{i,(M)}] such that c^(Si,(j))c^(Si,(j+1))\hat{c}(S_{i,(j)})\leq\hat{c}(S_{i,(j+1)}). Assuming x\forall x, 𝒰(x)\emptyset\in\mathcal{U}(x) and C(;Z)=C^(;X)=0C(\emptyset;Z)=\hat{C}(\emptyset;X)=0. Let {aligncustomsize} c^+_i,(j)