Towards Human-AI Complementarity with Prediction Sets

Authors: giovanni  de toni
nastaran  okati
suhas  thejaswi
eleni  straitouri
manuel  gomez-rodriguez
Venue: NeurIPS_cc_2024_Conference
Published: 2024-05-15 12:12:31

Abstract: Decision support systems based on prediction sets have proven to be effective at helping human experts solve classification tasks. Rather than providing single-label predictions, these systems provide sets of label predictions constructed using conformal prediction, namely prediction sets, and ask human experts to predict label values from these sets. In this paper, we first show that the prediction sets constructed using conformal prediction are, in general, suboptimal in terms of average accuracy. Then, we show that the problem of finding the optimal prediction sets under which the human experts achieve the highest average accuracy is NP-hard. More strongly, unless P = NP, we show that the problem is hard to approximate to any factor less than the size of the label set. However, we introduce a simple and efficient greedy algorithm that, for a large class of expert models and non-conformity scores, is guaranteed to find prediction sets that provably offer equal or greater performance than those constructed using conformal prediction. Further, using a simulation study with both synthetic and real expert predictions, we demonstrate that, in practice, our greedy algorithm finds near-optimal prediction sets offering greater performance than conformal prediction.

Main paper: 
 introduction: 
 In recent years, there has been increasing excitement about the potential of decision support systems based on machine learning to help human experts make more accurate predictions in a variety of application domains, including medicine, education and science [1] [2] [3] . In this context, the ultimate goal is human-AI complementarity-the predictions made by the human expert who uses a decision support system are more accurate than the predictions made by the expert on their own and by the classifier used by the decision support system [4] [5] [6] [7] [8] .The conventional wisdom is that to achieve human-AI complementarity, decision support systems should help humans understand when and how to use their predictions to update their own. As a result, a flurry of empirical studies has analyzed how factors such as confidence, explanations, or calibration influence when and how humans use the predictions provided by a decision support system [9] [10] [11] [12] . Unfortunately, these studies have been so far inconclusive and it is yet unclear how to design decision support systems that achieve human-AI complementarity [13] [14] [15] [16] [17] .In this context, Straitouri et al. [18, 19] have recently argued, both theoretically and empirically, that an alternative type of decision support systems may achieve human-AI complementarity, by design. Rather than providing a single label prediction and letting a human expert decide when and how to use the predicted label to update their own prediction, these systems provide a set of label predictions, namely a prediction set, and ask the expert to predict a label value from the set. 2 To construct each prediction set, these systems rely on a conformal predictor [20, 21] . The conformal predictor first computes a non-conformity score for each potential label value using the output provided by a classifier (e.g., the softmax scores), and then adds a label value to the prediction set if its nonconformity score is below a data-driven threshold computed using a calibration set. Further, to optimize the performance of these systems, Straitouri et al. have introduced several methods to efficiently find the optimal value of the threshold used by the conformal predictor. 3 However, it is unclear whether the optimal prediction sets maximizing the average accuracy achieved by an expert who uses such systems can always be constructed using a deterministic threshold rule as the one used by a conformal predictor. Motivated by this observation, in this work, our goal is to understand how to construct optimal prediction sets under which human experts achieve the highest average accuracy.Our contributions. We first demonstrate that there exist (many) data distributions for which the optimal prediction sets under which the human experts achieve the highest average accuracy cannot be constructed using a conformal predictor. Then, we show that the problem of finding the optimal prediction sets is NP-hard by using a reduction from the k-clique problem [22] . More strongly, unless P = NP, we show that the problem is hard to approximate to any factor less than the size of the label set. However, we introduce a simple and computationally efficient greedy algorithm that, for a large class of non-conformity scores and expert models parameterized by a mixture of multinomial logit models (MNLs), is guaranteed to find prediction sets that provably offer equal or greater performance than those constructed using conformal prediction. Moreover, using a simulation study with both synthetic and real expert predictions, we demonstrate that, in practice, our greedy algorithm finds near-optimal prediction sets offering greater performance than conformal prediction. We have released an open-source implementation of our greedy algorithm as well as the code and data used in our experiments at https://github.com/Networks-Learning/ towards-human-ai-complementarity-predictions-sets.Further related work. Our work builds upon further related work on set-valued predictors, assortment optimization, and learning under algorithmic triage.The literature on set-valued predictors aims to develop predictors that, for each sample, output a set of label values, namely a prediction set [23] . Set-valued predictors have not been designed nor evaluated by their ability to help human experts make more accurate predictions [24] [25] [26] [27] , except for a few notable exceptions [18, 19, [28] [29] [30] . These exceptions provide empirical evidence that conformal predictors, a specific type of set-valued predictors, may help human experts make more accurate predictions. Among these exceptions, the work by Straitouri et al. [18, 19] , which we have already discussed previously, is most related to ours. In this context, it is also worth noting that a recent theoretical study has argued that prediction sets may also help experts create more accurate rankings [31] .The literature on assortment optimization aims to develop methods to help a seller select a subset of products from a universe of substitutable products, namely an assortment, with maximum expected revenue [32] [33] [34] [35] [36] . Within this literature, the work most closely related to ours tackles the assortment optimization problem under customization [35, 36] , where there are different types of customers and each type of customer chooses products following a different multinomial logit model. More specifically, by mapping products to label values, types of customers to ground truth label values, and revenue to accuracy, one could think of our problem as an assortment optimization problem Figure 1 : Our automated decision support system. Given an instance with a feature vector x, the system C helps the expert by automatically narrowing down the set of potential label values to a prediction set S(x) ⊆ Y. The system asks the expert to predict a label value ŷ from S(x).under customization. However, in the assortment optimization problem under customization, the type of each customer is known and thus may be offered different subsets of products whereas, in our problem, the ground truth label is unknown. As a result, (the complexity of) our problem and our technical contributions are fundamentally different.The literature on learning under algorithmic triage aims to develop classifiers that make predictions for a given fraction of the samples and leave the remaining ones to human experts, as instructed by a triage policy [37] [38] [39] [40] [41] [42] . In contrast, in our work, for each sample, a classifier is used to construct a prediction set and a human expert needs to predict a label value from the set. In this context, it is also worth noting that learning under algorithmic triage has been extended to reinforcement learning settings [43] [44] [45] [46] . 
