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

Trend · papers per month

0.6%1.2%1.8%2.4% · Nov 202419922001200920172026
48 results for single-variable interventions

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.

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.

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.

New method identifies causal variables from multi-node interventions, expanding on previous single-node approaches.

problem Inferring high-level causal variables from low-level observations under multiple interventions.
method Exploits variance trace of ground truth causal variables and regularizes for sparsity.
result First identifiability result for causal representation learning with multiple node interventions.

The study quantifies the information needed for causal queries at different levels of Pearl's hierarchy.

problem How much additional information is needed for interventional and counterfactual queries compared to observational queries?
method Formalized via query-class description length, using Kolmogorov complexity of answer oracles induced by SCMs.
result Binary acyclic SCMs show a quadratic gap between observational and interventional descriptions, and a logarithmic gap between interventional and counterfactual descriptions.

We compare observed corporate cumulative default probabilities to those calculated using a stochastic model based on an extension of the work of Black and Cox and find that corporations default as if via diffusive dynamics. The model, based on a contingent-claims analysis of corporate capital structure, is easily calib…

2000-12-29abs ↗pdf ↗

Improved bounds for continuous functions in online learning.

problem Generalizing mistake-bound model to continuous real-valued functions.
method Investigating the class of absolutely continuous functions with bounded derivative, proving bounds on prediction errors.
result Proved that for 1<p<21 < p < 2 with p=1+εp = 1+ε, the bound on the worst-case sum of the pthp^{th} powers of prediction errors is $Θ(ε^{- rac{1}{2}})$, independent of qq.

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.

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 ↗

New sampling strategy preserves relationships in multivariate scientific data.

problem Reducing storage and enabling efficient multivariate analyses on large scientific data.
method Uses principal component analysis for multivariate data and combines with existing univariate sampling algorithms.
result Efficacy demonstrated on real-world data sets, showing data reduction and multivariate analysis ease.

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.

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.

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.

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.

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.

Manifold calculus of functors, due to M. Weiss, studies contravariant functors from the poset of open subsets of a smooth manifold to topological spaces. We introduce "multivariable" manifold calculus of functors which is a generalization of this theory to functors whose domain is a product of categories of open sets. …

2009-04-27abs ↗pdf ↗

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.

Model identifies causal structure from paired observational and interventional data with unknown soft interventions.

problem Identifying causal structure from observational and interventional data with unknown soft interventions.
method Proposes a scalable causal discovery model that aggregates subset-level PDAGs and applies contrastive cross-regime orientation rules.
result The model asymptotically recovers the identifiable PDAG and can orient additional edges compared to non-contrastive subset-restricted methods.

Introduces CStrees for modeling context-specific causal models from observational and interventional data.

problem Modeling context-specific causal relationships from mixed data types.
method Introduces CStrees with a novel factorization criterion and graphical characterization for context-specific conditional independence models.
result Derives a graphical characterization of model equivalence for observational CStrees and extends it to CStree models under context-specific interventions.

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.

Paper characterizes causal graphs from hard interventions and proposes a learning algorithm.

problem Discovering causal structure from hard interventions and observational data.
method Proposes graphical constraints and a learning algorithm based on do-calculus.
result Characterizes interventional equivalence classes of causal graphs with latent variables.

Statistical test evaluates if personalizing interventions is cost-effective.

problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.

Paper tackles intervention extrapolation using identifiable representations.

problem Predicting effects of unseen interventions on outcomes.
method Combines identifiable representation learning with autoencoders to enforce linear invariance.
result Identifiable representations enable non-linear extrapolation of interventions.