Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

6.6%13.3%19.9%26.5% · May 202619922001200920172026
48 results for interventional sampling

CAN learns conditional and interventional distributions from unlabeled data.

problem Learning conditional and interventional distributions from unlabeled data.
method CAN framework with LGN and CIGN architectures, equipped with an intervention mechanism.
result CAN generates both interventional and conditional samples without needing the causal graph.

New method disentangles mixed interventional and observational data in SEMs.

problem Learning causal relationships from mixed interventional and observational data.
method Developed a method to disentangle mixed interventional and observational data in linear SEMs with Gaussian noise.
result The method can identify causal graphs up to their interventional Markov Equivalence Class.

A new diffusion model encodes causal structures for better interventional sampling and edge inference.

problem Lack of causal analysis in standard diffusion models.
method Causality-encoded diffusion framework that trains conditional models consistent with a directed acyclic graph.
result The method enables accurate interventional sampling and edge inference, with theoretical guarantees and practical applications.

Paper proposes scalable algorithm to estimate intervention targets in linear models.

problem Estimating intervention targets in linear models from observational and interventional data.
method The paper proposes a scalable algorithm that estimates intervention sites from the difference between precision matrices of observational and interventional datasets.
result The algorithm consistently identifies all intervention targets and updates observational Markov equivalence classes to interventional ones.

The paper shows how to learn causal representations with few environments and finite samples.

problem Learning causal representations from limited data and environments.
method Explicit, finite-sample guarantees with a logarithmic number of interventions.
result Consistent recovery of latent causal graph, mixing matrix, and unknown intervention targets.

GIT uses gradient estimators to target interventions for causal discovery.

problem Challenges in inferring causal structure from observational data.
method GIT uses gradient estimators to target interventions for causal discovery.
result GIT performs on par with competitive baselines, surpassing them in low-data regimes.