decision support systems based on prediction sets: 
 Given a multiclass classification task where, for each task instance, a human expert needs to predict the value of a ground truth label y ∈ Y = {1, . . . , L}, we focus on the design of a decision support system that, given a set of features x ∈ X , helps the expert by narrowing down the set of potential label values to a subset of them S(x) ⊆ Y. Here, similarly as in Straitouri et al. [18, 19] , we assume that, for any instance with features x ∈ X , the system asks the expert's prediction ŷ ∈ Y to belong to the prediction set S(x), i.e., ŷ ∈ S(x). The key rationale for restricting the expert's agency is that, if we would allow the expert to predict label values from outside the prediction set, a good performance would depend on the expert developing a good understanding of when to predict a label from the prediction set. In this context, it is worth highlighting that Straitouri et al. [19] run a large-scale human subject study to compare the above setting against an alternative setting where experts are allowed to predict label values from outside the prediction sets. They found that, in the alternative setting, the number of predictions in which the prediction sets do not contain the true label and the experts succeed is consistently smaller than the number of predictions in which the prediction sets contain the true label and the experts fail. As a consequence, in the alternative setting, experts perform worse. Refer to Figure 1 for an illustration of the decision support system. Then, for any x ∈ X , our goal is to find the optimal prediction set S * (x) that maximizes the average accuracy of the expert's prediction, 4 i.e.,EQUATIONwhere P (Y | X) denotes the conditional distribution of the ground-truth label Y and P S ( Ŷ | X, Y ) denotes the conditional distribution of the expert's predictions Ŷ under the prediction set S. 5 
on the suboptimality of conformal prediction: 
 Given a user-specified parameter α ∈ [0, 1], a conformal predictor uses a choice of non-conformity score s : X × Y → R and a calibration set D cal = {(x i , y i )} m i=1 , where (x i , y i ) ∼ P (X)P (Y | X), to construct the prediction sets S(X) = S cp (X) as follows:EQUATIONwhere qα is the ⌈(m + 1)(1α)⌉/m empirical quantile of the non-conformity scores of the samples in the calibration set D cal . By using the above construction, the conformal predictor guarantees that the probability that the true label Y belongs to the subset S cp (X) is almost exactly 1α, i.e., 1α ≤ P (Y ∈ S cp (X)) ≤ 1α + 1/(m + 1), as shown elsewhere [20, 21] .Under common choices of non-conformity scores [48, 49] , there are many data distributions for which the optimal prediction set under which the human expert achieves the highest accuracy cannot be constructed using a conformal predictor. Consider the following example where Y = {1, 2, 3} and,P (Y = y | X = x) =    0.4 if y = 1 0.35 if y = 2 0.25 if y = 3 and P S ( Ŷ = ŷ | X = x, Y = y) = C ŷy y ′ ∈S C y ′ y , where C 1,1 = C 2,1 = C 3,1 = 0.33, C 1,2 = C 1,3 = 0.4, C 2,2 = C 3,3 = 0.6, and C 3,2 = C 2,3 = 0.A brute force search reveals that the optimal prediction set is {2, 3} and, under this set, the expert achieves accuracy 0.6. Now, assume we have access to a perfectly calibrated classifier f (x) ∈ [0, 1] L , i.e., for all x ∈ X and y ∈ Y, it holds that f y (x) = P (Y = y | X = x). Then, for any choice of α ∈ [0, 1], as long as the non-conformity scores rank the label set in decreasing order of f y (x), the prediction set provided by conformal prediction can only be among the sets {∅, {1} , {1, 2} , {1, 2, 3}}. Among these sets, the set under which the expert achieves the highest accuracy is {1, 2, 3} and, under this set, the expert achieves accuracy 0.49 < 0.6. Motivated by the above example, one may think of closing the above performance gap by incorporating information about the distribution of experts' predictions in the definition of the non-conformity score. However, we cannot expect to fully close the performance gap since, as we will show next, the problem of finding the optimal prediction sets is NP-hard to solve and approximate to any factor less than the size of the label set Y. 
on the hardness of finding the optimal prediction sets: 
 In this section, we first show that, given x ∈ X , we cannot expect to find the optimal prediction set S * (x) that maximizes the accuracy of the expert's prediction in polynomial time: 6Theorem 1 The problem of finding the optimal prediction set, as defined in Eq. 1, is NP-hard.In the proof of the above theorem, we first reduce the k-clique problem, 7 which is known to be NP-complete [22] , to an instance of the problem of deciding whether there exists a prediction set S ⊆ Y such that g(S | x) ≥ B given a constant B > 0. More specifically, given a k-clique problem defined over a graph G = (V, E) with k ≤ |V|, we reduce it to an instance of the above decision problem in which Y = V, B = k |V| and, for all y ∈ Y, we have thatP (Y = y | X = x) = 1 |V| and P S ( Ŷ = ŷ | X = x, Y = y) = C ŷy y ′ ∈S C y ′ ywhereEQUATIONand N G (y) denotes the number of vertices that are not adjacent to y. Then, since the above decision problem can be trivially reduced to the problem of finding the optimal prediction set (in polynomial time), we conclude that the problem is NP-hard.Motivated by the above result, we may think in looking for desirable properties for the objective function g(S | x) such as monotonicity and submodularity, 8 approximation algorithms with non-trivial approximation guarantees [50] . Unfortunately, there are many data distributions for which the objective function is neither monotone nor submodular. For example, assume Y = {1, 2, 3}, In fact, the following theorem shows that we cannot expect to find a polynomial-time algorithm to find a non-trivial approximation to our problem:P (Y = y | X = x) =    0.4 if y = 1 0.35 if y = 2 0.25 if y = 3 and P S ( Ŷ = ŷ | X = x, Y = y) = C ŷy y ′ ∈S C y ′ y , where C 1,1 = 0.2, C 1,2 = C 2,1 = C 1,3 = C 3,1 = 0.4, C 2,2 = C 3,3 = 0.6 and C 2,3 = C 3,2 = 0. For S = {1} ⊆ T = {1, 2} ⊂ Y, it holds that g(S | x) = 0.4 > g(T | x) = 0.Theorem 2 The problem of finding the optimal prediction set, as defined in Eq. 1, is NP-hard to approximate to any factor less than the size L of the label set Y.In the proof of the above theorem, we first show that, given a polynomial-time α-approximation algorithm for the problem of finding the optimal prediction set, we can obtain a polynomial-time α-approximation algorithm for the problem of finding the maximum clique in a graph G = (V, E). 9Then, since it is known that, for any ϵ > 0, the latter problem is NP-hard to approximate to a factor |V| 1-ϵ [51] , we can conclude that the problem of finding the optimal prediction set is NP-hard to approximate to a factor |Y| 1-ϵ .While the above hardness results may be discouraging, in what follows, we will introduce a simple greedy algorithm that provably offers equal or greater performance than conformal prediction for a large class of non-conformity scores and expert models, and in practice, often succeeds at finding (near-)optimal prediction sets.A simple greedy algorithm. Given a sample with features x ∈ X and a prediction set S ⊆ Y, our greedy algorithm estimates the accuracy of the expert's prediction, as defined in Eq. 1, using the following estimator:EQUATIONwhere (a) approximates P (Y = y | X = x) using a well-calibrated classifier f (x) ∈ [0, 1] L and, similarly as in Straitouri et al. [18] , (b) approximates P S ( Ŷ = y | X = x, Y = y) using a mixture of multinomial logit models (MNLs) parameterized by the confusion matrix of the predictions made by the expert on their own, i.e., C y ′ y = P Y ( Ŷ = y ′ | Y = y).The greedy algorithm first ranks each label value y ∈ Y using the output f y (x) of the classifier. Let y (1) , . . . , y (L) be the label values ordered according to such a ranking, where • (i) denotes the i-th label value in the ranking and f y (i) (x) ≥ f y (j) (x) for all i < j. Importantly, the prediction sets provided by the greedy algorithm are guaranteed to achieve higher objective value ĝ than those provided by any conformal predictor using a non-conformity score s(x, y) that is nonincreasing with respect to f y (x), as formalized by the following proposition:10 Proposition 1 For any x ∈ X , let S be the prediction set provided by Algorithm 1 and S cp be the prediction set provided by any conformal prediction with a non-conformity score s(x, y) that is nonincreasing with respect to f y (x), then, it holds that ĝ(S | x) ≥ ĝ(S cp | x). 
