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

157313470626 · May 202619922001200920172026
48 results for value Causal Markov Condition

A new algorithm for robust causal discovery in small sample sizes.

problem Limited data leads to weak conditional independence tests in causal discovery.
method Proposes a kk-PC algorithm that bounds conditioning set size for robust causal discovery.
result The kk-PC algorithm enables more robust causal discovery in small sample sizes.

The paper defines conditions for learning causal graphs from data with unobserved variables.

problem Learning causal graphs from data with unobserved variables.
method Formalizes constraint-based structure learning algorithms under conditions and assumptions.
result Natural family of algorithms output Markov equivalent graphs to the causal graph under faithfulness assumption.

Paper characterizes and represents pairwise causal background knowledge for improved causal inference.

problem Improving causal inference by handling pairwise causal constraints.
method Graphical characterization, direct causal clause (DCC), unified representation, MPDAG, polynomial-time algorithms.
result Pairwise causal background knowledge uniquely decomposes into MPDAG and DCCs, improving causal effect identification.

We propose a method to infer causal structures containing both discrete and continuous variables. The idea is to select causal hypotheses for which the conditional density of every variable, given its causes, becomes smooth. We define a family of smooth densities and conditional densities by second order exponential mo…

2009-10-29abs ↗pdf ↗

Inferring the causal structure that links n observables is usually based upon detecting statistical dependences and choosing simple graphs that make the joint measure Markovian. Here we argue why causal inference is also possible when only single observations are present. We develop a theory how to generate causal grap…

2008-04-23abs ↗pdf ↗

Algorithm recovers causal graphs in presence of latent confounders and selection bias.

problem Recovering causal graphs in the presence of latent confounders and selection bias.
method Iterative causal discovery (ICD) algorithm that relies on causal Markov and faithfulness assumptions.
result Sound and complete algorithm that recovers the equivalence class of the underlying causal graph.

Study finds Value Granger-causes Size during crisis regimes but not during normal times.

problem Understanding regime-dependent predictive relationships between equity factors.
method Used 35 years of Fama-French data and a Student-t Hidden Markov Model (HMM) to identify crisis regimes.
result Value Granger-causes Size during crisis regimes but not during normal times, validating across multiple historical events.

We establish causal semantics for SDEs and develop methods to reason about them.

problem Understanding causal relationships in systems modeled by stochastic differential equations.
method We introduce a causal graph framework, Markov properties, and do-calculus for SDEs.
result We prove the σσ-separation Markov property and do-calculus for causal SDEs.

New approach reveals causal and probabilistic relationships from equations.

problem Understanding causal and probabilistic relationships from sets of equations.
method Simon's causal ordering algorithm and Markov ordering graph construction.
result Implied conditional independences and causal relations without solving equations.

Method infers causal structure from system behaviors using RKHS and kernel εε-machines.

problem Discovering causal structure in systems with varying external and measurement noise.
method Combines causal states and RKHS for efficient representation and inference of causal structure.
result Robustly estimates causal structure in high-dimensional data with varying noise.

Causal knowledge is vital for effective reasoning in science, as causal relations, unlike correlations, allow one to reason about the outcomes of interventions. Algorithms that can discover causal relations from observational data are based on the assumption that all variables have been jointly measured in a single dat…

2019-10-24abs ↗pdf ↗

A new algorithm uses IVs to learn optimal policies from observational data.

problem Learning optimal policies from unobserved variable confounded data.
method IV-aided Value Iteration (IVVI) algorithm based on conditional moment restrictions.
result First provably efficient algorithm for instrument-aided offline RL.

Polynomial delay algorithm tests causal models with hidden variables.

problem Testing causal models with hidden variables in polynomial delay.
method c-component local Markov property (C-LMP) and polynomial delay algorithm.
result First algorithm for poly-delay testing of CIs in causal graphs with hidden variables.

This work addresses the following question: Under what assumptions on the data generating process can one infer the causal graph from the joint distribution? The approach taken by conditional independence-based causal discovery methods is based on two assumptions: the Markov condition and faithfulness. It has been show…

2012-02-14abs ↗pdf ↗

The relationship between statistical dependency and causality lies at the heart of all statistical approaches to causal inference. Recent results in the ChaLearn cause-effect pair challenge have shown that causal directionality can be inferred with good accuracy also in Markov indistinguishable configurations thanks to…

2014-12-19abs ↗pdf ↗