We consider testing and learning problems on causal Bayesian networks as defined by Pearl (Pearl, 2009). Given a causal Bayesian network M\mathcal{M} on a graph with nn discrete variables and bounded in-degree and bounded `confounded components', we show that O(logn)O(\log n) interventions on an unknown causal Bayesian ne…

2018-05-24abs ↗pdf ↗

Method estimates causal effects from combined interventional and observational data.

problem Estimating causal effects from unobserved confounders.
method Causal reduction method replacing latent confounders with a single latent confounder.
result Improves estimation accuracy from combined data without observing all confounders.

Motivated by applications in computational advertising and systems biology, we consider the problem of identifying the best out of several possible soft interventions at a source node VV in an acyclic causal directed graph, to maximize the expected value of a target node YY (located downstream of VV). Our setting im…

2017-01-10abs ↗pdf ↗

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.

Study identifies components of unknown interventions in a mixture.

problem Identify components of a mixture of unknown interventions on a causal Bayesian Network.
method Construct example showing components not identifiable. Prove identifiability under mild conditions. Develop efficient algorithm for recovery. Analyze performance in simulation.
result Components of a mixture of unknown interventions can be uniquely identified under certain conditions.

New method samples from any causal effect given conditional generative models.

problem Sampling from un/conditional interventional distributions in high-dimensional data.
method Sequence of push-forward computations of conditional generative models.
result Algorithm enables sampling from any identifiable interventional distribution.

Resolves spurious correlations in causal models via intervention design.

problem Spurious correlations lead to incorrect causal models in reinforcement learning environments.
method Proposes a method to design interventions that improve causal models by incentivizing agents to find errors.
result Experimental results show improved causal models compared to baselines.

Bayesian method for inferring causal relations from mixed observational and interventional data.

problem Challenges in causal inference from heterogeneous study conditions with unknown soft interventions.
method Interventional Bayesian Gaussian equivalent score for a mixture of observational and interventional data.
result Effective characterisation of posterior distributions of causal structures and intervention effects.

Method identifies unknown intervention targets in structural causal models from diverse data.

problem Identifying unknown intervention targets in structural causal models from heterogeneous data.
method Two-phase approach: first recovers exogenous noises, second matches with endogenous variables.
result Proposed method uniquely identifies intervention targets under causal sufficiency assumption.

Synthetic Combinations learns unit-specific causal outcomes for combinatorial interventions.

problem Estimating unit-specific causal outcomes for all combinations of pp interventions in a heterogeneous setting.
method Latent factor model with Fourier expansion sparsity, imposing structure across units and interventions.
result Synthetic Combinations provides consistent estimation with poly(r) * (N + s^2p) observations, outperforming previous methods.

Directed acyclic graph (DAG) models are popular for capturing causal relationships. From observational and interventional data, a DAG model can only be determined up to its \emph{interventional Markov equivalence class} (I-MEC). We investigate the size of MECs for random DAG models generated by uniformly sampling and o…

2019-03-05abs ↗pdf ↗

This paper identifies the minimal set of nodes for optimal conditional interventions in causal bandits.

problem Optimizing decision-making in causal bandits with conditional interventions.
method Graphical characterization and efficient algorithm to identify the minimal set of nodes.
result The proposed algorithm significantly prunes the search space and accelerates convergence rates.

Controlled interventions provide the most direct source of information for learning causal effects. In particular, a dose-response curve can be learned by varying the treatment level and observing the corresponding outcomes. However, interventions can be expensive and time-consuming. Observational data, where the treat…

2016-05-05abs ↗pdf ↗

Paper tackles confounded ANMs, estimating ACEs with minimal interventions.

problem Estimating causal effects in the presence of unobserved confounders.
method Interventional distributions and randomized algorithm to reduce the number of required interventions.
result Poly-logarithmic number of interventions sufficient to infer causal effects in confounded ANMs.

Optimal intervention in economic networks modeled as influence maximization, with hard computational problems.

problem Optimal intervention in economic networks modeled as influence maximization.
method Transformed into influence maximization-like form, with theoretical and practical implications.
result Optimal intervention is NP-hard and cannot be approximated to a constant factor in polynomial time.

New method improves mHealth user engagement using Thompson sampling for count data.

problem Optimizing mHealth interventions for distal outcomes through proximal context.
method Combines count data models with Thompson sampling for contextual bandits.
result Improves user engagement in mHealth trials compared to existing methods.

The paper tackles generalization in machine learning by finding invariant representations of data.

problem Obtaining robust models that generalize well across different training environments.
method The paper introduces the concept of εε-approximate invariance to study the robustness of models to unseen SEMs.
result The paper provides finite-sample out-of-distribution generalization guarantees for approximate invariance in linear SEMs.

This work shifts focus from prediction to intervention in social systems.

problem The limitations of focusing solely on prediction in automated decision systems.
method Shift from prediction-focused paradigm to intervention-oriented approach.
result A new perspective unifies statistical frameworks and tools for ADS design, implementation, and evaluation.

Develops a framework for causal structure learning using both interventional and observational data.

problem Lack of identifiability of causal structures with only observational data.
method Bilevel polynomial optimization (Bloom) framework for causal structure discovery from interventional and observational data.
result Bloom framework provides convergence and optimality guarantees, surpassing other learning algorithms in experiments.

We identify which latent factors change between environments in linear causal models.

problem Identify latent factors that change between environments in linear causal models with fewer than dd interventions.
method Propose a method to identify shifted nodes in a smaller number of environments with coarser interventions.
result It is possible to identify the set of shifted nodes under mild assumptions.

New method for selective prediction under interventions learns causal structure from data.

problem Tight uncertainty sets in selective conformal prediction under unknown interventional settings.
method Partial causal structure learning for descendant indicators, contamination-robust coverage theorem, algorithms for descendant discovery and distance estimation.
result Valid selective conformal prediction under contamination up to 30% with controlled coverage.

The paper tackles causal bandits for SEMs, proposing algorithms that avoid estimating 2N2^N reward distributions.

problem Designing an optimal sequence of interventions in causal graphical models to minimize cumulative regret.
method Proposes two algorithms for causal bandits for linear structural equation models (SEMs), avoiding the estimation of 2N2^N reward distributions.
result Cumulative regrets scale as ildeO(dL+12NT) ilde{\cal O} (d^{L+\frac{1}{2}} \sqrt{NT}) under bounded noise and parameter space.

With the aim of building machine learning systems that incorporate standards of fairness and accountability, we explore explicit subgroup sample complexity bounds. The work is motivated by the observation that classifier predictions for real world datasets often demonstrate drastically different metrics, such as accura…

2019-10-24abs ↗pdf ↗

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.

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.

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.

Unified framework for estimating indirect effects in observational studies with unmeasured confounding.

problem Challenges in evaluating indirect effects due to unmeasured confounding and unethical exposures.
method Developed a unified identification and estimation framework using proximal causal inference.
result Unified identification and estimation of PIIE and causal effect of an intervening variable in settings with pervasive unmeasured confounding.

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.