experiments with synthetic data: 
 In this section, we compare the average accuracy achieved by different simulated human experts using prediction sets constructed with our greedy algorithm (Algorithm 1), brute force search, and conformal prediction on several synthetic multiclass classification tasks where the experts and the classifier used by the greedy algorithm, brute force search, and conformal prediction achieve different accuracies on their own. γ) . Further, we use the calibration set to calibrate the (softmax) outputs of the logistic regression model f using top-k-label calibration [52] with k = 5. We also use it to estimate the confusion matrices C(γ) that parameterize the mixture of MNLs used to model (the predictions made by) the simulated human expert, and calculate the quantile qα used by conformal prediction. Finally, we use the test set to evaluate the average accuracy achieved by the simulated expert using prediction sets constructed with our greedy algorithm, brute force search and conformal prediction. Here, note that Table 1 : Empirical average test accuracy achieved by four different (simulated) human experts, each with a different noise value γ, on their own (NONE) and using prediction sets constructed with conformal prediction (NAIVE, APS, RAPS and SAPS) and with the greedy algorithm (GREEDY) on four synthetic classification tasks. In each classification task, the classifier f used by conformal prediction and the greedy algorithm achieves a different average accuracy P (Y ′ = Y ). The number of labels is L = 10, the size of the calibration set is m = 1000, and we do not include brute force search because it achieves the same performance as the greedy algorithm. Each cell shows the average and standard deviation over 10 runs. We denote the best results for each classification task in bold. our greedy algorithm and brute force search have access to the true mixtures of MNLs used to model the simulated human expert. In our experiments, we implement conformal prediction using several non-conformity scores:( Ŷ = y | X = x, Y = y) = Cyy(γ) y ′ ∈S C y ′ y (γ METHOD P (Y ′ = Y ) = 0.3 P (Y ′ = Y ) = 0.5 P (Y ′ = Y ) = 0.7 P (Y ′ = Y ) = 0.9 0.s(x, y) = 1 -f y (x) (NAIVE, [20]), s(x, y) = y ′ :f y ′ (x)≤fy(x) f y ′ (x) (APS, [53]), s(x, y) = f y (x) + y ′ :f y ′ (x)≤fy(x) f y ′ (x) + λ raps (o(x, y) -k reg ) + (RAPS, [49]), s(x, y) = max y ′ f y ′ (x) o(x, y) = 1 max y ′ f y ′ (x) + λ saps (o(x, y) -2) o(x, y) > 1 (SAPS, [54]),where o(x, y) = |{y ′ : f y ′ (x) ≤ f y (x)}| denotes the ranking of label y according to f y (x) and we decided to omit the randomization for APS, RAPS and SAPS as it is only required to achieve exact 1α coverage and it did not have an influence on the empirical average accuracy achieved by the simulated human experts in our experiments. For RAPS and SAPS, we run the procedure outlined in Appendix E in Angelopoulous et al. [49] to optimize the additional hyperparameters, k regs and λ raps , for RAPS, and λ saps for SAPS, using the validation set. Further, for each non-conformity score and classification task, we report the results for the α value under which the expert achieves the highest average test accuracy and, to avoid empty sets, we always include the label value with the lowest non-conformity score in the prediction sets. In this context, note that, in practice, one would need to select α using a held-out dataset, however, our evaluation aims to show how our greedy algorithm Results. We first estimate the average test accuracy achieved by four different (simulated) human experts, each with a different γ value, on four classification tasks where the classifier f achieves a different average accuracy P (Y ′ = Y ). We report their average test accuracy on their own (NONE) and when using prediction sets constructed with conformal prediction (NAIVE, APS, RAPS and SAPS), our greedy algorithm (GREEDY) and brute force search (BRUTE FORCE SEARCH). Table 1 summarizes the results, where we have not included brute force search because it achieves the same performance as our greedy algorithm. The results show that, using the greedy algorithm to construct prediction sets, the experts consistently achieve the highest average accuracy across classification tasks. Moreover, the results also show that, under the prediction sets constructed using the greedy algorithm, the average accuracy achieved by the expert degrades gracefully as γ increases whereas, under the prediction sets constructed using conformal prediction, the average accuracy degrades significantly. Refer to Appendix D for additional results for L ∈ {25, 50} showing that the relative gain in average accuracy offered by the greedy algorithm increases with the number of labels and noise γ. Refer to Appendix E for additional results showing that the empirical average coverage achieved by the prediction sets constructed using conformal prediction and our greedy algorithm may be a bad proxy for estimating the average accuracy achieved by human experts using prediction sets.To better understand why the prediction sets constructed by the greedy algorithm help human experts achieve higher average accuracy than those constructed by conformal prediction, we now look closer into the structure of the prediction sets. Given a ground truth-label Y = y, let ȳ = argmax y ′ ̸ =y C y ′ y be the label that is most frequently mistaken with y. Then, we estimate the empirical conditional probability that a prediction set includes {y, ȳ} given Y = y with the greedy algorithm and conformal prediction. Figure 2 summarizes the results for γ = 0.7 and P (Y ′ = Y ) = 0.7 and y ∈ {0, 2, 6, 8}. Appendix F includes additional results for other configurations. The results show that, with the greedy algorithm, the empirical probability that a prediction set includes {y, ȳ} given Y = y is much lower (i.e., 2-3x lower) than with conformal prediction despite it creates overall larger prediction sets. 
experiments with real data: 
 In this section, we compare the average accuracy achieved by a simulated human expert using prediction sets constructed with our greedy algorithm, brute force search and conformal prediction on a real multiclass classification task over noisy natural images. The simulated human expert follows the mixture of MNLs introduced in Eq. 4, which is parameterized by the (estimated) confusion matrix of the predictions made by real human experts on their own. 12Experimental setup. We experiment with the ImageNet16H dataset [7] , which was created using 1,200 natural images from the ImageNet Large Scale Visual Recognition Challenge (ILSRVR) 2012 dataset [55] . More specifically, in the ImageNet16H dataset, each of the above images was used to create four noisy images with different levels of phase noise distortion ω ∈ {80, 95, 110, 125} and the same ground-truth label y from a label set Y of size n = 16. In addition, for each noisy image, the dataset contains (approximately) six label predictions made by human experts on their own. In our experiments, we run and evaluate each method separately by grouping the above noisy images (and expert predictions) according to their level of noise. For each group of images and method, we use the deep neural network classifier VGG-19 [56] after 10 epochs of fine-tuning as provided by Steyvers et al. [7] . Further, we randomly split the images (and expert predictions) in each group into two disjoint subsets, a calibration set (800 images), and a test set (400 images). The accuracy of the (pretrained) VGG-19 classifier on the test set is 0.900 ± 0.014 (ω = 80), 0.895 ± 0.009 (ω = 95), 0.857 ± 0.016 (ω = 110) and 0.792 ± 0.016 (ω = 125). We use the calibration set to (i) calibrate the (softmax) outputs of the VGG-19 scores using top-k-label calibration with k = 5, (ii) estimate the confusion matrix C that parameterizes the mixture of MNLs used to model the simulated human expert, and (iii) calculate the quantile qα used by conformal prediction 13 .We use the test set to evaluate the average accuracy the simulated expert achieves using prediction sets constructed with our greedy algorithm, brute force search and conformal prediction. Here, note that, similarly to in the experiments in synthetic data, our greedy algorithm and brute force search have access to the true mixture of MNLs used to model the simulated human expert. We implement conformal prediction using the same non-conformity scores used in the experiments with synthetic data and, for each non-conformity score and group of images, we report the results for the α value under which the expert achieves the highest average test accuracy. In Appendix H, we report results for all α values. To obtain error bars, we repeat each experiment 10 times, sampling different calibration and test sets.Results. Table 2 and Figure 3 show the average test accuracy and complementary cumulative distribution (cCDF) of the test per-image accuracy achieved by a simulated human expert using the prediction sets constructed with conformal prediction (NAIVE, APS, RAPS and SAPS), our greedy algorithm (GREEDY) and brute force search (BRUTE FORCE SEARCH) for different values of noise ω. The results show that, similarly as in our experiments with synthetic data, the greedy algorithm achieves the same performance as brute force search. Moreover, they also show that, using greedy algorithm to construct prediction sets, the expert achieves the highest average accuracy in all groups of images except the group with ω = 80, where both the greedy algorithm and one of the conformal predictors offer comparable performance. Similarly as in the synthetic experiments, refer to Appendix E for additional results regarding the empirical average coverage achieved by the prediction sets constructed using conformal prediction and our greedy algorithm.  
discussion and limitations: 
 In this section, we discuss several assumptions and limitations of our work, which open up interesting avenues for future work.Hardness analysis. In our hardness analysis, our reduction utilizes an instance of our problem in which, for every prediction set, the predictions made by experts follow a mixture of MNLs. As an immediate consequence, this implies that, in general, the problem of finding the prediction set S that maximizes ĝ(S | x) is NP-hard to approximate. However, in our experiments, the greedy algorithm is almost always able to find such a set S. As a result, we hypothesize that there may be certain conditions on the parameters of the mixture of MNLs under which the problem can be efficiently approximated to a factor less than the size of the label set.Methodology. Our greedy algorithm assumes that, for every prediction set, the predictions made by the human expert follow a parameterized expert model-the above mentioned mixture of MNLs. It would be worthy to develop model-free algorithms since, in the context of prediction sets constructed using conformal prediction, they have been shown to be superior to their model-based counterparts [19] . To this end, a good starting point may be the literature on (contextual) combinatorial multi-armed bandits [57, 58] , where one can map each arm to a label value and each subset of arms, namely a super arm, to a prediction set.Evaluation. The results of our experiments suggest that the prediction sets constructed using our greedy algorithm may help human experts make more accurate predictions than the prediction sets constructed using conformal prediction. However, one may argue that the difference in performance is partly due to the fact that the non-conformity scores used in conformal prediction do not incorporate information about the distribution of experts' predictions. Motivated by this observation, it would be important to investigate how to incorporate such information in the definition of non-conformity scores. Moreover, in our experiments, the true distribution of experts' predictions matches the mixture of MNLs used by the greedy algorithm and brute force search. However, in practice, there may be a mismatch between the true distribution of experts' predictions and the mixture of MNLs, and this may decrease performance. Finally, in our experiments with real data, the ground truth labels are estimated by aggregating (multiple) predictions by human annotators using majority voting, however, this may introduce additional sources of errors that may influence our results [59] .Broader impact. We have focused on maximizing the average accuracy of the predictions made by an expert using a decision support system based on prediction sets. However, in high-stakes application domains, it would be important to extend our methodology to account for fairness considerations. 
conclusions: 
 We have looked at the problem of finding the optimal prediction sets under which human experts achieve the highest accuracy in a given multiclass classification task. We have shown that this problem is NP-hard to solve and to approximate to any factor less than the size of the label set. However, we have empirically shown that, for a large parameterized class of expert models, a simple greedy algorithm consistently outperforms conformal prediction.g(S \ {y ′ } | x) ≥ g(S | x) remains true for each iteration as we remove y ′ = arg max y∈S N S (y) iteratively, to obtain S ′ ⊆ S such that max y∈S ′ N S ′ (y) = 1 and it holds that g(S ′ | x) ≥ k |Y| . The size of S ′ is at least k, as any smaller subset results in g(S ′ | x) < k |Y| . Since |S ′ | ≥ k and every y, y ′ ∈ S ′ are adjacent, S ′ induces a clique of size at least k.(=⇒) If k-clique is a YES instance and S ⊆ V be a clique of size k, then g(S | x) = k |V| = k |Y| . So the optimal predictions set problem is a YES instance. This concludes the proof.Lemma 1 For any subset S ⊆ Y with max y∈S N (y) > 1 and y ′ = arg max y∈S N S (y), it holds that g(S \ {y′ } | x) ≥ g(S | x). Proof g(S \ {y ′ } | x) -g(S | x) = 1 |Y|    y∈ A S\{y ′ } (y ′ ) 1 N S (y) -1 - 1 N S (y) - 1 N S (y ′ )    = 1 |Y|    y∈ A S\{y ′ } (y ′ ) 1 ( N S (y) -1)( N S (y)) - 1 N S (y ′ )    (i) ≥ 1 |Y|    y∈ A S\{y ′ } (y ′ ) 1 ( N S (y ′ ) -1)( N S (y ′ )) - 1 N S (y ′ )    (ii) ≥ 0Note that (i) and (ii) are valid because y ′ = arg max y∈S N S (y). 
broader impacts: 
 Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed?Answer: [Yes]Justification: We have discussed potential negative societal impact of our work under "Broader Impact" in Section 7.Guidelines:• The answer NA means that there is no societal impact of the work performed.• If the authors answer NA or No, they should explain why their work has no societal impact or why the paper does not address societal impact.• Examples of negative societal impacts include potential malicious or unintended uses (e.g., disinformation, generating fake profiles, surveillance), fairness considerations (e.g., deployment of technologies that could make decisions that unfairly impact specific groups), privacy considerations, and security considerations. • The conference expects that many papers will be foundational research and not tied to particular applications, let alone deployments. However, if there is a direct path to any negative applications, the authors should point it out. For example, it is legitimate to point out that an improvement in the quality of generative models could be used to generate deepfakes for disinformation. On the other hand, it is not needed to point out that a generic algorithm for optimizing neural networks could enable people to train models that generate Deepfakes faster. • The authors should consider possible harms that could arise when the technology is being used as intended and functioning correctly, harms that could arise when the technology is being used as intended but gives incorrect results, and harms following from (intentional or unintentional) misuse of the technology. • If there are negative societal impacts, the authors could also discuss possible mitigation strategies (e.g., gated release of models, providing defenses in addition to attacks, mechanisms for monitoring misuse, mechanisms to monitor how a system learns from feedback over time, improving the efficiency and accessibility of ML). 
safeguards: 
 Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pretrained language models, image generators, or scraped datasets)?Answer: [NA] .Justification: The paper does not introduce any data or models with a high risk for misuse.Guidelines:• The answer NA means that the paper poses no such risks.• Released models that have a high risk for misuse or dual-use should be released with necessary safeguards to allow for controlled use of the model, for example by requiring that users adhere to usage guidelines or restrictions to access the model or implementing safety filters. • Datasets that have been scraped from the Internet could pose safety risks. The authors should describe how they avoided releasing unsafe images. • We recognize that providing effective safeguards is challenging, and many papers do not require this, but we encourage authors to take this into account and make a best faith effort.12. Licenses for existing assets Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected?Answer: [Yes] Justification: The authors of the existing datasets and pre-trained models used in the paper are duly cited in the main text and the asset license was respected.Guidelines:• The answer NA means that the paper does not use existing assets.• The authors should cite the original paper that produced the code package or dataset.• The authors should state which version of the asset is used and, if possible, include a URL. • The name of the license (e.g., CC-BY 4.0) should be included for each asset.• For scraped data from a particular source (e.g., website), the copyright and terms of service of that source should be provided.• If assets are released, the license, copyright information, and terms of use in the package should be provided. For popular datasets, paperswithcode.com/datasets has curated licenses for some datasets. Their licensing guide can help determine the license of a dataset. • For existing datasets that are re-packaged, both the original license and the license of the derived asset (if it has changed) should be provided. • If this information is not available online, the authors are encouraged to reach out to the asset's creators.  
 
 Appendix: To establish the hardness of approximation, in Lemma 2 we will show that, given a polynomial-time α-approximation algorithm for the problem of finding the optimal prediction set, we can obtain a polynomial-time α-approximation algorithm for the problem of finding a maximum clique 16 in a graph G = (V, E). It is known that, assuming P ̸ = NP, for every ϵ > 0, the latter problem is NP-hard to approximate to a factor |V| 1-ϵ [51] . So we conclude that the optimal prediction sets problem is NP-hard to approximate to a factor |Y| 1-ϵ .Lemma 2 Suppose there exists a polynomial-time α-approximation algorithm for the optimal prediction sets problem with α ≥ 1, then there exists a polynomial-time α-approximation algorithm for the maximum clique problem.Proof Let S * ⊆ Y denote the optimal solution for the optimal prediction sets problem, as defined in Eq 1. A subset S ⊆ Y is an α-approximation for the optimal prediction sets problem if g(S | x) • α ≥ g(S * | x). We say an algorithm approximates an instance of the maximum clique problem within a factor α if it can find a clique of size at least ⌊ k * α ⌋, when the graph contains a max-clique of size k * . The reduction closely resembles the construction outlined in the proof of Theorem 1, with a subtly distinction being the absence of a bound B. For completeness, we will describe the construction again. Given an instance ⟨G = (V, E)⟩ of the maximum clique problem, we construct an instance ⟨x, Y, C⟩ of the optimal prediction sets problem as follows: x ∈ R d , Y = V and, for all y ∈ Y, we have thatP (Y = y | X = x) = 1|V| andP S ( Ŷ = ŷ | X = x, Y = y) = C ŷy y ′ ∈S C y ′ y where C y ′ y = 0 if (y ′ , y) ∈ E 1/ N V (y) otherwise,and N V (y) denotes the number of vertices that are not adjacent to y in G. For any S ⊆ Y,g(S | x) = y∈S f y (x) C yy y ′ ∈S C y ′ y = 1 |Y| y∈S 1 N S (y) ,and N S (y) denotes the number of vertices that are not adjacent to y in the subgraph induced by S.Let S * ⊆ V be a maximum clique of size k * in G. For all y ∈ S * , N S * (y) = 1 and g(S * | x) = k * |Y| . In Lemma 3 we show that, for any S ⊆ Y if S is not a clique of size k * , then g(S | x) ≤ g(S * | x). Further, if S ⊆ Y is an α-approximation, then from the definition of approximation ratio, it holds that,g(S | x) ≥ 1 α • g(S * | x) =⇒ g(S | x) ≥ ⌊ k * α |Y| ⌋.In the remainder of this proof, we show that there exists a clique of size at least⌊ k * α ⌋ in G.To do so, we consider two possibilities: max y∈S N (y) = 1 and max y∈S N (y) > 1. In both cases, we will establish the validity of the aforementioned claim.If max y∈S N S (y) = 1 and g(S | x) = k * α|Y| , then |S| = k * α and every y, y ′ ∈ S is adjacent in the subgraph induced by S. So S induces a clique of size k * α . If max y∈S N S (y) > 1, we (iteratively) remove y ′ = arg max y∈S N S (y). In Lemma 1, we show that, by removing y ′ = arg max y ′ ∈S N S (y) from S, it holds that g(S \ {y ′ } | x) ≥ g(S | x). Further, the assertion g(S \ {y ′ } | x) ≥ g(S | x) remains true for each iteration as we remove y ′ = arg max y∈S N S (y) iteratively, to obtain S ′ ⊆ S such that max y∈S ′ N S ′ (y) = 1 and it holds that g( Case (i):S ′ | x) ≥ ⌊ k * α|Y| ⌋. The size of S ′ is at least ⌊ k * α ⌋, as any smaller subset results in g(S ′ | x) < k α|Y| . Since |S ′ | ≥ ⌊ k * α ⌋If k < k * , then g(S | x) = k-1 |Y| < g(S * | x). Case (ii): If k = k * , then g(S | x) = k * |Y| = g(S * | x). Case (iii): If k > k *and S do not induce a clique, then there exists at least one pair y, y ′ ∈ S that are not adjacent, and the value of g(S | x) ≤ k-1|Y| . Without loss of generality, assume thatg(S | x) = k-1|Y| . Note that, if there are more vertex pairs that are not adjacent, then the inequality is strict, i.e., g(S | x) < k-1|Y| . Let S \ {y} be a clique of size k -1. In order for g(x, S) > g(x, S * ) to hold, S must contain a clique of size greater than k * + 1, which contradicts our premise that the maximum clique in G has size k * . More precisely,g(S | x) > g(S * | x) =⇒ k -1 |Y| > k * |Y| =⇒ k > k * + 1.This concludes the proof.In this section, we present the complexity analysis for the greedy algorithm in Algorithm 1. Adding each element requires computing the marginal gain ∆ = ĝ(S ∪ {y} | x)ĝ(S | x) at most k times. This computation in Line 8 can be efficiently performed in O(k) time, where k is the size of S k . Specifically, it can be rewritten as:ĝ(S k ∪ {y} | x) -ĝ(S k | x) = ŷ∈S k ∪{y} f ŷ (x) C ŷ ŷ y ′ ∈S k ∪{y} C y ′ ŷ - ŷ∈S k f ŷ (x) C ŷ ŷ y ′ ∈S k C y ′ ŷ .The term y ′ ∈S k ∪{y} C y ′ ŷ in the denominator can be computed as y ′ ∈S k C y ′ ŷ + C y ŷ by storing the value of y ′ ∈S k C y ′ ŷ at the end of each iteration after Line 11. The loops in Line 5 and Line 7 each iterate over k, resulting in O(k 3 ) iterations for each value of k ∈ {1, . . . , L}. So, the overall running time of our algorithm is O(L 4 ).We report the implementation details and computational resources used to run the experiments in Section 5 and Section 6. The code infrastructure was written using Python 3.8 and the standard set of scientific opensource libraries (e.g., numpy, pandas, scikit-learn, etc.). The full set of requirements can be found in the released code. We run the experiment on a Linux machine equipped with an Intel ® Xeon(R) Gold 6252N CPU, with 96 cores and 1024 GB of RAM. Practically, our experiments and the algorithms require little resources to be run. We parallelized the execution using OpenMPI and 50 physical cores and 20 GB of RAM.Experiments with synthetic data. We employ the make_classification utility function of scikit-learn to generate the various prediction task. It is a convenient method to generate L-class classification tasks by varying several parameters such as the task difficulty, the number of labels and the number of informative features. It generates n clusters of points positioned on the vertices of a d-dimensional hypercube by adding interdependencies and noise to the features. In Section 5, we set the number of features to 20, the number of redundant features to 0 and the number of informative features to d = 4 (for a L = 10 label classification task). We assign a balanced proportion of samples for each class. We control the task difficulty by choosing the class_sep parameter, which represents the length of the sides of the hypercubes, thus indicating how far apart are the various classes. A smaller class_sep implies a more difficult classification task. We vary the class_sep parameter to ensure the classifier and the humans span different ranges of accuracies. Please refer to the original documentation for more information. 17Experiments with real data. We use the data provided by Steyvers et al. [7] to evaluate our algorithm against the best conformal predictors. The dataset is composed of 1200 images from the ImageNet-16H classification task. The authors provide also a noisy version of these images by applying a different phase noise ω. Noisier images imply a more difficult classification task. For each image and each phase noise, they provide also the softmax scores of several pre-trained classifiers for different levels of fine-tuning: baseline (no fine-tuning), between 0 and 1 epochs, 1 epochs and 10 epochs. We use the classifier scores (VGG-19 fine-tuned for 10 epochs) and the human classification performance alone for all the 1200 images for different levels of phase noise ω = {80, 95, 110, 125}.We chose the VGG-19 classifier because it is the one achieving consistently higher accuracy than the expert alone in the classification task, for all phase noise levels. The data are freely available online. 18 In our experiment, we used Steyvers et al. normalized softmax scores which are obtained by dropping from VGG-19 all the irrelevant classes and by renormalizing.In this section, we keep the same experimental setting as described in Section 5 but we vary the number of labels L ∈ {25, 50} of the classification task. Table 3 summarizes the results.Table 3 : Empirical average test accuracy for L ∈ {25, 50}. Noise Method P (Y ′ = Y ) = 0.3 P (Y ′ = Y ) = 0.5 P (Y ′ = Y ) = 0.7 P (Y ′ = Y ) = 0.9 0.L = 25 Noise Method P (Y ′ = Y ) = 0.3 P (Y ′ = Y ) = 0.5 P (Y ′ = Y ) = 0.7 P (Y ′ = Y ) = 0.9 0.In this section, we report the empirical average test coverage across synthetic and real classification tasks achieved by the prediction sets constructed using conformal prediction and our greedy algorithms. Table 6 and Table 7 summarizes the results, which show that the prediction sets constructed using the best conformal predictors and our greedy algorithm achieve comparable empirical coverage. Moreover, in those few settings in which the prediction sets constructed using conformal prediction achieve higher coverage (e.g., P (Y ′ = Y ) = 0.3 and γ = 0.3), the average test accuracy achieved by the simulated human experts using the prediction sets constructed using conformal prediction is lower (cf. Table 1 ), which underlines how coverage alone may be a bad proxy for estimating the average accuracy achieved by human experts using prediction sets.Table 6 : Empirical average test coverage achieved by the prediction sets constructed using conformal prediction (NAIVE, APS, RAPS, SAPS) and using the greedy algorithm (GREEDY) on four synthetic classification tasks with four different (simulated) human experts, each with a different noise value γ.For each classification task, the classifier f used by conformal prediction and the greedy algorithm achieves a different average accuracy P (Y ′ = Y ). For each (simulated) human expert, the best value of α for each conformal predictor is different and thus the reported coverage is different. The number of labels is L = 10 and, the size of the calibration set is m = 1000. Each cell shows the average and standard deviation over 10 runs. We denote the best results for each task in bold. F Empirical conditional probability that a prediction set includes {y, ȳ} given a ground-truth label Y = y for additional classification tasksγ METHOD P[Y ′ = Y ] = 0.3 P[Y ′ = Y ] = 0.5 P[Y ′ = Y ] = 0.7 P[Y ′ = Y ] = 0.9 0.Given a ground truth-label Y = y, let ȳ = argmax y ′ ̸ =y C y ′ y be the label that is most frequently mistaken with y. Then, we estimate the empirical conditional probability that a prediction set includes {y, ȳ} given Y = y with the greedy algorithm and conformal prediction. Figure 4 summarizes the results for different γ and P (Y ′ = Y ) values of several classification tasks where the classifier f and the simulated human expert achieve different average accuracy on their own. The results show that, as the average accuracy achieved by the expert on their own worsens (γ increases), the empirical probability that a prediction set constructed by the greedy algorithm includes {y, ȳ} decreases. For the group of images with ω = 110 from the ImageNet16H dataset, Straitouri et al. [19] have gathered predictions made by real human experts using prediction sets constructed by all possible conformal predictors with the first non-conformity score we have considered in our experiments (NAIVE), given a choice of calibration set. Here, we use these predictions to evaluate the goodness of fit of the mixture of MNLs used in our experiments.Figure 5 shows that the average accuracy achieved by a simulated expert following the mixture of MNLs and by real human experts using the prediction sets constructed with all possible conformal predictors, each with a different α value, using the choice of calibration set by Straitouri et al. [19] .The results show that, while the mixture of MNLs tend to overestimates the average accuracy achieved by the predictions made by real experts, the average accuracy follows the same qualitative trend. Figure 5 : Average accuracy achieved by a simulated expert following the mixture of MNLs and by real human experts using the prediction sets constructed with all possible conformal predictors, each with a different α value, using the choice of calibration set by Straitouri et al. [19] . We highlight in red the highest average accuracy for both the simulated and the real humans.Answer Guidelines:• The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics.• If the authors answer No, they should explain the special circumstances that require a deviation from the Code of Ethics. • The authors should make sure to preserve anonymity (e.g., if there is a special consideration due to laws or regulations in their jurisdiction).There are many decision support systems used by experts that, under normal operation, forcefully limit experts' level of agency. For example, in aviation, there are automated, adaptive systems that prevent pilots from taking certain actions based on the monitoring of the environment.A threshold value is optimal if it maximizes the average accuracy achieved by an expert who predicts label values from the prediction sets created by the conformal predictor.We denote random variables with capital letters and realizations of random variables with lowercase letters.The expert's prediction Ŷ and the ground truth label Y may not be conditionally independent given the set of features X since, in most application domains of interest, the expert may have access to additional features. Otherwise, one may argue that pursuing human-AI complementarity is not a worthy goal[47].All proofs are in Appendix A.Given a graph G = (V, E) and an integer k ≤ |V|, the k-clique problem seeks to decide whether there exists S ⊆ V with size |S| = k such that, for every u, v ∈ S, there exists (u, v) ∈ E.A function f : 2 Y → R is submodular if and only if, for every S ⊆ T ⊆ Y and y ∈ Y\T , it holds that f (S ∪ {y}) -f (S) ≥ f (T ∪ {y}) -f (T ).Given a graph G = (V, E), the maximum clique problem seeks to find the largest S ⊆ V such that, for every u, v ∈ S, there exists (u, v) ∈ E.Proposition 1 can be generalized to conformal predictors with any non-conformity score as long as the ranking that our greedy algorithm uses is the same as the ranking induced by the non-conformity scores.A feature is informative if its value correlates with the label value.In Appendix G, we evaluate the goodness of fit of the mixture of MNLs to predictions made by real human experts using a support system based on prediction sets[19].For RAPS and SAPS, we further split the calibration set to obtain a (reduced) calibration (400 images) and validation (400 images) sets to calculate the quantile qα and optimize the hyperparameters of RAPS and SAPS, respectively.Given a graph G = (V, E) and an integer k ≤ |V|, the k-clique problem seeks to decide whether there exists S ⊆ V with size |S| = k such that, for every distinct pair u, v ∈ S, there exists (u, v) ∈ E. We assume that the graph G is simple, do not contain self loops and do not contain multiple edges between same pair of vertices.A graph GS = (S, ES ) is a vertex-induced subgraph in graph G = (V, E), if S ⊆ V and for every u, v ∈ S, (u, v) ∈ ES if and only if (u, v) ∈ E.Given a graph G = (V, E), the maximum clique problem seeks to find the largest S ⊆ V such that, for every u, v ∈ S, there exists (u, v) ∈ E.https://scikit-learn.org/stable/modules/generated/sklearn.datasets.make_ classification.html#sklearn.datasets.make_classificationhttps://osf.io/2ntrf/wiki/home/ 


