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,657 papers · 148 categories

Trend · papers per month

4278541,2811,708 · Jun 202019922001200920172026
48 results for linear structural causal models

Extends linear structural causal models to include deterministic relations and latent confounders for causal discovery.

problem Causal discovery in linear SCMs with deterministic relations and latent confounders.
method Extended existing results to include deterministic relations and latent confounders, derived necessary and sufficient conditions for unique identifiability, proposed an algorithm for recovery.
result First work on identifiability results for causal discovery under latent confounding and deterministic relationships.

We solve structure learning for cyclic linear causal models using observational data.

problem Learning the structure of cyclic linear causal models from observational data.
method Assuming simple graphs, we use a criterion for distributional equivalence and implement a greedy search method.
result We show that simple cyclic models are of expected dimension and justify score-based methods for structure learning.

New method identifies causal parameters in tree-shaped linear models using cycles.

problem Identifying causal parameters from correlations in tree-shaped linear models.
method Investigates tree-shaped linear models, uses missing cycles to identify causal parameters, solves quadratic equations.
result Shows how missing cycles can be combined to obtain a unique solution for causal parameters.

New method discovers causal relationships in sparse linear data.

problem Discovering cause-effect relationships in sparse linear data.
method Uses structural matrix to reconstruct data and identify causal structures without independence tests.
result Outperforms existing methods in sparse causal structure recovery.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.

Develops a method to identify causal effects in linear models with latent variables.

problem Identifying causal effects in models with latent variables that are not independent.
method A novel graphical criterion and an integer linear program algorithm.
result Sufficient condition for identifying causal effects by rational formulas in the covariance matrix.

Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.

problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.

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.

SLEM uses machine learning to improve causal inference from observational data.

problem Improving causal inference from observational data using non-linear relationships.
method Super Learner Equation Modeling integrating machine learning ensembles.
result SLEM provides consistent and unbiased estimates of causal effects.

Estimates causal effects in Gaussian Linear SCMs with finite data.

problem Estimating causal effects from observational data with latent confounders.
method Centralized Gaussian Linear SCMs (CGL-SCMs) and EM-based estimation algorithm.
result Learned CGL-SCM parameters accurately recover causal distributions from finite observational samples.

Efficient algorithm for identifying causal effects in linear models.

problem Determining causal effects from observational data under latent confounding.
method Symbolic computation and efficient algorithm for finding identifying formulas.
result Proves the existence of identifying formulas of a specified degree in quasi-polynomial time.

We tackle causal discovery in linear systems with measurement error and unobserved causes.

problem Causal discovery in linear systems with measurement error and unobserved causes.
method Characterization of identifiability based on the mixing matrix, proposing causal structure learning methods.
result The structure of causal models can be identified under certain faithfulness assumptions.

Study tackles causal structure learning in linear models with unobserved variables and measurement error.

problem Challenges of unobserved common causes and measurement error in causal structure learning.
method Introduces LV-SEM-ME model with four types of variables and characterizes identifiability under separability condition.
result Establishes form of identification robustness for target effect in broader LV-SEM-ME model.

Empirical Bayes improves causal representation learning across multiple domains.

problem Estimating causal representations from data across multiple domains.
method Developed an EB ff-modeling algorithm for linearly-mixed causal representations.
result Our method achieves more accurate estimation of causal variables than other methods.

Bayesian model averaging improves causal effect estimation by averaging over multiple models.

problem Estimating causal effects under linear Structural Causal Models (SCMs).
method Bayesian model averaging using Gaussian scale mixture distributions for computational efficiency.
result Bayesian model averaging is optimal for causal effect estimation.

We consider learning the possible causal direction of two observed variables in the presence of latent confounding variables. Several existing methods have been shown to consistently estimate causal direction assuming linear or some type of nonlinear relationship and no latent confounders. However, the estimation resul…

2013-10-24abs ↗pdf ↗

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.

Flow models recover causal transformations from observational data and a valid ordering.

problem Causal inference with only observational data and a valid causal ordering.
method Flow models that can recover component-wise, invertible transformations of exogenous variables.
result Flow models outperform previous methods and deliver consistent performance across various structural causal models.

Bayesian method recovers causal structure in SEMs with equal error variances.

problem Recovering causal structure in SEMs with equal error variances.
method Bayesian DAG selection method using g-priors and the key property of minimum expected squared errors.
result The method consistently recovers the true graph without additional distributional assumptions.