New formalism for decision making combines causal structures with MDPs, improving reinforcement learning performance.

problem Sequential decision making with causal knowledge to improve performance.
method Causal Markov Decision Processes (C-MDPs) and C-UCBVI algorithm exploiting causal structure.
result C-UCBVI achieves an ildeO(HSZT) ilde{O}(HS\sqrt{ZT}) regret bound, independent of actions.

Paper resolves conflicting Shapley value approaches by showing conditional is unsound and marginal is preferred.

problem Conflicting results from conditional and marginal Shapley value approaches when features are correlated.
method Uses causal arguments to show differences arise from assumptions about missing causal information.
result Marginal approach is preferred over conditional due to causal soundness.

Improves DRL for long-term causal inference with semiparametric methods.

problem Efficient inference for policy values in nonparametric MDPs with stringent conditions.
method Semiparametric Double Reinforcement Learning (DRL) with superefficient nonparametric estimators.
result Relaxes overlap conditions and reduces high-dimensional density-ratio estimation.

We study 'meta-dependence' in conditional independence tests across different empirical distributions.

problem Understanding the breakdown of conditional independence properties in finite data.
method Geometric intuition and information projections to measure meta-dependence between conditional independences.
result We provide a measure of meta-dependence that consolidates findings across synthetic and real-world data.

A directed acyclic graph (DAG) is the most common graphical model for representing causal relationships among a set of variables. When restricted to using only observational data, the structure of the ground truth DAG is identifiable only up to Markov equivalence, based on conditional independence relations among the v…

2018-02-05abs ↗pdf ↗

The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.

problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.

We consider the problem of inferring the directed, causal graph from observational data, assuming no hidden confounders. We take an information theoretic approach, and make three main contributions. First, we show how through algorithmic information theory we can obtain SCI, a highly robust, effective and computational…

2018-08-20abs ↗pdf ↗

Forré introduces a new conditional independence notion for mixed variables.

problem Unified framework for random and non-stochastic variables.
method Unified framework of transitional conditional independence and causal calculus for iDMGs.
result Unified framework connects conditional independencies to graphical separation criteria.

PRL improves off-policy evaluation in partially observed MDPs.

problem Confounding and bias in offline reinforcement learning with unobserved state factors.
method Extends proximal causal inference to POMDPs, identifying and estimating target policy value.
result Semiparametrically efficient estimators for PRL in partially observed MDPs.

Develops a model for causal discovery in path spaces.

problem Discover causal relationships in path spaces using asymmetric independence.
method Theory linking E-separation in DMGs to conditional independence in SDEs, proving global Markov property, characterizing equivalence classes of graphs.
result Each equivalence class of graphs has a greatest element as a parsimonious representation, which can be identified from data.

This paper extends stable blanket theory to models with hidden variables and causal cycles.

problem Identifying stable predictors in models with hidden variables and causal cycles.
method Use acyclic directed mixed graphs (ADMGs) and directed graphs (DGs) with mm-separation and σσ-separation to characterize and construct intervention-stable predictor sets.
result Graphical characterizations of Markov blankets, stable frontiers, and stable blankets in models with hidden variables and cycles.

New method tests causal relationships from data without needing to learn the entire graph.

problem Testing if a causal graph belongs to a specific Markov equivalence class from observational data.
method Established bounds on the number of independence tests required and provided an algorithm that matches these bounds.
result Testing requires exponentially less independence tests compared to learning, especially in graphs with high in-degrees and small clique sizes.

New method reveals true causal functions in nonlinear time series, not just scores.

problem Causal discovery in nonlinear time series often uses scalar edge scores, which hide true function-valued causal influence.
method Formalized function-valued causal influence for additive, contribution-decomposable architectures. Introduced a practical framework based on ICE for estimating causal response functions directly from trained models.
result Edges with indistinguishable scalar scores can exhibit qualitatively different functional behaviors.

New method identifies nonstationary causal structures in time series data.

problem Identifying causal relationships in time series data that change over time.
method High-order Markov Switching Models for regime-dependent causal discovery.
result Scalable approach for estimating high-order regime-dependent causal structures.

A new sampler improves the inference of causal structures from observational data.

problem Inferring causal relationships from observational data when DAGs are Markov equivalent.
method Developed a non-reversible Markov chain, Causal Zig-Zag sampler, targeting Markov Equivalence Classes of DAGs.
result The sampler improves mixing and offers efficient algorithms for DAG inference.