Learning $\mathbf{\mathit{Matching}}$ Representations for Individualized Organ Transplantation Allocation

• URL: http://arxiv.org/abs/2101.11769v1
• Date: Thu, 28 Jan 2021 01:33:21 GMT
• Title: Learning $\mathbf{\mathit{Matching}}$ Representations for Individualized Organ Transplantation Allocation
• Authors: Can Xu, Ahmed M. Alaa, Ioana Bica, Brent D. Ershoff, Maxime Cannesson, Mihaela van der Schaar
• Abstract summary: We formulate the problem of learning data-driven rules for organ matching using observational data for organ allocations and transplant outcomes. We propose a model based on representation learning to predict donor-recipient compatibility. Our model outperforms state-of-art allocation methods and policies executed by human experts.
• Score: 98.43063331640538
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Organ transplantation is often the last resort for treating end-stage illness, but the probability of a successful transplantation depends greatly on compatibility between donors and recipients. Current medical practice relies on coarse rules for donor-recipient matching, but is short of domain knowledge regarding the complex factors underlying organ compatibility. In this paper, we formulate the problem of learning data-driven rules for organ matching using observational data for organ allocations and transplant outcomes. This problem departs from the standard supervised learning setup in that it involves matching the two feature spaces (i.e., donors and recipients), and requires estimating transplant outcomes under counterfactual matches not observed in the data. To address these problems, we propose a model based on representation learning to predict donor-recipient compatibility; our model learns representations that cluster donor features, and applies donor-invariant transformations to recipient features to predict outcomes for a given donor-recipient feature instance. Experiments on semi-synthetic and real-world datasets show that our model outperforms state-of-art allocation methods and policies executed by human experts.

Related papers

• Predicting Long-Term Allograft Survival in Liver Transplant Recipients [11.680219281917076]
  Liver allograft failure occurs in approximately 20% of liver transplant recipients within five years post-transplant. We introduce the Model for Allograft Survival (MAS), a simple linear risk score that outperforms other advanced survival models.
  arXiv  Detail & Related papers  (2024-08-10T04:44:36Z)
• Spillover Detection for Donor Selection in Synthetic Control Models [1.1510009152620668]
  We introduce a theoretically-grounded donor selection procedure. We show how this Theorem can be turned into a practical method for detecting potential spillover effects.
  arXiv  Detail & Related papers  (2024-06-17T10:33:33Z)
• A Transformer-Based Deep Learning Approach for Fairly Predicting Post-Liver Transplant Risk Factors [19.00784227522497]
  Liver transplantation is a life-saving procedure for patients with end-stage liver disease. Current scoring system evaluates a patient's mortality risk if not receiving an organ within 90 days. Post-transplant risk factors, such as cardiovascular disease, chronic rejection, etc., are common complications after transplant.
  arXiv  Detail & Related papers  (2023-04-05T22:54:26Z)
• Multi-Task Learning for Post-transplant Cause of Death Analysis: A Case Study on Liver Transplant [65.85767739748901]
  Post-transplant cause of death provides powerful tool for clinical decision making. Traditional methods like Model for End-stage Liver Disease (MELD) score and conventional machine learning (ML) methods are limited in CoD analysis. We propose a novel framework called CoD-MTL leveraging multi-task learning to model the semantic relationships between various CoD prediction tasks jointly.
  arXiv  Detail & Related papers  (2023-03-30T01:31:49Z)
• Fairly Predicting Graft Failure in Liver Transplant for Organ Assigning [61.30094367351618]
  Liver transplant is an essential therapy performed for severe liver diseases. Machine learning models could be unfair and trigger bias against certain groups of people. This work proposes a fair machine learning framework targeting graft failure prediction in liver transplant.
  arXiv  Detail & Related papers  (2023-02-18T18:24:58Z)
• Deep Normed Embeddings for Patient Representation [0.1310865248866973]
  We introduce a novel contrastive representation learning objective and a training scheme for clinical time series. We show how the learned embedding can be used for online patient monitoring, supplement clinicians and improve performance of downstream machine learning tasks.
  arXiv  Detail & Related papers  (2022-04-12T02:02:01Z)
• Generalized Organ Segmentation by Imitating One-shot Reasoning using Anatomical Correlation [55.1248480381153]
  We propose OrganNet which learns a generalized organ concept from a set of annotated organ classes and then transfer this concept to unseen classes. We show that OrganNet can effectively resist the wide variations in organ morphology and produce state-of-the-art results in one-shot segmentation task.
  arXiv  Detail & Related papers  (2021-03-30T13:41:12Z)
• Improving Policy-Constrained Kidney Exchange via Pre-Screening [96.27605972266296]
  Barter exchanges are subject to many forms of uncertainty--in participant preferences, the feasibility and quality of various swaps, and so on. Our work is motivated by kidney exchange, a real-world barter market in which patients in need of a kidney transplant swap their willing living donors, in order to find a better match. Planned transplants often fail for a variety of reasons--if the donor organ is refused by the recipient's medical team. One US-based exchange estimated that about 85% of planned transplants failed in 2019.
  arXiv  Detail & Related papers  (2020-10-22T21:07:36Z)
• 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.