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

265177102 · Jun 202019922001200920172026
48 results for sequential counterfactual

Develops methods for finding counterfactual explanations in sequential decision making.

problem Finding counterfactual explanations for sequential decision making processes.
method Formal characterization of sequential actions and states using Markov decision processes and Gumbel-Max structural causal model. Introduces a polynomial time algorithm based on dynamic programming.
result Algorithm finds optimal counterfactual explanations for sequential decision making.

New method for evaluating sequential recommendations with lower variance.

problem Evaluating good sequences of music, video, news, and e-commerce recommendations.
method Proposes a new counterfactual estimator for sequential reward interactions with lower variance and asymptotic unbiasedness.
result Our method outperforms existing methods in bias and data efficiency for sequential track recommendations.

New method for estimating counterfactual means in adaptive experiments.

problem Inference for counterfactual means in sequentially designed experiments with adaptive treatment policies.
method Latent factor model and nearest neighbors method for estimation.
result Asymptotically valid confidence intervals for counterfactual means established.

G-Net uses deep learning for complex counterfactual outcome prediction.

problem Estimating counterfactual outcomes under dynamic treatment strategies.
method G-Net is a sequential deep learning framework for G-computation.
result G-Net can handle complex temporal data and provide accurate treatment effects.

CDM models counterfactual outcomes in longitudinal data with improved accuracy.

problem Predicting counterfactual outcomes in longitudinal data with complex time-dependent confounding.
method Causal Diffusion Model (CDM) using denoising diffusion architecture with relational self-attention.
result CDM outperforms state-of-the-art methods in generating full probabilistic distributions of counterfactual outcomes.

PyCFRL helps ensure fair reinforcement learning policies from offline data.

problem Ensuring fairness in reinforcement learning policies for disadvantaged groups.
method Sequential data preprocessing to learn counterfactually fair policies.
result PyCFRL implements a novel algorithm for fair RL policy learning.

The paper proposes a fair reinforcement learning framework to prevent healthcare disparities.

problem Unfair reinforcement learning policies in healthcare can lead to socioeconomically-disadvantaged subgroups being underprivileged.
method The paper introduces a counterfactual fairness framework and a sequential data preprocessing algorithm to achieve fair sequential decision making.
result The proposed approach greatly enhances fair access to counseling in a digital health dataset designed to reduce opioid misuse.

A new method generates counterfactual treatment outcomes for time-varying treatments.

problem Estimating counterfactual outcomes for time-varying treatments with high-dimensional outcomes.
method Conditional generative framework with inverse probability re-weighting.
result Our method outperforms state-of-the-art baselines in generating high-quality counterfactual samples.

A method removes treatment-covariate dependence for counterfactual prediction without adversarial training.

problem Counterfactual prediction under assignment bias.
method Information-theoretic approach learning a stochastic representation Z to minimize mutual information with outcomes.
result The method performs favorably in likelihood, counterfactual error, and policy evaluation compared to adversarial baselines.

C-kNN-LSH identifies similar patient histories for causal inference in longitudinal data.

problem Estimating causal effects from longitudinal trajectories with high-dimensional confounding.
method C-kNN-LSH uses locality-sensitive hashing to find clinical twins and estimate treatment effects.
result C-kNN-LSH outperforms existing methods in capturing recovery heterogeneity and estimating policy values.

Proposes a method to improve treatment policies in data-scarce clinical settings.

problem Improving treatment policies in data-scarce clinical settings with unobserved confounding.
method Uses a causal mechanism to model the underlying generative process and augments counterfactual trajectories with source domain priors.
result Significantly improves treatment policy performance in a simulated sepsis treatment task.

Proposes a framework to explain KS deterioration in credit risk models.

problem Inconsistent and ad hoc diagnosis of KS decline in credit risk models.
method Counterfactual diagnostic framework attributing KS decline to sampling variability, portfolio composition, covariate shift, and residual deterioration.
result The proposed approach provides more interpretable and governance-relevant explanations than threshold-based review alone.

The paper tackles finding optimal treatment sequences in continuous state spaces.

problem Finding counterfactually optimal action sequences in continuous state spaces.
method Formalizes the problem using finite horizon Markov decision processes and structural causal models. Develops a search method based on the A* algorithm.
result The method can find optimal action sequences in polynomial time under certain conditions.

Proposes methods to identify and estimate counterfactual distributions with confounding.

problem Estimating counterfactual distributions in the presence of confounding.
method Nonparametric identification and semiparametric estimation using conditional copulas and machine learning.
result Valid inference for individual-level effects and nonparametric identifiability of latent confounding subspace.

The paper proposes a method to explain expert decisions by modeling preferences with 'what if' outcomes.

problem Interpreting and auditing decision-making policies in institutions.
method Integrating counterfactual reasoning into batch inverse reinforcement learning.
result The method effectively recovers accurate and interpretable descriptions of expert behavior.

Understanding how "black-box" models arrive at their predictions has sparked significant interest from both within and outside the AI community. Our work focuses on doing this by generating local explanations about individual predictions for tree-based ensembles, specifically Gradient Boosting Decision Trees (GBDTs). G…

2019-07-04abs ↗pdf ↗

DeDUCE efficiently generates realistic counterfactuals for image classifiers.

problem Generating accurate counterfactual explanations for large image classifiers.
method Developed a new algorithm using spectral normalization to efficiently generate counterfactuals.
result Our algorithm consistently produces counterfactuals closer to the original inputs with comparable realism.

We establish a foundation for multivariate counterfactual identification using dynamic optimal transport.

problem Addressing the open question of counterfactual identification for high-dimensional multivariate outcomes from observational data.
method Establish a foundation for multivariate counterfactual identification using continuous-time flows, including non-Markovian settings, with tools from dynamic optimal transport.
result Characterise the conditions under which flow matching yields a unique, monotone, and rank-preserving counterfactual transport map, ensuring consistent inference.

