{"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/hidden-yet-quantifiable-a-lower-bound-for","title":"Hidden yet quantifiable: A lower bound for confounding strength using randomized trials","arxiv_id":"2312.03871","date":"2023-12-06","proceeding":null,"authors":["Piersilvio De Bartolomeis","Javier Abad","Konstantin Donhauser","Fanny Yang"],"abstract":"In the era of fast-paced precision medicine, observational studies play a major role in properly evaluating new treatments in clinical practice. Yet, unobserved confounding can significantly compromise causal conclusions drawn from non-randomized data. We propose a novel strategy that leverages randomized trials to quantify unobserved confounding. First, we design a statistical test to detect unobserved confounding with strength above a given threshold. Then, we use the test to estimate an asymptotically valid lower bound on the unobserved confounding strength. We evaluate the power and validity of our statistical test on several synthetic and semi-synthetic datasets. Further, we show how our lower bound can correctly identify the absence and presence of unobserved confounding in a real-world setting.","url_abs":"https://arxiv.org/abs/2312.03871v3","url_pdf":"https://arxiv.org/pdf/2312.03871v3.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":"hidden-yet-quantifiable-a-lower-bound-for","repo_url":"https://github.com/jaabmar/confounder-lower-bound","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"hidden-yet-quantifiable-a-lower-bound-for","repo_url":"https://github.com/jaabmar/kernel-test-bias","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2312.03871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03871"}},"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/jaabmar/kernel-test-bias","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jaabmar/confounder-lower-bound","reach":null}],"summary":{"ran_honours":2,"ran_violates":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":"8213ae45a499f100","entry":"alpha_fn","repo":"jaabmar/confounder-lower-bound","repo_kind":"official","path":"src/test_confounding/datasets/synthetic.py","file_url":"https://github.com/jaabmar/confounder-lower-bound/blob/HEAD/src/test_confounding/datasets/synthetic.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8213ae45a499f100"}},{"code_sha256_prefix":"3f37d46ba78bdb8e","entry":"beta_fn","repo":"jaabmar/confounder-lower-bound","repo_kind":"official","path":"src/test_confounding/datasets/synthetic.py","file_url":"https://github.com/jaabmar/confounder-lower-bound/blob/HEAD/src/test_confounding/datasets/synthetic.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3f37d46ba78bdb8e"}},{"code_sha256_prefix":"a073bc1eb377809b","entry":"f_mu_linear","repo":"jaabmar/confounder-lower-bound","repo_kind":"official","path":"src/test_confounding/datasets/synthetic.py","file_url":"https://github.com/jaabmar/confounder-lower-bound/blob/HEAD/src/test_confounding/datasets/synthetic.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a073bc1eb377809b"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}