Decision: All four reviewers are in favor of acceptance. They appreciated the submission's main contributions: finding that conformal prediction yields suboptimal prediction sets in terms of human accuracy, showing the NP-hardness of finding optimal prediction sets, and showing that a proposed greedy algorithm is guaranteed to improve upon conformal prediction. The theoretical nature of the last two contributions was especially appreciated. Other strengths include the experiments involving real experts and the writing being easy to follow.

The rebuttal satisfactorily addressed several issues, including the value of restricting humans to selecting from the prediction set, experimenting on additional datasets, and a comparison with RAPS and SAPS. It also answered reviewer questions, clarified some misunderstandings, and promised to report additional results, for example regarding empirical coverage and selection of $\alpha$. I hope that the authors will incorporate these elements into the camera-ready version. I do note one reviewer comment about the necessity of knowing $P(Y|X)$ and the human choice model. It would be good to comment on this in the final version.

Reviews: review: paper_summary: paper_summary: This paper aims to construct optimal prediction sets under which experts can achieve the highest accuracy. The authors claim that human experts cannot attain maximum accuracy with the prediction sets generated by conformal predictors. To address this issue, the paper proposes an efficient greedy algorithm based on maximum marginal gain to find prediction sets that outperform those generated by conformal predictors. The paper offers two main theoretical contributions: the first proves that finding the optimal prediction set is an NP-hard problem, while the second demonstrates that the proposed method enables experts to achieve higher accuracy than conformal predictors. Empirical results further validate the effectiveness of the proposed approach.
strength_weakness: strength_weakness: 1. Further validation on more realistic datasets, such as ImageNet and CIFAR100, could strengthen the main points of the paper.
    
