QH
Q.B. Hofstede
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
Positivity Sized-Up Effectively
Assessing Stochastic Positivity in Causal Inference via Effective Sample Size
Causal inference relies on several key identifying assumptions, including positivity: all treatment levels must have non-zero probability for every possible covariate combination. Violations lead to unreliable causal effect estimates, yet positivity is often overlooked, and existing diagnostics have limitations. This assumption is particularly relevant for observational data, because treatment assignment is not independent of confounders. To remove this dependence, Inverse probability of treatment weighting (IPTW) estimators can be used. However, IPTW relies on the positivity assumption, and near-violations lead to extreme weights and unstable estimates. We investigate effective sample size (ESS) as a practical diagnostic for evaluating the estimability of causal effects in the face of near-positivity violations. The key contribution is a theoretical definition of ‘targeted ESS’ that aligns with causal inference. Targeted ESS can quantify how many observations effectively contribute to weighted estimates and can serve as an intuitive tool for communicating positivity concerns. Through analysis and simulations, we demonstrate its strengths and limitations. Notably, targeted ESS cannot detect severe cases of positivity violations or propensity model misspecifications. Additionally, we show why conventional ESS is not generally suitable in this setting. This work offers practical guidance for assessing IPTW estimate reliability in observational causal inference.
...
Causal inference relies on several key identifying assumptions, including positivity: all treatment levels must have non-zero probability for every possible covariate combination. Violations lead to unreliable causal effect estimates, yet positivity is often overlooked, and existing diagnostics have limitations. This assumption is particularly relevant for observational data, because treatment assignment is not independent of confounders. To remove this dependence, Inverse probability of treatment weighting (IPTW) estimators can be used. However, IPTW relies on the positivity assumption, and near-violations lead to extreme weights and unstable estimates. We investigate effective sample size (ESS) as a practical diagnostic for evaluating the estimability of causal effects in the face of near-positivity violations. The key contribution is a theoretical definition of ‘targeted ESS’ that aligns with causal inference. Targeted ESS can quantify how many observations effectively contribute to weighted estimates and can serve as an intuitive tool for communicating positivity concerns. Through analysis and simulations, we demonstrate its strengths and limitations. Notably, targeted ESS cannot detect severe cases of positivity violations or propensity model misspecifications. Additionally, we show why conventional ESS is not generally suitable in this setting. This work offers practical guidance for assessing IPTW estimate reliability in observational causal inference.
This paper addresses the problem of Inductive Synthesis by analysing the Metropolis-Hastings stochastic search algorithm. The goal of Inductive Synthesis is to generate programs whose intended behaviour is established through the use of input and output examples. The Metropolis-Hastings algorithm searches the set of all possible programs and finds possible solutions. Our experiments show that while optimization can be done under certain conditions, it does not improve the
algorithm’s success rate in synthesizing programs on complex domains compared to more randomized but domainspecific approaches.
...
algorithm’s success rate in synthesizing programs on complex domains compared to more randomized but domainspecific approaches.
...
This paper addresses the problem of Inductive Synthesis by analysing the Metropolis-Hastings stochastic search algorithm. The goal of Inductive Synthesis is to generate programs whose intended behaviour is established through the use of input and output examples. The Metropolis-Hastings algorithm searches the set of all possible programs and finds possible solutions. Our experiments show that while optimization can be done under certain conditions, it does not improve the
algorithm’s success rate in synthesizing programs on complex domains compared to more randomized but domainspecific approaches.
algorithm’s success rate in synthesizing programs on complex domains compared to more randomized but domainspecific approaches.