Papers › Boosted Control Functions: Distribution generalization and invariance in confounded models

Boosted Control Functions: Distribution generalization and invariance in confounded models

9 Oct 2023arXiv:2310.05805archive 2025-07-28

Nicola Gnecco, Jonas Peters, Sebastian Engelke, Niklas Pfister

Modern machine learning methods and the availability of large-scale data have significantly advanced our ability to predict target quantities from large sets of covariates. However, these methods often struggle under distributional shifts, particularly in the presence of hidden confounding. While the impact of hidden confounding is well-studied in causal effect estimation, e.g., instrumental variables, its implications for prediction tasks under shifting distributions remain underexplored. This work addresses this gap by introducing a strong notion of invariance that, unlike existing weaker notions, allows for distribution generalization even in the presence of nonlinear, non-identifiable structural functions. Central to this framework is the Boosted Control Function (BCF), a novel, identifiable target of inference that satisfies the proposed strong invariance notion and is provably worst-case optimal under distributional shifts. The theoretical foundation of our work lies in Simultaneous Equation Models for Distribution Generalization (SIMDGs), which bridge machine learning with econometrics by describing data-generating processes under distributional shifts. To put these insights into practice, we propose the ControlTwicing algorithm to estimate the BCF using flexible machine-learning techniques and demonstrate its generalization performance on synthetic and real-world datasets compared to traditional empirical risk minimization approaches.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.05805")

Code

Syntology Ran 9 of 10 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 9 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

nicolagnecco/bcf-numerical-experiments officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 9 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9ran
1unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from nicolagnecco/bcf-numerical-experiments. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

center_y nicolagnecco/bcf-numerical-experiments/python/src/bcf/boosted_control_function_mlp.py official repository ran fingerprinted MIT (permissive) · 4f3dfb032d98a9a8 · report
create_dataframe nicolagnecco/bcf-numerical-experiments/python/main/experiment_app_identifiability.py official repository ran MIT (permissive) · 257e796d20d29b93 · report
cross_validate_rrr nicolagnecco/bcf-numerical-experiments/python/src/bcf/reduced_rank_regression.py official repository ran MIT (permissive) · 35bc00b26bbed6d6 · report
filter_methods nicolagnecco/bcf-numerical-experiments/python/main/experiment_app_identifiability.py official repository ran MIT (permissive) · 7d5b60df9a016dfc · report
param_groups_no_bias_decay nicolagnecco/bcf-numerical-experiments/python/src/bcf/mlp.py official repository ran MIT (permissive) · f49d7199ac08f101 · report
predict_fx_only nicolagnecco/bcf-numerical-experiments/python/src/bcf/mlp.py official repository ran MIT (permissive) · e2e03d70705d5828 · report
seed_from_string nicolagnecco/bcf-numerical-experiments/python/main/experiment_app_identifiability.py official repository ran fingerprinted MIT (permissive) · a992cc7da77ebf77 · report
split_X_and_Z nicolagnecco/bcf-numerical-experiments/python/src/bcf/helpers.py official repository ran fingerprinted MIT (permissive) · 5f18ab8c408a29cd · report
split_cont_cat nicolagnecco/bcf-numerical-experiments/python/src/bcf/helpers.py official repository ran MIT (permissive) · efdd4637109ea2d7 · report
predict_full nicolagnecco/bcf-numerical-experiments/python/src/bcf/mlp.py official repository unverified MIT (permissive) · 72cf4e0f4c2736b3 · report

Tasks

Econometrics

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections