{"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/practical-adversarial-multivalid-conformal","title":"Practical Adversarial Multivalid Conformal Prediction","arxiv_id":"2206.01067","date":"2022-06-02","proceeding":null,"authors":["Osbert Bastani","Varun Gupta","Christopher Jung","Georgy Noarov","Ramya Ramalingam","Aaron Roth"],"abstract":"We give a simple, generic conformal prediction method for sequential prediction that achieves target empirical coverage guarantees against adversarially chosen data. It is computationally lightweight -- comparable to split conformal prediction -- but does not require having a held-out validation set, and so all data can be used for training models from which to derive a conformal score. It gives stronger than marginal coverage guarantees in two ways. First, it gives threshold calibrated prediction sets that have correct empirical coverage even conditional on the threshold used to form the prediction set from the conformal score. Second, the user can specify an arbitrary collection of subsets of the feature space -- possibly intersecting -- and the coverage guarantees also hold conditional on membership in each of these subsets. We call our algorithm MVP, short for MultiValid Prediction. We give both theory and an extensive set of empirical evaluations.","url_abs":"https://arxiv.org/abs/2206.01067v1","url_pdf":"https://arxiv.org/pdf/2206.01067v1.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":"practical-adversarial-multivalid-conformal","repo_url":"https://github.com/progbelarus/multivalidprediction","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"CC0-1.0"}}],"tasks":[{"task_slug":"conformal-prediction","task_name":"Conformal Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2206.01067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01067"}},"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/progbelarus/multivalidprediction","reach":{"status":"ok","spdx":"CC0-1.0"}}],"summary":{"ran_honours":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"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":"ce9cdd0a73c5e072","entry":"sort_sum","repo":"progbelarus/multivalidprediction","repo_kind":"official","path":"src/utils_raps.py","file_url":"https://github.com/progbelarus/multivalidprediction/blob/HEAD/src/utils_raps.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ce9cdd0a73c5e072"}},{"code_sha256_prefix":"c3f300aad6687f87","entry":"validate","repo":"progbelarus/multivalidprediction","repo_kind":"official","path":"src/utils_raps.py","file_url":"https://github.com/progbelarus/multivalidprediction/blob/HEAD/src/utils_raps.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c3f300aad6687f87"}},{"code_sha256_prefix":"4b74cfb86420ddb9","entry":"validate_with_sets","repo":"progbelarus/multivalidprediction","repo_kind":"official","path":"src/utils_raps.py","file_url":"https://github.com/progbelarus/multivalidprediction/blob/HEAD/src/utils_raps.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"mcp_get_code":{"code_sha256":"4b74cfb86420ddb9"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}