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

Trend · papers per month

203406608811 · Jun 202019922001200920172026
48 results for counterfactual optimization

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.

Optimizes wireless power control using graph neural networks and counterfactual optimization.

problem Mitigating interference in wireless networks with multiple transmitter-receiver pairs.
method Graph neural network architecture combined with unsupervised primal-dual counterfactual optimization.
result Guarantees a minimum rate constraint that adapts to network size, balancing user rates.

Method for explaining machine learning survival models using counterfactuals.

problem Tackles the challenge of explaining survival models in machine learning.
method Introduces a condition based on the difference of mean times to event for counterfactual explanation. Reduces the problem to a convex optimization problem for Cox models and applies Particle Swarm Optimization for other models.
result Demonstrates the effectiveness of the proposed method through numerical experiments.

This paper introduces DCE for better counterfactual explanations using optimal transport.

problem Lack of nuanced distributional characteristics in existing counterfactual explanations.
method Formulates a chance-constrained optimization problem using optimal transport to derive counterfactual distributions.
result DCE provides deeper insights into decision-making models by aligning counterfactual distributions with factual ones.

This paper introduces collective counterfactual explanations for groups of instances in classification models.

problem Understanding how classification models make decisions for groups of instances.
method Novel Mathematical Optimization models to find collective counterfactual explanations that minimize total perturbation cost.
result Detects critical features for entire dataset classification and handles outliers.

Proposes MOC method for better counterfactual explanations in ML models.

problem Difficulties in balancing multiple objectives for counterfactual explanations.
method Translates counterfactual search into a multi-objective optimization problem.
result Returns diverse counterfactuals with different trade-offs and maintains feature diversity.

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.

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 ↗

New method generates plausible counterfactuals for time series classification.

problem Generating realistic counterfactuals for time series data.
method Gradient-based optimization with soft-DTW alignment and multi-faceted loss function.
result Our method outperforms existing approaches in temporal realism and distributional alignment.

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.

The paper tackles strategic behavior in decision-making with counterfactual explanations.

problem Finding optimal counterfactual explanations and policies in a strategic setting.
method NP-hard problem, greedy algorithm, submodularity, randomized algorithm, matroid constraint.
result Optimal counterfactual explanations and policies increase utility.

CFRecs uses counterfactual reasoning to improve graph-based recommendations in real estate.

problem Improving model interpretability and actionable insights in graph-based recommender systems.
method A two-stage architecture combining GNN and Graph-VAE to propose minimal yet impactful changes in graph structure and node attributes.
result Demonstrates effectiveness in delivering actionable recommendations for home buyers and sellers.

Develops optimal decision-making framework for uncertain counterfactuals.

problem Ensuring reliability of predictions in high-stakes decisions.
method Policy-Coupled Risk-Averse Conformal Prediction (PC-RACP).
result Optimal prediction sets for counterfactual decisions with valid coverage.

Proposes an efficient method for ordered counterfactual explanations.

problem Insufficient explanation of perturbation vectors for executing actions.
method Mixed-Integer Linear Optimization (MILP) approach for evaluating and extracting optimal pairs of actions and orders.
result Demonstrated effectiveness of the proposed method on real datasets.

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 measure captures differences across entire distributions of counterfactual outcomes.

problem Capturing differences across entire distributions of counterfactual outcomes.
method Entropic optimal transport measure, statistical functional, smooth transformation of embeddings.
result Established first-order and second-order pathwise differentiability.

ACE improves counterfactual explanations with fewer model queries.

problem Inefficient sampling for counterfactual explanations in machine learning models.
method Adaptive sampling combining Bayesian estimation and stochastic optimization.
result ACE achieves superior evaluation efficiency compared to state-of-the-art methods.

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.

A deep RL approach generates counterfactual instances efficiently.

problem Efficient generation of counterfactual instances for large datasets and diverse models.
method Deep reinforcement learning to optimize counterfactual instances in a single forward pass.
result Model-agnostic and scalable counterfactual generation.

The paper tackles counterfactual learning for stochastic policies with continuous actions.

problem Learning stochastic policies with continuous actions from logged data.
method Introduces a joint kernel embedding of contexts and actions to model continuous actions, and uses proximal point algorithms and smooth estimators for optimization.
result Demonstrates the benefits of using proximal point algorithms and smooth estimators for counterfactual learning.

The paper tackles counterfactual inference with multioutput deep kernels in high-dimensional settings.

problem Performing counterfactual inference with observational data in high-dimensional settings with multiple actions and outcomes.
method The paper presents a general class of counterfactual multi-task deep kernels models based on Structural Causal Models (SCM) and Gaussian Processes.
result The models estimate causal effects and learn policies efficiently, scaling well with high dimensions.

This manuscript introduces the idea of using Distributionally Robust Optimization (DRO) for the Counterfactual Risk Minimization (CRM) problem. Tapping into a rich existing literature, we show that DRO is a principled tool for counterfactual decision making. We also show that well-established solutions to the CRM probl…

2019-06-14abs ↗pdf ↗

New RL method learns policies from few data using causal models.

problem Limited interaction data and heterogeneous patient responses.
method Exploits structural causal models to model state dynamics and counterfactual reasoning.
result Counterfactual RL algorithms converge to optimal value function.

CONFETTI improves interpretability of deep learning models for MTS by providing counterfactual explanations.

problem Lack of transparency in deep learning models for multivariate time series classification.
method CONFETTI is a novel multi-objective counterfactual explanation method that balances prediction confidence, proximity, and sparsity.
result CONFETTI outperforms state-of-the-art methods in various metrics, improving interpretability and decision support.

DoubleGen addresses bias in generative modeling of counterfactuals.

problem Bias in generative models for counterfactual outcomes.
method Doubly robust framework that modifies generative modeling training objectives to mitigate confounding and misspecification biases.
result Successfully addresses confounding bias even if only one auxiliary model is correct.

Proposes a new method to measure and avoid harm in machine learning decisions.

problem Measuring and avoiding harm in machine learning algorithms.
method Formal definition of harm and benefit using causal models, counterfactual objective functions.
result Demonstrates that standard machine learning methods can lead to harmful policies under distributional shifts.

Proposes a sparsity algorithm to improve corporate credit ratings.

problem Improving credit ratings of publicly traded companies.
method Formulates counterfactual explanation as an optimization problem and proposes a sparsity algorithm to maximize sparsity.
result The sparsity algorithm can capture features that improve credit ratings.

Machine learning promises to revolutionize clinical decision making and diagnosis. In medical diagnosis a doctor aims to explain a patient's symptoms by determining the diseases \emph{causing} them. However, existing diagnostic algorithms are purely associative, identifying diseases that are strongly correlated with a …

2019-10-15abs ↗pdf ↗

A fast method for finding counterfactual explanations for decision forests.

problem Finding counterfactual explanations for decision forests efficiently.
method Constrain optimization to data-populated regions, reducing to nearest-neighbor search.
result Very fast and realistic counterfactual explanations for decision forests.

Generates counterfactuals in target domain from source domain observations.

problem Cross-domain learning with domain shifts and lack of parallel datasets.
method Unsupervised, Neural Causal Models, Joint Causal Graphs, Effect-Intrinsic vs Domain-Intrinsic Variables.
result Framework generates counterfactuals that closely match ground truth.

The paper tackles optimal policy learning with asymmetric counterfactual utilities in healthcare decisions.

problem Learning optimal policies from observed data with asymmetric counterfactual utilities.
method The approach involves identifying and minimizing the maximum expected utility loss using statistical decision theory and solving intermediate classification problems.
result One can learn minimax loss decision rules from observed data.

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.

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.

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.