{"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/stable-conformal-prediction-sets","title":"Stable Conformal Prediction Sets","arxiv_id":"2112.10224","date":"2021-12-19","proceeding":null,"authors":["Eugene Ndiaye"],"abstract":"When one observes a sequence of variables $(x_1, y_1), \\ldots, (x_n, y_n)$, Conformal Prediction (CP) is a methodology that allows to estimate a confidence set for $y_{n+1}$ given $x_{n+1}$ by merely assuming that the distribution of the data is exchangeable. CP sets have guaranteed coverage for any finite population size $n$. While appealing, the computation of such a set turns out to be infeasible in general, e.g. when the unknown variable $y_{n+1}$ is continuous. The bottleneck is that it is based on a procedure that readjusts a prediction model on data where we replace the unknown target by all its possible values in order to select the most probable one. This requires computing an infinite number of models, which often makes it intractable. In this paper, we combine CP techniques with classical algorithmic stability bounds to derive a prediction set computable with a single model fit. We demonstrate that our proposed confidence set does not lose any coverage guarantees while avoiding the need for data splitting as currently done in the literature. We provide some numerical experiments to illustrate the tightness of our estimation when the sample size is sufficiently large, on both synthetic and real datasets.","url_abs":"https://arxiv.org/abs/2112.10224v2","url_pdf":"https://arxiv.org/pdf/2112.10224v2.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":"stable-conformal-prediction-sets","repo_url":"https://github.com/EugeneNdiaye/stable_conformal_prediction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"conformal-prediction","task_name":"Conformal Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2112.10224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10224"}},"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":"deterministic:regex_extraction","url":"https://github.com/EugeneNdiaye/stable_","reach":{"status":"gone","observed_at":"2026-09-17","how":"tree_404+repo_404"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/EugeneNdiaye/stable_conformal_prediction","reach":null}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"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":4,"samples":[{"code_sha256_prefix":"4fa8a70edff82129","entry":"conformalset","repo":"eugenendiaye/stable_conformal_prediction","repo_kind":"official","path":"bench_stabCP/stabCP.py","file_url":"https://github.com/eugenendiaye/stable_conformal_prediction/blob/HEAD/bench_stabCP/stabCP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"4fa8a70edff82129"}},{"code_sha256_prefix":"71874128d9157110","entry":"conformalset","repo":"EugeneNdiaye/stable_conformal_prediction","repo_kind":"official","path":"bench_stabCP/stabCP.py","file_url":"https://github.com/EugeneNdiaye/stable_conformal_prediction/blob/HEAD/bench_stabCP/stabCP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"71874128d9157110"}},{"code_sha256_prefix":"f872f350ad5fa668","entry":"plot","repo":"eugenendiaye/stable_conformal_prediction","repo_kind":"official","path":"bench_stabCP/bench.py","file_url":"https://github.com/eugenendiaye/stable_conformal_prediction/blob/HEAD/bench_stabCP/bench.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"f872f350ad5fa668"}},{"code_sha256_prefix":"749ee319396aaa01","entry":"rank","repo":"eugenendiaye/stable_conformal_prediction","repo_kind":"official","path":"bench_stabCP/stabCP.py","file_url":"https://github.com/eugenendiaye/stable_conformal_prediction/blob/HEAD/bench_stabCP/stabCP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"749ee319396aaa01"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}