2. The experiments lack comparison with other classical score functions, such as Regularized Adaptive Prediction Sets.
questions: questions: 1. In Figure 3, how is the Empirical Success Probability for each image calculated?
    
2. In line 210, why does the score function of APS discard the random variable? In other words, does the random variable affect the performance of the empirical average test accuracy?
    
3. Can you report the empirical coverage of the Greedy algorithm, since valid coverage is the fundamental guarantee for conformal prediction?
limitations: limitations: They are adequately discussed.
paper_summary: paper_summary: The paper shows the conformal prediction set may not be the optimal set recommendation to humans if humans follow certain choice models. The authors then propose a greedy algorithm by modeling $P(y|x)$ and the choice model of humans assuming it follows MNL model. Authors compare the proposed method against the standard conformal prediction set under synthetic human experts and the proposed method has a slightly better performance compared to traditional conformal sets.
strength_weakness: strength_weakness: The problem setting is not realistic: The authors do not allow humans to select outside the conformal prediction set. However, in the setups of most empirical successes of human-AI collaboration with conformal prediction, this is allowed. Similarly, if the authors do not allow humans to select outside the conformal prediction set, humans' value is greatly reduced and the optimal thing to do may be just to use fully automated AI prediction and in all the toy examples the authors provided, kicking humans out of the loop is the optimal system (humans only make things worse). 