A new framework for robust and coherent counterfactual transports.

problem Estimating joint distributions over counterfactual outcomes in personalized decision-making and treatment risk assessment.
method Counterfactual cocycles that use algebraic structure to provide coherence and identifiability guarantees, bridging the gap between bijective SCMs and OT methods.
result Counterfactual cocycles provide state-of-the-art performance and noise-robustness across synthetic benchmarks and a real-world study.

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.

The paper analyzes counterfactual invariance and its relation to conditional independence.

problem Understanding the relationship between counterfactual invariance and conditional independence.
method Theoretical analysis of existing definitions, graphical implications, and mathematical proofs.
result Counterfactual invariance implies conditional independence, but not the other way around.

New framework improves counterfactual predictions using causal inference.

problem Challenges in predicting counterfactual outcomes with limited covariates and high-dimensional outcomes.
method Variational Bayesian causal inference framework for counterfactual generative modeling.
result Framework encourages disentangled exogenous noise and correct identification of causal effects.

Counterfactual data augmentations may not ensure OOD robustness if performed by a context-guessing machine.

problem Deep learning models lack out-of-distribution robustness due to reliance on spurious features.
method Theoretical analysis and demonstration of counterfactual data augmentations performed by a context-guessing machine.
result Counterfactual data augmentations by a context-guessing machine do not lead to robust OOD classifiers.

New method improves model reconstruction using counterfactuals and polytope theory.

problem Reconstructing models with minimal input changes and avoiding decision boundary shifts.
method Using polytope theory to derive loss functions that treat counterfactuals differently from ordinary instances.
result Improves fidelity between target and surrogate model predictions on multiple datasets.

New method debiases counterfactual distributions using observational data.

problem Estimating counterfactual distributions under interventions without relying on observational data.
method Flow-matching approach to learn counterfactual distributions from observational data.
result Deconfounding flows outperform existing debiased counterfactual distribution estimators.

Proposes methods for learning optimal dynamic treatment regimes robust to unconfoundedness violations.

problem Estimating optimal dynamic treatment regimes using historical observational data when unconfoundedness is violated.
method Utilizes proximal causal inference framework to propose three nonparametric identification methods, a (K+1)-robust method, and establish a semiparametric efficiency bound.
result Establishes the (K+1)-robust method for learning optimal dynamic treatment regimes, validating its efficiency and multiple robustness through numerical experiments.

Proposes a method to generate counterfactuals for ensemble models using entropic risk measures.

problem Finding a single counterfactual explanation for an ensemble of models.
method Incorporates entropic risk measure into a constrained optimization to generate counterfactuals valid for an adjustable fraction of models.
result Entropic risk measure allows generation of counterfactuals valid for all models in the ensemble under a limiting case.

We define and compute plausible counterfactual explanations using density constraints.

problem Efficiently compute plausible counterfactual explanations for machine learning models.
method Propose and study a formal definition of plausible counterfactual explanations, use density estimators, and introduce convex density constraints.
result Convex density constraints ensure plausible and feasible counterfactual explanations.

Counterfactual explanations can be obtained by identifying the smallest change made to a feature vector to qualitatively influence a prediction; for example, from 'loan rejected' to 'awarded' or from 'high risk of cardiovascular disease' to 'low risk'. Previous approaches often emphasized that counterfactuals should be…

2019-10-21abs ↗pdf ↗

New method warns of counterfactual non-identifiability in DSCMs.

problem Counterfactual inference from observational data is non-identifiable even without unobserved confounding.
method Prove counterfactual identifiability for monotonic generation mechanisms, provide impossibility result for general mechanisms, propose method for estimating worst-case errors.
result Non-identifiability of counterfactual inference from observational data, even in absence of unobserved confounding.

In this paper, we study counterfactual fairness in text classification, which asks the question: How would the prediction change if the sensitive attribute referenced in the example were different? Toxicity classifiers demonstrate a counterfactual fairness issue by predicting that "Some people are gay" is toxic while "…

2018-09-27abs ↗pdf ↗

This study analyzes counterfactual explanations for student success models.

problem Improving trust in machine learning models for student success prediction.
method Comparison of counterfactual generation methods (WhatIf, Multi-Objective, Nearest Instance) for student success prediction models.
result WhatIf Counterfactual Explanations are more effective for student success prediction models.

CVIB uses information theory to learn counterfactuals from MNAR data without RCTs.

problem Debiasing learning from missing-not-at-random (MNAR) data in recommendation systems.
method CVIB, a variational information bottleneck, separates task-aware mutual information into factual and counterfactual parts.
result CVIB significantly enhances both shallow and deep models in recommendation systems.

The paper connects counterfactual fairness to robust prediction and group fairness using causal context.

problem The challenge of ensuring fairness in AI systems when counterfactuals cannot be directly observed.
method Using causal context to bridge counterfactual fairness, robust prediction, and group fairness.
result Counterfactual fairness is equivalent to group fairness metrics in specific contexts.

ARFs generate plausible counterfactuals for models, improving model understanding.

problem Creating realistic counterfactuals for model analysis.
method Adversarial Random Forests (ARFs) for generating plausible counterfactuals.
result ARFs efficiently generate plausible counterfactuals in a model-agnostic way.

EXOC framework uses auxiliary variables for counterfactual fairness in machine learning.

problem Balancing fairness and predictive accuracy in models with sensitive attributes.
method EXOC framework uses auxiliary variables to define an auxiliary node and a control node for counterfactual fairness.
result EXOC framework outperforms state-of-the-art approaches in achieving counterfactual fairness.