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

2675348011,068 · Jun 202019922001200920172026
48 results for Causal Adversarial Network

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.

FAIR-NN finds invariant variables for causal inference across diverse environments.

problem Nonparametric invariance and causal learning in regression models with varying joint distributions.
method FAIR-NN framework using adversarial optimization and neural networks.
result FAIR-NN identifies invariant variables and quasi-causal variables under minimal conditions.

Adversarial CBO optimizes under interventions by adversaries and non-stationarities.

problem Optimizing in the presence of adversaries and non-stationary factors.
method Formalizes CBO as ACBO, introduces CBO-MW algorithm combining online learning and causal modeling.
result First algorithm with bounded regret for ACBO, achieving superior performance in synthetic and real-world environments.

Proposes efficient deep causal generative models for high-dimensional causal inference.

problem Inefficient training of deep generative models for high-dimensional data.
method Modular training of deep causal generative models using adversarial training and pre-trained models.
result First algorithm that provably samples from any identifiable causal query in the presence of latent confounders.

This paper introduces a new method to deceive causal structure learning by omitting data.

problem Deceiving causal structure learning algorithms with incompletely observed data.
method Adversarial missingness attack to bias the learned causal structures.
result Theoretical and practical attack mechanisms are developed for various SCMs.

COT-GAN generates sequential data with a causal optimal transport approach.

problem Generating sequential data with temporal causality constraints.
method Adversarial training with Causal Optimal Transport (COT) and entropic penalization.
result COT-GAN effectively learns time-dependent data distributions and generates stable time series data.

Machine learning models, especially deep neural networks have been shown to be susceptible to privacy attacks such as membership inference where an adversary can detect whether a data point was used for training a black-box model. Such privacy risks are exacerbated when a model's predictions are used on an unseen data …

2019-09-27abs ↗pdf ↗

We provide an approach for learning deep neural net representations of models described via conditional moment restrictions. Conditional moment restrictions are widely used, as they are the language by which social scientists describe the assumptions they make to enable causal inference. We formulate the problem of est…

2018-03-19abs ↗pdf ↗

Transcriptomics response of SK-N-AS cells to methamidophos (an acetylcholine esterase inhibitor) exposure was measured at 10 time points between 0.5 and 48 h. The data was analyzed using a combination of traditional statistical methods and novel machine learning algorithms for detecting anomalous behavior and infer cau…

2019-08-11abs ↗pdf ↗

Biases in observational data of treatments pose a major challenge to estimating expected treatment outcomes in different populations. An important technique that accounts for these biases is reweighting samples to minimize the discrepancy between treatment groups. We present a novel reweighting approach that uses bi-le…

2018-10-17abs ↗pdf ↗

Develops a Causal Transformer for estimating counterfactual outcomes from longitudinal data.

problem Estimating counterfactual outcomes over time from observational data is challenging due to complex, long-range dependencies.
method Combines three transformer subnetworks with separate inputs for time-varying covariates, previous treatments, and previous outcomes into a joint network with in-between cross-attentions. Uses a custom, end-to-end training procedure with a counterfactual domain confusion loss to address confounding bias.
result Achieves superior performance over current baselines in synthetic and real-world datasets.

A new causal discovery method, Structural Agnostic Modeling (SAM), is presented in this paper. Leveraging both conditional independencies and distributional asymmetries, SAM aims to find the underlying causal structure from observational data. The approach is based on a game between different players estimating each va…

2018-03-13abs ↗pdf ↗

GANICE improves GAN-based causal inference by minimizing averaged Wasserstein risk.

problem Estimating interventional outcome distributions and quantiles in causal inference.
method GANICE uses extended Wasserstein distance and a cellwise critic to minimize averaged Wasserstein risk.
result GANICE achieves minimax optimality and consistently outperforms existing methods.

The paper proposes a neural network method to calibrate LSV models without interpolation.

problem Calibrating LSV models with market option prices using neural networks.
method Parametrizing leverage function with neural networks and learning parameters from market prices; using deep hedging for variance reduction.
result The method accurately calibrates LSV models and outperforms interpolation methods.

We consider the hypothesis testing problem of detecting conditional dependence, with a focus on high-dimensional feature spaces. Our contribution is a new test statistic based on samples from a generative adversarial network designed to approximate directly a conditional distribution that encodes the null hypothesis, i…

2019-07-09abs ↗pdf ↗

Class selectivity affects robustness to corruptions but not to adversarial attacks.

problem Understanding the relationship between class selectivity and robustness in neural networks.
method Investigated the impact of class selectivity on robustness to natural corruptions and adversarial attacks using Tiny ImageNetC and CIFAR10C datasets.
result Decreasing class selectivity increases robustness to both natural corruptions and adversarial attacks.

Improves representation learning for individual treatment effect estimation.

