Ricardo Silva, Yuchen Zhu, Jialin Yu, Andreas Koukorinis, Nicolò Colombo
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We consider sequential treatment regimes where each unit is exposed to combinations of interventions over time. When interventions are described by qualitative labels, such as "close schools for a month due to a pandemic" or "promote this podcast to this user during this week", it is unclear which appropriate structural assumptions allow us to generalize behavioral predictions to previously unseen combinations of interventions. Standard black-box approaches mapping sequences of categorical variables to outputs are applicable, but they rely on poorly understood assumptions on how reliable generalization can be obtained, and may underperform under sparse sequences, temporal variability, and large action spaces. To approach that, we pose an explicit model for composition, that is, how the effect of sequential interventions can be isolated into modules, clarifying which data conditions allow for the identification of their combined effect at different units and time steps. We show the identification properties of our compositional model, inspired by advances in causal matrix factorization methods. Our focus is on predictive models for novel compositions of interventions instead of matrix completion tasks and causal effect estimation. We compare our approach to flexible but generic black-box models to illustrate how structure aids prediction in sparse data conditions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.05745")
get_code_for_paper("2406.05745")
have("2406.05745")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.05745.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.05745)
Connect an agent — have() is free.