Treatment Effect Estimation for Graph-Structured Targets

• URL: http://arxiv.org/abs/2412.20436v1
• Date: Sun, 29 Dec 2024 11:21:17 GMT
• Title: Treatment Effect Estimation for Graph-Structured Targets
• Authors: Shonosuke Harada, Ryosuke Yoneda, Hisashi Kashima,
• Abstract summary: Graph-target Treatment Effect Estimation (GraphTEE) is a framework designed to estimate treatment effects specifically on graph-structured targets. We provide a theoretical analysis on how GraphTEE performs better in terms of bias mitigation.
• Score: 19.994206291423666
• License:
• Abstract: Treatment effect estimation, which helps understand the causality between treatment and outcome variable, is a central task in decision-making across various domains. While most studies focus on treatment effect estimation on individual targets, in specific contexts, there is a necessity to comprehend the treatment effect on a group of targets, especially those that have relationships represented as a graph structure between them. In such cases, the focus of treatment assignment is prone to depend on a particular node of the graph, such as the one with the highest degree, thus resulting in an observational bias from a small part of the entire graph. Whereas a bias tends to be caused by the small part, straightforward extensions of previous studies cannot provide efficient bias mitigation owing to the use of the entire graph information. In this study, we propose Graph-target Treatment Effect Estimation (GraphTEE), a framework designed to estimate treatment effects specifically on graph-structured targets. GraphTEE aims to mitigate observational bias by focusing on confounding variable sets and consider a new regularization framework. Additionally, we provide a theoretical analysis on how GraphTEE performs better in terms of bias mitigation. Experiments on synthetic and semi-synthetic datasets demonstrate the effectiveness of our proposed method.

Related papers

• Generative Risk Minimization for Out-of-Distribution Generalization on Graphs [71.48583448654522]
  We propose an innovative framework, named Generative Risk Minimization (GRM), designed to generate an invariant subgraph for each input graph to be classified, instead of extraction. We conduct extensive experiments across a variety of real-world graph datasets for both node-level and graph-level OOD generalization.
  arXiv  Detail & Related papers  (2025-02-11T21:24:13Z)
• Graph-level Protein Representation Learning by Structure Knowledge Refinement [50.775264276189695]
  This paper focuses on learning representation on the whole graph level in an unsupervised manner. We propose a novel framework called Structure Knowledge Refinement (SKR) which uses data structure to determine the probability of whether a pair is positive or negative.
  arXiv  Detail & Related papers  (2024-01-05T09:05:33Z)
• Fine-grained Graph Rationalization [51.293401030058085]
  We propose fine-grained graph rationalization (FIG) for graph machine learning. Our idea is driven by the self-attention mechanism, which provides rich interactions between input nodes. Our experiments involve 7 real-world datasets, and the proposed FIG shows significant performance advantages compared to 13 baseline methods.
  arXiv  Detail & Related papers  (2023-12-13T02:56:26Z)
• GraphCloak: Safeguarding Task-specific Knowledge within Graph-structured Data from Unauthorized Exploitation [61.80017550099027]
  Graph Neural Networks (GNNs) are increasingly prevalent in a variety of fields. Growing concerns have emerged regarding the unauthorized utilization of personal data. Recent studies have shown that imperceptible poisoning attacks are an effective method of protecting image data from such misuse. This paper introduces GraphCloak to safeguard against the unauthorized usage of graph data.
  arXiv  Detail & Related papers  (2023-10-11T00:50:55Z)
• Logical Bias Learning for Object Relation Prediction [3.724255294816294]
  Scene graph generation (SGG) aims to automatically map an image into a semantic structural graph for better scene understanding. It faces severe limitations in practice due to the biased data and training method. We present a more rational and effective strategy based on causal inference for object relation prediction.
  arXiv  Detail & Related papers  (2023-10-01T16:12:00Z)
• Front-door Adjustment Beyond Markov Equivalence with Limited Graph Knowledge [36.210656212459554]
  We provide testable conditional independence statements to compute the causal effect using front-door-like adjustment. We show that our method is applicable in scenarios where knowing the Markov equivalence class is not sufficient for causal effect estimation.
  arXiv  Detail & Related papers  (2023-06-19T15:16:56Z)
• Graph Structure and Feature Extrapolation for Out-of-Distribution Generalization [54.64375566326931]
  Out-of-distribution (OOD) generalization deals with the prevalent learning scenario where test distribution shifts from training distribution. We propose to achieve graph OOD generalization with the novel design of non-Euclidean-space linear extrapolation. Our design tailors OOD samples for specific shifts without corrupting underlying causal mechanisms.
  arXiv  Detail & Related papers  (2023-06-13T18:46:28Z)
• Covariate-Balancing-Aware Interpretable Deep Learning models for Treatment Effect Estimation [15.465045049754336]
  We propose an upper bound for the bias of average treatment estimation under the strong ignorability assumption. We implement this upper bound as an objective function being minimized by leveraging a novel additive neural network architecture. The proposed method is illustrated by re-examining the benchmark datasets for causal inference, and it outperforms the state-of-art.
  arXiv  Detail & Related papers  (2022-03-07T07:42:40Z)
• Graph Intervention Networks for Causal Effect Estimation [30.516184324213874]
  We address the estimation of conditional average treatment effects (CATEs) when treatments are graph-structured. We propose a plug-in estimator that decomposes CATE estimation into separate, simpler optimization problems.
  arXiv  Detail & Related papers  (2021-06-03T15:41:00Z)
• GraphITE: Estimating Individual Effects of Graph-structured Treatments [21.285425135761795]
  In some applications, the number of treatments can be significantly large. In this study, we consider the outcome estimation problem of graph-structured treatments such as drugs. Our proposed method, GraphITE, learns the representations of graph-structured treatments using graph neural networks.
  arXiv  Detail & Related papers  (2020-09-29T14:49:30Z)
• Generalization Bounds and Representation Learning for Estimation of Potential Outcomes and Causal Effects [61.03579766573421]
  We study estimation of individual-level causal effects, such as a single patient's response to alternative medication. We devise representation learning algorithms that minimize our bound, by regularizing the representation's induced treatment group distance. We extend these algorithms to simultaneously learn a weighted representation to further reduce treatment group distances.
  arXiv  Detail & Related papers  (2020-01-21T10:16:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.