The theoretical analysis seems useless: I think the theoretical analysis is useless for two reasons: 1) while identifying the optimal set is NP-hard, in practice the metric we care about is $\mathbb{E} g(S|x)$, not identifying the optimal set. If an algorithm can get a good rate of convergence for this regret, then this problem is not hopeless, so I think authors need to show for all conformal prediction algorithms, what is the regret lower bound for $\mathbb{E} g(S|x)$; 2) while I can see that sometimes the label set can be large. In practice, the theoretical results may not be a big issue for many problems since most problems have small label set (binary or three classes). This negative results may not seem that severe as the authors presented in the paper. 

The solution is disconnected and not useful in human-AI collaboration: 1) The proposed solution does not enjoy the distributionally-free guarantee, which is the main reason why people use conformal prediction. I would expect authors to provide a conformal prediction algorithm that is human-centered, rather than directly switch lanes to traditional prediction methods. 2) The proposed solution requires $P(y|x)$ and the true human choice model, which is too strong to be realistic. If I know $P(y|x)$, why should I involve humans in the loop anymore (recall that authors can restrict humans only select from prediction set so humans are not necessary in the system). The optimal strategy would be directly use $P(y|x)$ to select actions. 

Baselines: For human-AI collaboration tasks, I expect to see the proposed solution is better than human working alone or AI working alone. The authors should compare with AI only baseline using $P(y|x)$. Based on the toy example and my current understanding of the paper, the proposed solution cannot beat AI only baseline.
questions: questions: See weakness.
limitations: limitations: Yes
paper_summary: paper_summary: The authors first show that conformal prediction sets may not lead to human decision optimality.  The authors then introduce a greedy algorithm to generate candidate prediction sets that improve human decisions regarding the accuracy metric.
strength_weakness: strength_weakness: * The presentation somewhere is unclear: 
  * Line 86. Please break the sentence properly.	
  * Line 40/43/48: It is unclear for readers when the authors mention “optimal” multiple times but delay its explicit definition later.
  * Line 197: It is confusing when the authors refer to the role of $a$. What is the value of $a$?

