{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/improving-uncertainty-quantification-of-deep","title":"Improving Uncertainty Quantification of Deep Classifiers via Neighborhood Conformal Prediction: Novel Algorithm and Theoretical Analysis","arxiv_id":"2303.10694","date":"2023-03-19","proceeding":null,"authors":["Subhankar Ghosh","Taha Belkhouja","Yan Yan","Janardhan Rao Doppa"],"abstract":"Safe deployment of deep neural networks in high-stake real-world applications requires theoretically sound uncertainty quantification. Conformal prediction (CP) is a principled framework for uncertainty quantification of deep models in the form of prediction set for classification tasks with a user-specified coverage (i.e., true class label is contained with high probability). This paper proposes a novel algorithm referred to as Neighborhood Conformal Prediction (NCP) to improve the efficiency of uncertainty quantification from CP for deep classifiers (i.e., reduce prediction set size). The key idea behind NCP is to use the learned representation of the neural network to identify k nearest-neighbors calibration examples for a given testing input and assign them importance weights proportional to their distance to create adaptive prediction sets. We theoretically show that if the learned data representation of the neural network satisfies some mild conditions, NCP will produce smaller prediction sets than traditional CP algorithms. Our comprehensive experiments on CIFAR-10, CIFAR-100, and ImageNet datasets using diverse deep neural networks strongly demonstrate that NCP leads to significant reduction in prediction set size over prior CP methods.","url_abs":"https://arxiv.org/abs/2303.10694v1","url_pdf":"https://arxiv.org/pdf/2303.10694v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"improving-uncertainty-quantification-of-deep","repo_url":"https://github.com/1995subhankar1995/ncp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"conformal-prediction","task_name":"Conformal Prediction"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"uncertainty-quantification","task_name":"Uncertainty Quantification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2303.10694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10694"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/1995subhankar1995/ncp","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/1995subhankar1995/NCP","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":1,"ran_fixture":4},"by_repo_kind":{"official":{"samples":5,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"dc37227a1b039131","entry":"SplitCP","repo":"1995subhankar1995/NCP","repo_kind":"official","path":"CP/Classification.py","file_url":"https://github.com/1995subhankar1995/NCP/blob/HEAD/CP/Classification.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"dc37227a1b039131"}},{"code_sha256_prefix":"5d4f8231d083ae24","entry":"generalized_inverse_quantile_score","repo":"1995subhankar1995/NCP","repo_kind":"official","path":"CP/Classification.py","file_url":"https://github.com/1995subhankar1995/NCP/blob/HEAD/CP/Classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5d4f8231d083ae24"}},{"code_sha256_prefix":"6e3f7dd5a30f064e","entry":"get_logits_targets","repo":"1995subhankar1995/NCP","repo_kind":"official","path":"CP/Classification.py","file_url":"https://github.com/1995subhankar1995/NCP/blob/HEAD/CP/Classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6e3f7dd5a30f064e"}},{"code_sha256_prefix":"388776d5818b78b7","entry":"platt_logits","repo":"1995subhankar1995/NCP","repo_kind":"official","path":"CP/Classification.py","file_url":"https://github.com/1995subhankar1995/NCP/blob/HEAD/CP/Classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"388776d5818b78b7"}},{"code_sha256_prefix":"b8a60995fcc5fcd2","entry":"rank_regularized_score","repo":"1995subhankar1995/NCP","repo_kind":"official","path":"CP/Classification.py","file_url":"https://github.com/1995subhankar1995/NCP/blob/HEAD/CP/Classification.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b8a60995fcc5fcd2"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}