{"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/automatically-adaptive-conformal-risk-control","title":"Automatically Adaptive Conformal Risk Control","arxiv_id":"2406.17819","date":"2024-06-25","proceeding":null,"authors":["Vincent Blot","Anastasios N Angelopoulos","Michael I Jordan","Nicolas J-B Brunel"],"abstract":"Science and technology have a growing need for effective mechanisms that ensure reliable, controlled performance from black-box machine learning algorithms. These performance guarantees should ideally hold conditionally on the input-that is the performance guarantees should hold, at least approximately, no matter what the input. However, beyond stylized discrete groupings such as ethnicity and gender, the right notion of conditioning can be difficult to define. For example, in problems such as image segmentation, we want the uncertainty to reflect the intrinsic difficulty of the test sample, but this may be difficult to capture via a conditioning event. Building on the recent work of Gibbs et al. [2023], we propose a methodology for achieving approximate conditional control of statistical risks-the expected value of loss functions-by adapting to the difficulty of test samples. Our framework goes beyond traditional conditional risk control based on user-provided conditioning events to the algorithmic, data-driven determination of appropriate function classes for conditioning. We apply this framework to various regression and segmentation tasks, enabling finer-grained control over model performance and demonstrating that by continuously monitoring and adjusting these parameters, we can achieve superior precision compared to conventional risk-control methods.","url_abs":"https://arxiv.org/abs/2406.17819v4","url_pdf":"https://arxiv.org/pdf/2406.17819v4.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":"automatically-adaptive-conformal-risk-control","repo_url":"https://github.com/vincentblot28/multiaccurate-cp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2406.17819","atlas_url":"https://app.syntology.ai/?focus=2406.17819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17819"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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/vincentblot28/multiaccurate-cp","reach":{"status":"ok"}}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"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":3,"samples":[{"code_sha256_prefix":"d1eea0c8ce947d98","entry":"res2net101_v1b","repo":"vincentblot28/multiaccurate-cp","repo_kind":"official","path":"multiaccurate_cp/utils/pranet_utils.py","file_url":"https://github.com/vincentblot28/multiaccurate-cp/blob/HEAD/multiaccurate_cp/utils/pranet_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d1eea0c8ce947d98"}},{"code_sha256_prefix":"151778b085c61acb","entry":"res2net50_v1b","repo":"vincentblot28/multiaccurate-cp","repo_kind":"official","path":"multiaccurate_cp/utils/pranet_utils.py","file_url":"https://github.com/vincentblot28/multiaccurate-cp/blob/HEAD/multiaccurate_cp/utils/pranet_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"151778b085c61acb"}},{"code_sha256_prefix":"dad912f924d8e053","entry":"res2net50_v1b_26w_4s","repo":"vincentblot28/multiaccurate-cp","repo_kind":"official","path":"multiaccurate_cp/utils/pranet_utils.py","file_url":"https://github.com/vincentblot28/multiaccurate-cp/blob/HEAD/multiaccurate_cp/utils/pranet_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"dad912f924d8e053"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}