* The authors claim they propose an efficient algorithm. However, I am not sure which part is efficient. Are there any numerical metrics, e.g., running time, supporting this contribution? Additionally, how should we understand this restriction of “for a large class of non-conformity scores and expert models” in line 51?

* Line 90:  But you also miss the possibility outside the prediction set, especially when the prediction set is not that good. I think the authors need to discuss the exploitation-exploration dilemma.

* The authors use the scores related to softmax and APS. Other papers propose alternative scores like RAPS and SAPS. I think they should be included.
questions: questions: * Typo in the title: Predictions --> Prediction

* Did you include the results from the conformal prediction sets by varying the value of $\alpha$?

*  Why choose those values of $\omega$? I think their magnitudes are close. The authors may consider even smaller and larger values of $\omega$ to show its sensitivity.
limitations: limitations: Please see the above sections.
paper_summary: paper_summary: The paper analyzes decision support systems based on prediction set algorithms. The authors show that: (i) the usage of conformal prediction techniques is generally sub-optimal in terms of accuracy; (ii) the problem of finding the optimal prediction sets under human assistance is NP-hard. Moreover, they provide (iii) a greedy algorithm that is guaranteed to find prediction sets that are better than those provided by conformal predictors. Experimental evaluation on synthetic and real data show the effectiveness of the considered approach.
strength_weakness: strength_weakness: I think this work is a good paper, without major weaknesses, as it provides solid theoretical insights.
The concerns I have are mainly due to typos/details missing. I will point out here these and a few remarks that might be considered for the final version of the paper.

