New algorithm reduces interventional strategy complexity for causal graph discovery.
problem Designing efficient interventional strategies for causal graph discovery.
method Developed an r-adaptive algorithm for causal graph discovery that minimizes the number of interventions.
result Achieved an approximation of O(min{r, log n} * n^{1/min{r, log n}}) for the verification number.
New algorithms improve causal graph discovery with adaptive interventions, even under worst-case interventional costs.
problem Discover causal relationships from data with adaptive interventions and node-dependent costs.
method Define new benchmarks and provide adaptive search algorithms for causal graph discovery.
result Logarithmic approximations achieved under various settings: atomic, bounded size interventions and generalized cost objectives.
Algorithm detects causal change points quickly with adaptive interventions.
problem Detecting changes in causal models with interventions.
method Centralization technique, Kullback-Leibler divergence for intervention selection, adaptive intervention policy.
result Theoretical first-order optimality and validation through simulations and real-world studies.
Adaptive IP approach optimizes intervention design for causal graph recovery.
problem Designing efficient interventions to recover causal relationships from data.
method Iterative integer programming approach for optimizing information gain.
result Adaptive IP approach achieves full causal graph recovery with fewer interventions.
New analysis shows surprising results on adaptation speed of causal models.
problem Investigate the adaptation speed of causal models under interventions.
method Use convergence rates from stochastic optimization to measure adaptation speed.
result Surprising findings: anticausal model can be faster than causal model under certain conditions.
Unified RL survey for healthcare AI interventions.
problem Limited real-life application of RL in healthcare.
method Unified technical survey and case studies.
result Bridge between dynamic treatment regimes and mobile health.
We consider testing and learning problems on causal Bayesian networks as defined by Pearl (Pearl, 2009). Given a causal Bayesian network M \mathcal{M} M on a graph with n n n discrete variables and bounded in-degree and bounded `confounded components', we show that O ( log n ) O(\log n) O ( log n ) interventions on an unknown causal Bayesian ne…
New method uses limited labeled data and multiple starts to adapt models across domains.
problem Accurate predictions in target domain with few labeled data.
method Fine-tuning from multiple adaptive starts, extending UDA methods.
result Minimax-optimal target performance with limited labeled target data.
MetaCaDI learns causal graphs and unknown interventions from few data instances.
problem Discovering causal mechanisms in systems with high data costs and unknown interventions.
method MetaCaDI is a Bayesian meta-learning framework that optimizes for rapid adaptation to new intervention targets.
result MetaCaDI significantly outperforms state-of-the-art methods in causal graph recovery and intervention target prediction.
GAMBITTS uses GenAI for adaptive interventions, improving decision-making.
problem Adaptive interventions with GenAI-generated content.
method Generator-mediated bandit-Thompson sampling (GAMBITTS).
result GAMBITTS outperforms standard bandit methods in mobile health interventions.
Adaptive PCR improves panel data analysis with uniform guarantees.
problem Adaptive data collection in panel data settings.
method Adapting PCR to online settings using martingale concentration.
result Time-uniform guarantees for adaptive PCR in panel data.
This work tackles causal graph discovery with stochastic interventions to minimize the number of interventions.
problem Discovering the true causal graph from observational data with limited interventions.
method Proposes a stochastic intervention model and studies verification and search problems with approximation algorithms.
result Provides approximation algorithms with competitive ratios for verification and search problems.
Interventional domain adaptation improves feature transferability by removing spurious correlations.
problem Improper feature transferability due to spurious correlations in domain adaptation.
method Intervention strategy using unlabeled target data to generate counterfactual features and train discriminability invariance.
result Consistent performance improvements over state-of-the-art approaches in various domain adaptation tasks.
This paper tackles causal interactions in mixtures of DAGs using interventions.
problem Learning causal interactions among variables governed by a mixture of causal systems.
method Establishes necessary and sufficient conditions for intervention size, designs an adaptive algorithm.
result Identifies true edges in a mixture of DAGs using optimal or near-optimal interventions.
Mobile apps and machine learning improve malaria prevention and treatment.
problem High malaria cases and deaths in low-income countries.
method Adaptive interventions using mobile health apps and machine learning.
result Increased malaria testing, adherence, and provider skills.
An important goal common to domain adaptation and causal inference is to make accurate predictions when the distributions for the source (or training) domain(s) and target (or test) domain(s) differ. In many cases, these different distributions can be modeled as different contexts of a single underlying system, in whic…
New algorithms handle missing data to improve fairness in machine learning.
problem Missing values in data can lead to unfair outcomes in machine learning models.
method Developed scalable and adaptive algorithms to handle missing values while preserving predictive information.
result Our adaptive algorithms consistently achieve higher fairness and accuracy than standard impute-then-classify methods.
AI improves precision health through adaptive interventions.
problem Improving healthcare through personalized and dynamic treatments.
method Reinforcement learning (RL) for adaptive interventions in digital health.
result RL shows promise in dynamic healthcare problems.
We consider the problem of learning causal networks with interventions, when each intervention is limited in size under Pearl's Structural Equation Model with independent errors (SEM-IE). The objective is to minimize the number of experiments to discover the causal directions of all the edges in a causal graph. Previou…
Increasing technological sophistication and widespread use of smartphones and wearable devices provide opportunities for innovative and highly personalized health interventions. A Just-In-Time Adaptive Intervention (JITAI) uses real-time data collection and communication capabilities of modern mobile devices to deliver…
Paper shows fairness and domain adaptation can work together.
problem Algorithmic bias and distributional shifts in ML models.
method Leveraging fairness and distribution shifts, the paper shows how domain adaptation methods can mitigate bias.
result Enforcing individual fairness can improve out-of-distribution accuracy under covariate shift.
We propose to meta-learn causal structures based on how fast a learner adapts to new distributions arising from sparse distributional changes, e.g. due to interventions, actions of agents and other sources of non-stationarities. We show that under this assumption, the correct causal structural choices lead to faster ad…
HealthSyn generates synthetic user behavior data for health interventions.
problem Lack of representative data for testing AI health interventions.
method Uses Markov processes to simulate diverse user actions, generating logs for ML algorithms.
result Synthetic data can be used to develop, test, and evaluate ML algorithms and RL-based interventions.
A new experimental design method for combinatorial interventions reduces complexity and improves accuracy.
problem Efficiently conducting all possible combinatorial interventions with multiple treatments and potential interactions.
method Probabilistic factorial experimental design, applying random combinations of treatments and adapting over multiple rounds.
result Optimal dosage of 1/2 for each treatment yields near-optimal design for estimating any k-way interaction model.
Graph-coupled causal Bayesian optimization transfers information across related interventions.
problem Optimizing expensive systems where interventions are costly and causal effects are confounded.
method Ties intervention effects together through shared causal parameters, improving estimation.
result Information-gain and regret bounds show improved performance with shared mechanisms.
Study efficient algorithms for identifying minimum interventional sets to learn causal relationships.
problem Identify the smallest set of interventions to learn causal relationships between a subset of edges.
method Develop algorithms for subset verification and search problems under assumptions of faithfulness, causal sufficiency, and ideal interventions.
result For subset verification, an efficient algorithm is provided to compute a minimum sized interventional set.
SCTL scales causal domain adaptation without prior knowledge.
problem Domain adaptation with covariate shift and invariances across domains.
method SCTL: scalable causal discovery algorithm based on Markov blanket.
result SCTL achieves scalable and robust domain adaptation.
Q-learning with cSMART data assesses cAI tailoring variables.
problem Evaluating moderators in cAI construction.
method Clustered Q-learning with M-out-of-N Cluster Bootstrap.
result Constructs confidence intervals for causal effect moderation.
Due to the recent advancements in wearables and sensing technology, health scientists are increasingly developing mobile health (mHealth) interventions. In mHealth interventions, mobile devices are used to deliver treatment to individuals as they go about their daily lives. These treatments are generally designed to im…
It is known that from purely observational data, a causal DAG is identifiable only up to its Markov equivalence class, and for many ground truth DAGs, the direction of a large portion of the edges will be remained unidentified. The golden standard for learning the causal DAG beyond Markov equivalence is to perform a se…
New algorithms verify and search causal graphs with minimal interventions.
problem Recovering causal graphs from interventional data.
method Characterization of minimal intervention sets for verification, and adaptive graph separator algorithm for search.
result First provable algorithms for efficient verification and search of causal graphs.
Optimizes experiment design for causal structure learning in linear models with cycles.
problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.
method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.
result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.
Adapts causal inference for high-dimensional treatments like text strings.
problem Predicting effects of interventions with many possible variations.
method Adapts classical causal estimators to high-dimensional treatment spaces, balancing moment errors.
result Shows high-dimensional treatment spaces can be addressed with a single model.
Adaptive algorithm reduces regret in causal bandits.
problem Minimize regret in causal bandits with unknown d-separators.
method Adaptive algorithm exploiting d-separators without prior knowledge.
result Significantly smaller regret than previous methods.
A recommendation framework helps users choose healthcare interventions.
problem Choice overload in online healthcare communities.
method Multi-Armed Bandit (MAB) approach with innovative model components.
result Our recommendation design outperforms state-of-the-art systems.
Proposes DRIG for robust predictions using noise interventions.
problem Developing robust prediction models against distribution shifts.
method Distributional Robustness via Invariant Gradients (DRIG) exploiting general noise interventions.
result DRIG yields robust predictions among a data-dependent class of distribution shifts.
Estimates outcomes under hypothetical scenarios using a flexible framework.
problem Adapting to sudden shifts in treatment patterns.
method Doubly robust estimator using incremental interventions.
result Achieves n \sqrt{n} n -consistency and asymptotic normality. BFTS uses Bayesian Additive Regression Trees for improved personalized mobile health interventions.
problem Adapting to complex, non-linear user behaviors in personalized mobile health interventions.
method Bayesian Forest Thompson Sampling (BFTS) integrates Bayesian Additive Regression Trees (BART) into the exploration loop of contextual bandits.
result BFTS achieves state-of-the-art regret on tabular benchmarks and improves engagement rates by over 30% in a behavioral intervention study.
Extends Thompson sampling for RL with fewer episodes.
problem Limited episodes in RL settings.
method Batch Bayesian optimization over episodes to learn action bias terms.
result Significantly outperforms standard Thompson sampling.
AGENTICAITA uses AI agents to autonomously trade markets without human intervention.
problem Inability of traditional trading systems to adapt to market complexity.
method Introduces an agentic AI framework with specialized LLM agents reasoning, negotiating, and acting.
result Demonstrated operational correctness and non-trivial inter-agent negotiation in live market conditions.
New neural network method improves uplift modeling accuracy.
problem Overfitting in uplift modeling.
method Jointly optimizing difference in conditional means and transformed outcome losses using neural networks.
result Improves state-of-the-art uplift modeling on synthetic and real data.
Estimates joint causal effects using single-variable interventions on nonlinear models.
problem Estimating joint causal effects from single-variable interventions.
method Identifiability result and practical estimator for decomposing causal effects.
result Joint effects can be inferred without joint interventional data for nonlinear additive models.
We study the problem of causal structure learning when the experimenter is limited to perform at most k k k non-adaptive experiments of size 1 1 1 . We formulate the problem of finding the best intervention target set as an optimization problem, which aims to maximize the average number of edges whose directions are resolve…
A new method for analyzing adaptive experiments using kernel treatment effects.
problem Efficiently analyzing adaptive experiments that adjust treatment assignments based on outcomes.
method Kernel Treatment Effects (KTE) framework combining RKHS scores and witness functions.
result Effective for both mean shifts and higher-moment differences, outperforming adaptive baselines.
This paper tackles CRL for multi-node interventions, achieving identifiability guarantees.
problem CRL under unknown multi-node interventions, focusing on single-node assumptions.
method Establishes identifiability results for general latent causal models under stochastic interventions.
result Identifiability up to ancestors using soft interventions, perfect identifiability using hard interventions.
Causal diagrams based on do intervention are useful tools to formalize, process and understand causal relationship among variables. However, the do intervention has controversial interpretation of causal questions for non-manipulable variables, and it also lacks the power to check the conditions related to counterfactu…
Adaptive sequential testing optimizes epidemic control by learning optimal test strategies.
problem Optimizing test allocation in epidemics with network and temporal dependence.
method Adaptive sequential design with Online Super Learner for optimal test strategies.
result Superior performance in simulated university COVID-19 pandemic.
Our goal is to identify beneficial interventions from observational data. We consider interventions that are narrowly focused (impacting few covariates) and may be tailored to each individual or globally enacted over a population. For applications where harmful intervention is drastically worse than proposing no change…