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

4387130173 · May 202619922001200920172026
48 results for noise interventions

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.

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.

Method learns causal effects from multiple interventions in presence of unobserved confounders.

problem Disentangling causal effects from sets of interventions in the presence of unobserved confounders.
method Non-linear structural causal models with additive, multivariate Gaussian noise; algorithm that learns causal model parameters by pooling data from different regimes and maximizing combined likelihood.
result Identification proofs demonstrate that causal effects of single interventions can be learned from sets of interventions, even with unobserved confounders.

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.

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.

Estimates effects of multiple interventions with hidden confounders using single-variable interventions.

problem Estimating effects of multiple interventions in the presence of hidden confounders.
method Identifiability under nonlinear structural causal model with additive Gaussian noise; pooling and joint likelihood maximization.
result Proven identifiability and superior performance compared to baseline.

Study examines robustness of NPI effectiveness models against COVID-19.

problem How do NPI effectiveness estimates vary with model assumptions and data?
method Investigated 2 NPI effectiveness models and 6 variants, evaluated robustness to unseen countries, parameters, and data.
result NPI effectiveness estimates are remarkably robust to different variables.

Proposes a method to create robust linear models with noisy proxies of unobserved variables.

problem Learning robust linear models to handle interventions on unobserved variables with noisy proxies.
method Regularization term that balances in-distribution performance and robustness to interventions.
result Single proxy can create prediction optimal estimators under interventions of bounded strength.

New approach uses 'forward-looking' counterfactuals for treatment choice.

problem Using traditional 'retrospective' counterfactuals in treatment choice leads to counterintuitive results.
method Introduces 'counterfactual treatment choice' for forward-looking counterfactuals.
result Mismatches between interventional and forward-looking counterfactuals can lead to counterintuitive results.

A model learns causal representations from high-dimensional data.

problem Challenges in learning causal representations from high-dimensional data.
method Formulated a latent variable decoder model, Decoder BCD, for Bayesian causal discovery.
result Shows that using known intervention targets as labels helps in unsupervised Bayesian inference over structure and parameters.

A new measure of causal influence quantifies intrinsic contributions in DAGs.

problem Quantifying intrinsic causal contributions in Directed Acyclic Graphs (DAGs).
method Recursive decomposition of node contributions, structure-preserving interventions, Shapley symmetrization.
result A measure of intrinsic causal contribution that is invariant to node relabeling.

New method recovers causal DAGs from general environments without strict assumptions.

problem Recovering causal DAGs from real-world data with varying distributions.
method Formalizes desiderata for causal representation learning in general environments, leveraging sufficient change conditions up to third-order derivatives.
result Fully recovers latent DAG and identifies latent variables up to minor indeterminacies under nonparametric mixing.

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.

DCM uses diffusion models to answer causal queries from observational data.

problem Answering causal queries from observational data alone.
method Diffusion models to learn causal mechanisms and generate latent encodings.
result Significant improvements over existing methods for causal query answering.

The paper identifies generators of linear SDEs with noise types.

problem Identifying the generator of linear SDEs from their solution distribution.
method Deriving sufficient and necessary conditions for additive noise, and sufficient conditions for multiplicative noise.
result Generic conditions for identifying the generator of linear SDEs with both types of noise.

This paper considers the actor-critic contextual bandit for the mobile health (mHealth) intervention. The state-of-the-art decision-making methods in mHealth generally assume that the noise in the dynamic system follows the Gaussian distribution. Those methods use the least-square-based algorithm to estimate the expect…

2017-08-17abs ↗pdf ↗

Causal autoregressive flows enable accurate causal inference and prediction.

problem Causal discovery and interventional predictions in machine learning.
method Autoregressive normalizing flows with fixed variable orderings.
result Causal models derived from autoregressive flows are identifiable and allow for accurate interventional and counterfactual predictions.

New method identifies latent causal factors from observational data alone.