1. It seems to me that Table 2 and Figure 3 are missing the BRUTE FORCE baseline.
2. regarding the style of the paper, I found lines 135-146 very dense. Maybe providing a more concrete example (e.g., what could 1,2,3 represent?) might help the reader getting through it.
3. In Algorihm 1, I think adding a comment to the pseudo-code (from lines 4 to 13) could be useful
4. regarding the limitation section (evaluation) a useful reference might be [Stutz et al., 2023], where the authors evaluate the possibility that human experts might not be approximating the true probability distribution 
5. the experimental analysis (on real data) could be enriched with other popular Learning-to-Defer datasets, such as Cifar10H or hatespeech.

[Stutz et al., 2023] - Stutz, David, Abhijit Guha Roy, Tatiana Matejovicova, Patricia Strachan, Ali Taylan Cemgil, and Arnaud Doucet. "Conformal prediction under ambiguous ground truth." Transactions on Machine Learning Research (2023).
questions: questions: I have a couple of questions/remarks:

1. Can you elaborate a bit more on lines 91-93? I am not fully sure I understand the point there.
2. Can you add the results for BRUTE FORCE SEARCH in Table 2 and Figure 3?
limitations: limitations: The paper adequately discussed the limitations and societal impact.

Comments: title: Response to the Rebuttal
comment: I acknowledge the authors' response and I keep my initial score.
Thank the authors for the clarification. I have no other concerns. Adding complementary experiments can make the experiment results more convincing. I maintain the rating of accept.
**[Selection of $\alpha$]** We would like to thank the reviewer for their follow-up message. In our experiments, we report the results for the $\alpha$ value at which the expert attains the highest average accuracy because our goal was to show that our greedy algorithm achieves better results than conformal prediction for _any_ value of $\alpha$. However, we agree with the reviewer that, in practice, one would need to select $\alpha$ using a held-out dataset. Therefore, to avoid any misunderstanding, we will add a clarification and, if the reviewer feels it is necessary, we will also add an Appendix where we adjust $\alpha$ based on a separate held-out set.
Thank you for your response. I still have only one concern:

[**Empirical coverage of Greedy**] Regarding the selection of $\alpha$, is it justifiable to report results for the $\alpha$ value at which the expert attains the highest average test accuracy? The test set is intended for evaluating the performance of various methods, not for choosing hyper-parameters. Therefore, it may be more appropriate to adjust $\alpha$ based on a separate hold-out dataset.
Thank authors for the clarification. I revisited the toy example and realize the human+AI is actually better than the ground-truth set ranked by probability, this is an interesting example, which addressed my concern. I raised my score accordingly.
I thank the authors for their clarifications. I have no further questions.
After reading the rebuttals and the other reviews, I am keeping my score as I think this is a sound paper.