{"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/model-agnostic-covariate-assisted-inference","title":"Model-Agnostic Covariate-Assisted Inference on Partially Identified Causal Effects","arxiv_id":"2310.08115","date":"2023-10-12","proceeding":null,"authors":["Wenlong Ji","Lihua Lei","Asher Spector"],"abstract":"Many causal estimands are only partially identifiable since they depend on the unobservable joint distribution between potential outcomes. Stratification on pretreatment covariates can yield sharper bounds; however, unless the covariates are discrete with relatively small support, this approach typically requires binning covariates or estimating the conditional distributions of the potential outcomes given the covariates. Binning can result in substantial efficiency loss and become challenging to implement, even with a moderate number of covariates. Estimating conditional distributions, on the other hand, may yield invalid inference if the distributions are inaccurately estimated, such as when a misspecified model is used or when the covariates are high-dimensional. In this paper, we propose a unified and model-agnostic inferential approach for a wide class of partially identified estimands. Our method, based on duality theory for optimal transport problems, has four key properties. First, in randomized experiments, our approach can wrap around any estimates of the conditional distributions and provide uniformly valid inference, even if the initial estimates are arbitrarily inaccurate. A simple extension of our method to observational studies is doubly robust in the usual sense. Second, if nuisance parameters are estimated at semiparametric rates, our estimator is asymptotically unbiased for the sharp partial identification bound. Third, we can apply the multiplier bootstrap to select covariates and models without sacrificing validity, even if the true model is not selected. Finally, our method is computationally efficient. Overall, in three empirical applications, our method consistently reduces the width of estimated identified sets and confidence intervals without making additional structural assumptions.","url_abs":"https://arxiv.org/abs/2310.08115v2","url_pdf":"https://arxiv.org/pdf/2310.08115v2.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":"model-agnostic-covariate-assisted-inference","repo_url":"https://github.com/amspector100/dual_bounds_paper","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"causal-inference","task_name":"Causal Inference"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.08115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08115"}},"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/amspector100/dual_bounds_paper","reach":{"status":"ok"}}],"summary":{"ran":8,"unverified":3},"by_repo_kind":{"official":{"samples":11,"ran":8,"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":11,"samples":[{"code_sha256_prefix":"82698c1f50405d20","entry":"create_folds","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/dist_reg.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/dist_reg.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"82698c1f50405d20"}},{"code_sha256_prefix":"5b556f8d995f4b7f","entry":"elapsed","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/utilities.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/utilities.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"5b556f8d995f4b7f"}},{"code_sha256_prefix":"e3650b90398f7298","entry":"haslength","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/utilities.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/utilities.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e3650b90398f7298"}},{"code_sha256_prefix":"f6fe34efcea5b03d","entry":"heteroskedastic_scale","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/gen_data.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/gen_data.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f6fe34efcea5b03d"}},{"code_sha256_prefix":"56208a773b344ac5","entry":"obj2int","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/parser.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/parser.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"56208a773b344ac5"}},{"code_sha256_prefix":"38342f9c220982dc","entry":"str2bool","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/parser.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/parser.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"38342f9c220982dc"}},{"code_sha256_prefix":"fd45f87b8e393107","entry":"val2list","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/parser.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/parser.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fd45f87b8e393107"}},{"code_sha256_prefix":"569a7ca85f0cb315","entry":"vrange","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/utilities.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/utilities.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"569a7ca85f0cb315"}},{"code_sha256_prefix":"0ba43578ce30cd44","entry":"compute_analytical_lee_bound","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/lee.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/lee.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":"0ba43578ce30cd44"}},{"code_sha256_prefix":"2bcbb638f1e211c2","entry":"compute_cvar","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/lee.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/lee.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":"2bcbb638f1e211c2"}},{"code_sha256_prefix":"29be0d092d0ef5e4","entry":"interpolate","repo":"amspector100/dual_bounds_paper","repo_kind":"official","path":"db_src/lee.py","file_url":"https://github.com/amspector100/dual_bounds_paper/blob/HEAD/db_src/lee.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":"29be0d092d0ef5e4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}