New algorithm reduces regret in CBs with time-varying models.

problem Designing robust interventions in CBs with unknown, fluctuating causal models.
method Proposes a robust CB algorithm with upper and lower bounds on regret.
result Achieves nearly optimal ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) regret under certain conditions.

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.

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

We consider the task of causal structure learning over measurement dependence inducing latent (MeDIL) causal models. We show that this task can be framed in terms of the graph theoretic problem of finding edge clique covers,resulting in an algorithm for returning minimal MeDIL causal models (minMCMs). This algorithm is…

2019-10-19abs ↗pdf ↗

New method detects causal relationships from noisy measurements.

problem Discover causal relationships from noisy, imperfect measurements.
method Transformed Independent Noise (TIN) condition and ordered group decomposition.
result Identifies causal graph structure without over-complete ICA.

Bayesian causal inference method improves accuracy over traditional approaches.

problem Bayesian marginalisation over causal models is computationally infeasible.
method Decomposes structure marginalisation into causal orders and DAGs, using Gaussian processes for mechanisms and ARCO for orders.
result Method outperforms state-of-the-art in structure learning and inference.

New algorithm identifies causal effects in latent confounding models.

problem Identifying causal effects in linear non-Gaussian models with latent confounding.
method Recursive algorithm using rank conditions on higher-order cumulants.
result Algorithm achieves comparable performance to overcomplete ICA without knowing the number of latent variables.

Paper recovers latent causal structure and linear transformation from indirect observations.

problem Recovering latent causal structure and linear transformation from indirect observations.
method Established sufficient conditions for DAG recovery, leveraged score function properties, and used soft/hard interventions.
result Perfect recovery of latent DAG structure and linear transformation up to scaling using soft interventions, hard interventions with additional hypothesis testing.

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.

We introduce a model for causal structure learning from multivariate functional data, even when graphs have cycles.

problem Discovering causal relationships from multivariate functional data with cycles.
method Functional linear structural equation model with a low-dimensional causal embedded space.
result The proposed model is causally identifiable under standard assumptions.

Paper develops a method to learn causal networks with non-invertible functions.

problem Identifying causal relationships from observational data with non-invertible functional relationships.
method Proposes a test for non-invertible bivariate causal models and develops a method to incorporate this test in structure learning of DAGs.
result Our algorithms outperform existing DAG learning methods in identifying causal graphical structures.

DeepCausalMMM models marketing impacts using deep learning and causal inference.

problem Traditional MMM approaches struggle with non-linear dynamics and temporal patterns.
method Combines deep learning, causal inference, and marketing science. Uses GRUs for temporal patterns and DAG structure for channel dependencies.
result Captures non-linear dynamics and temporal patterns in marketing impacts.

The study uncovers latent capabilities of language models via causal representation learning.

problem Rigorous causal evaluations of language model capabilities are challenging due to confounding effects and computational costs.
method Proposes a causal representation learning framework to identify latent capability factors as causally interrelated after controlling for a common confounder (base model).
result Identifies a three-node linear causal structure explaining performance variations across 1500 models and six benchmarks.

This study uses causal Shapley values to analyze how socioeconomic factors cause the spread of COVID-19.

problem Understanding how socioeconomic factors cause the spread of COVID-19.
method The study employs an explanatory framework from cooperative game theory augmented with do calculus, specifically causal Shapley values, to analyze the causal connections.
result The causal Shapley values reveal distinct advantages of non-linear machine learning models over linear models in multivariate analysis.

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.

New PCstar algorithm discovers causal structure of max-linear Bayesian networks.

problem Discovering causal structure in max-linear Bayesian networks due to non-faithfulness.
method PC algorithm modified with CC^\ast-separation assumptions.
result PCstar algorithm can orient additional edges not possible with standard PC algorithm.

New algorithm disentangles latent features without strict assumptions.

problem Disentangling complex data-generating mechanisms into causally interpretable latent features.
method Linear CRL algorithm with topological ordering, pruning, and disentanglement.
result Recovering latent causal features up to an equivalence class under weaker assumptions.

We study how to learn optimal interventions sequentially given causal information represented as a causal graph along with associated conditional distributions. Causal modeling is useful in real world problems like online advertisement where complex causal mechanisms underlie the relationship between interventions and …

2019-10-11abs ↗pdf ↗