problem Estimating individual treatment effects with high accuracy.
method Introduces a structure keeper to maintain correlation between baseline covariates and representations, trains a discriminator to balance representation and information loss.
result Proposed SMRL algorithm minimizes treatment estimation error and outperforms state-of-the-art methods.

This thesis tackles causality in machine learning, improving OOD generalization and robustness.

problem Machine learning struggles with OOD generalization and robustness due to lack of causality modeling.
method Exploits the principle of independent causal mechanisms (ICM) to ensure conditional distribution invariance under distribution shifts.
result Demonstrates how incorporating causality can enhance machine learning's OOD generalization, interpretability, and robustness.

Tree-Query uses LLMs to discover causal relationships in a transparent, interpretable manner.

problem Error propagation in classical causal discovery methods and opaque, confidence-free behavior of recent LLM-based causal oracles.
method Tree-Query is a tree-structured, multi-expert LLM framework that reduces causal discovery to queries about backdoor paths and dependencies.
result Tree-Query provides interpretable judgments with robustness-aware confidence scores and improves structural metrics over LLM baselines.

The ability to learn and act in novel situations is still a prerogative of animate intelligence, as current machine learning methods mostly fail when moving beyond the standard i.i.d. setting. What is the reason for this discrepancy? Most machine learning tasks are anti-causal, i.e., we infer causes (labels) from effec…

2018-12-03abs ↗pdf ↗

Reinterprets Granger causality with causal Bayesian networks and Reichenbach's principles.

problem Lack of a rigorous causal foundation in Granger causality.
method Reinterpreting Granger causality through Reichenbach's principles and causal Bayesian networks, implementing as c-GC.
result c-GC provides a more principled framework for causal discovery in observational datasets.

Proposes DCNAR for dynamic causal inference from neural time series.

problem Uncertainty and evolution of causal structure in real-world domains.
method Two-stage neural causal modeling integrating discovery and inference.
result Dynamic causal inferences are more stable and meaningful than alternatives.

New method quantifies intrinsic causal contributions in neural networks.

problem Measuring the causal influence of input features in deep neural networks.
method Proposes an identifiable generative post-hoc framework to quantify intrinsic causal contributions (ICC) as structural causal models.
result ICC generates more intuitive and reliable explanations compared to existing global explanation techniques.

CRN learns causal models using neural networks, scaling with variables and leveraging prior knowledge.

problem Challenges in learning causal models, especially scalability and leveraging prior knowledge.
method Causal Relational Networks (CRN) using continuous representations and previously learned information.
result CRN achieves high accuracy and quick adaptation to new causal models on synthetic data.

CgNN uses network structure as IVs to estimate causal effects in networks.

problem Hidden confounders complicate causal effect estimation in network data.
method CgNN combines GNNs and attention mechanisms to leverage network structure as IVs.
result CgNN effectively mitigates hidden confounder bias and improves causal effect estimation.

Blog post comparing neural network methods for causal inference.

problem Estimating heterogeneous treatment effects in causal inference.
method Developed and compared a fully connected neural network implementation of Bayesian Causal Forest.
result Improvements in performance in simulation settings.

Interpretable model for Granger causality using neural networks.

problem Inferring Granger causality in complex dynamical systems.
method Extension of self-explaining neural networks for multivariate Granger causality.
result Framework performs on par with baseline methods and better at inferring interaction signs.

Deep Causal Graphs model complex causal relationships using neural networks.

problem Limited applicability of parametric causal models to real-life datasets with non-linear relationships.
method Deep Causal Graphs, an abstract specification for neural networks to model causal distributions.
result Demonstrates expressive power in modelling complex interactions and provides true causal counterfactuals.

A neural network finds causal relationships among latent variables.

problem Learning causal structure among latent variables in high-dimensional data.
method Redundant Input Neural Network (RINN) with modified architecture and regularized objective function.
result The RINN method successfully recovers latent causal structure between input and output variables.

Model predicts counterfactuals under domain shift and inaccessible variables.

problem Runtime domain corruption impairs counterfactual prediction.
method Subsumes counterfactual prediction under domain adaptation, uses adversarial domain adaptation to reduce distribution disparity.
result VEGAN outperforms baselines in individual-level treatment effect estimation.

Causal inference often relies on the counterfactual framework, which requires that treatment assignment is independent of the outcome, known as strong ignorability. Approaches to enforcing strong ignorability in causal analyses of observational data include weighting and matching methods. Effect estimates, such as the …

2020-01-09abs ↗pdf ↗

Contrastive examples improve fairness in face recognition by balancing minority and majority groups.

problem Face recognition algorithms favor majority groups in training data.
method Create contrastive examples by swapping group memberships in the training dataset.
result Contrastive examples improve fairness metrics like equalized odds.