Benchmarking Domain Generalization Algorithms in Computational Pathology

• URL: http://arxiv.org/abs/2409.17063v1
• Date: Wed, 25 Sep 2024 16:21:43 GMT
• Title: Benchmarking Domain Generalization Algorithms in Computational Pathology
• Abstract summary: This study aims to benchmark the effectiveness of 30 DG algorithms on 3 CPath tasks of varying difficulty through 7,560 cross-validation runs. We evaluate these algorithms using a unified and robust platform, incorporating modality-specific techniques and recent advances like pretrained foundation models. We observe that self-supervised learning and stain augmentation consistently outperform other methods, highlighting the potential of pretrained models and data augmentation.
• Score: 1.0401006444780359
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Deep learning models have shown immense promise in computational pathology (CPath) tasks, but their performance often suffers when applied to unseen data due to domain shifts. Addressing this requires domain generalization (DG) algorithms. However, a systematic evaluation of DG algorithms in the CPath context is lacking. This study aims to benchmark the effectiveness of 30 DG algorithms on 3 CPath tasks of varying difficulty through 7,560 cross-validation runs. We evaluate these algorithms using a unified and robust platform, incorporating modality-specific techniques and recent advances like pretrained foundation models. Our extensive cross-validation experiments provide insights into the relative performance of various DG strategies. We observe that self-supervised learning and stain augmentation consistently outperform other methods, highlighting the potential of pretrained models and data augmentation. Furthermore, we introduce a new pan-cancer tumor detection dataset (HISTOPANTUM) as a benchmark for future research. This study offers valuable guidance to researchers in selecting appropriate DG approaches for CPath tasks.

Related papers

• Closing the Train-Test Gap in World Models for Gradient-Based Planning [64.36544881136405]
  We propose improved methods for training world models that enable efficient gradient-based planning.<n>At test time, our approach outperforms or matches the classical gradient-free cross-entropy method.
  arXiv  Detail & Related papers  (2025-12-10T18:59:45Z)
• Empirical Analysis of Nature-Inspired Algorithms for Autism Spectrum Disorder Detection Using 3D Video Dataset [5.5711773076846365]
  Autism Spectrum Disorder (ASD) is a chronic neurodevelopmental disorder symptoms of which includes repetitive behaviour and lack of social and communication skills. In this paper, we worked on a methodology for the detection of ASD from a 3-dimensional walking video dataset. We deployed various combinationsalgorithms of classification algorithm and nature-inspired algorithms resulting in an outstanding classification accuracy of $100%$.
  arXiv  Detail & Related papers  (2025-01-02T11:24:06Z)
• Deep Graph Anomaly Detection: A Survey and New Perspectives [86.84201183954016]
  Graph anomaly detection (GAD) aims to identify unusual graph instances (nodes, edges, subgraphs, or graphs) Deep learning approaches, graph neural networks (GNNs) in particular, have been emerging as a promising paradigm for GAD.
  arXiv  Detail & Related papers  (2024-09-16T03:05:11Z)
• Domain Generalization in Computational Pathology: Survey and Guidelines [2.790591243289254]
  Out-of-distribution data can cause emphdomain shift (DS) DS decreases the generalization of trained models to unseen datasets with slightly different data distributions. We conduct thorough benchmarking experiments with 28 cutting-edge DG algorithms to address a complex DG problem.
  arXiv  Detail & Related papers  (2023-10-30T15:39:19Z)
• Unsupervised Pre-Training Using Masked Autoencoders for ECG Analysis [4.3312979375047025]
  This paper proposes an unsupervised pre-training technique based on masked autoencoder (MAE) for electrocardiogram (ECG) signals. In addition, we propose a task-specific fine-tuning to form a complete framework for ECG analysis. The framework is high-level, universal, and not individually adapted to specific model architectures or tasks.
  arXiv  Detail & Related papers  (2023-10-17T11:19:51Z)
• NormAUG: Normalization-guided Augmentation for Domain Generalization [60.159546669021346]
  We propose a simple yet effective method called NormAUG (Normalization-guided Augmentation) for deep learning. Our method introduces diverse information at the feature level and improves the generalization of the main path. In the test stage, we leverage an ensemble strategy to combine the predictions from the auxiliary path of our model, further boosting performance.
  arXiv  Detail & Related papers  (2023-07-25T13:35:45Z)
• On Certifying and Improving Generalization to Unseen Domains [87.00662852876177]
  Domain Generalization aims to learn models whose performance remains high on unseen domains encountered at test-time. It is challenging to evaluate DG algorithms comprehensively using a few benchmark datasets. We propose a universal certification framework that can efficiently certify the worst-case performance of any DG method.
  arXiv  Detail & Related papers  (2022-06-24T16:29:43Z)
• Benchmarking Node Outlier Detection on Graphs [90.29966986023403]
  Graph outlier detection is an emerging but crucial machine learning task with numerous applications. We present the first comprehensive unsupervised node outlier detection benchmark for graphs called UNOD.
  arXiv  Detail & Related papers  (2022-06-21T01:46:38Z)
• Reappraising Domain Generalization in Neural Networks [8.06370138649329]
  Domain generalization (DG) of machine learning algorithms is defined as their ability to learn a domain agnostic hypothesis from multiple training distributions. We find that a straightforward Empirical Risk Minimization (ERM) baseline consistently outperforms existing DG methods. We propose a classwise-DG formulation, where for each class, we randomly select one of the domains and keep it aside for testing.
  arXiv  Detail & Related papers  (2021-10-15T10:06:40Z)
• Domain Generalization: A Survey [146.68420112164577]
  Domain generalization (DG) aims to achieve OOD generalization by only using source domain data for model learning. For the first time, a comprehensive literature review is provided to summarize the ten-year development in DG.
  arXiv  Detail & Related papers  (2021-03-03T16:12:22Z)
• Model-Based Domain Generalization [96.84818110323518]
  We propose a novel approach for the domain generalization problem called Model-Based Domain Generalization. Our algorithms beat the current state-of-the-art methods on the very-recently-proposed WILDS benchmark by up to 20 percentage points.
  arXiv  Detail & Related papers  (2021-02-23T00:59:02Z)
• Deep Learning for ECG Analysis: Benchmarks and Insights from PTB-XL [15.552721021992847]
  We put forward first benchmarking results for the recently published, freely accessible PTB-XL dataset. We find that convolutional neural networks, in particular resnet- and inception-based architectures, show the strongest performance across all tasks. Results are complemented by deeper insights into the classification algorithm in terms of hidden stratification, model uncertainty and an exploratory interpretability analysis.
  arXiv  Detail & Related papers  (2020-04-28T17:55:17Z)

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.