problem Identifying latent causal factors without interventions or graphical restrictions.
method Characterization of latent factors in nonlinear causal models with additive Gaussian noise and linear mixing, using a practical algorithm based on solving a quadratic program over observed data.
result Latent causal variables can be identified up to a layer-wise transformation, and further disentanglement is not possible.

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 consider the problem of learning causal directed acyclic graphs from an observational joint distribution. One can use these graphs to predict the outcome of interventional experiments, from which data are often not available. We show that if the observational distribution follows a structural equation model with an …

2013-09-26abs ↗pdf ↗

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.

ABCI infers causal models and queries simultaneously using Bayesian active learning.

problem Inference of causal models and effects in a two-stage process is inefficient and unnatural.
method Active Bayesian Causal Inference (ABCI) using Gaussian processes for sequentially designing experiments.
result ABCI is more data-efficient and accurate in learning causal queries from fewer samples.

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.

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…

2019-07-24abs ↗pdf ↗

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…

2016-06-16abs ↗pdf ↗

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.

SNPL learns safe policies for multi-objective interventions with high confidence.

problem Designing effective digital interventions balancing multiple objectives with noisy data.
method Leverages algorithmic stability to learn policies with high-confidence guarantees.
result Offers dramatic improvements in safety and policy gains with smaller sample sizes.

The paper presents a method to estimate joint interventional distributions from marginal interventional data.

problem Estimating joint interventional distributions from marginal interventional data.
method The paper extends the Causal Maximum Entropy method to use interventional data and employs Lagrange duality to prove the solution lies in the exponential family.
result The method allows for causal feature selection and inference of joint interventional distributions.

DCMA uses generative models to analyze treatment effects on entire outcome distributions.

problem Traditional mediation analysis focuses on summary contrasts, missing complex distributional changes.
method DCMA learns conditional generative models for mediators and outcome, reconstructing interventional distributions via Monte Carlo simulation.
result DCMA captures both summary effects and rich distributional contrasts like energy distance and Wasserstein distance.

DCMA uses generative models to analyze complex treatment effects on outcome distributions.

problem Analyzing complex and nonlinear causal mechanisms through outcome-level summary contrasts.
method Generative learning framework for identifying and estimating treatment effects on entire outcome distributions.
result Reconstructs interventional outcome distributions via Monte Carlo forward simulation, capturing both summary and distributional contrasts.

Bayesian method for causal discovery from unknown general interventions.

problem Learning causal DAGs from unknown interventions that modify parent sets.
method Bayesian approach with MCMC for approximating posterior DAGs and intervention targets.
result Bayesian method can identify DAGs and intervention targets up to equivalence classes.

Interventional data helps identify latent factors without distributional assumptions.

problem Identifying latent factors from interventional data without distributional assumptions.
method Leveraging geometric signatures of latent factors' support from interventional data.
result Latent causal factors can be identified up to permutation and scaling given data from perfect do-interventions.

IntDC framework uncovers causal relationships from non-interventional data.

problem Detecting causal relationships in non-interventional complex systems.
method Interventional Embedding Entropy (IEE) for causal strength measurement.
result IEE accurately finds causal edges and quantifies causal strength robustly.

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.

Optimizes causal effects on unknown graphs using Causal Entropy Optimization.

problem Optimizing causal effects in unknown causal graphs.
method Causal Entropy Optimization (CEO) framework that generalizes Causal Bayesian Optimization (CBO). Incorporates causal structure uncertainty in surrogate models and intervention selection.
result CEO achieves faster convergence to global optimum compared to CBO and improves upon sequential structure learning.

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.

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.

Paper relaxes faithfulness assumption for causal discovery using interventions.

problem Violation of faithfulness assumption in natural systems leads to incorrect causal structure identification.
method Use intervention-immediacy faithfulness assumption to identify causal structures with hard interventions.
result Interventions contain information about causal structure that can identify causal structures when faithfulness is violated.

FMI uses matching to mimic interventions for causal feature learning.

problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.

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.

The paper tackles matching a desired mean in causal systems through shift interventions.

problem Matching a desired mean in causal systems.
method Defining Markov equivalence classes, proposing active learning strategies, deriving lower bounds.
result Proposed active learning strategies require fewer interventions than previous approaches, especially for certain graph classes.