Domain adaptation using optimal transport for invariant learning using histopathology datasets
Not on the map. Why?
Abstract (arXiv)
Histopathology is critical for the diagnosis of many diseases, including cancer. These protocols typically require pathologists to manually evaluate slides under a microscope, which is time-consuming and subjective, leading to interest in machine learning to automate analysis. However, computational techniques are limited by batch effects, where technical factors like differences in preparation protocol or scanners can alter the appearance of slides, causing models trained on one institution to fail when generalizing to others. Here, we propose a domain adaptation method that improves the generalization of histopathological models to data from unseen institutions, without the need for labels or retraining in these new settings. Our approach introduces an optimal transport (OT) loss, that extends adversarial methods that penalize models if images from different institutions can be distinguished in their representation space. Unlike previous methods, which operate on single samples, our loss accounts for distributional differences between batches of images. We show that on the Camelyon17 dataset, while both methods can adapt to global differences in color distribution, only our OT loss can reliably classify a cancer phenotype unseen during training. Together, our results suggest that OT improves generalization on rare but critical phenotypes that may only make up a small fraction of the total tiles and variation in a slide.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 34 references that are in the map. First posted on arXiv 3 Mar 2023.
Builds on
14 of 34 references.
References · 14
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2019Invariant Risk Minimizationcited by 1,832
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2022Contrastive Test-Time Adaptationcited by 258
- 2018Gromov-Wasserstein Alignment of Word Embedding Spacescited by 119
- 2021Model-Based Domain Generalizationcited by 103
- 2018StainGAN: Stain Style Transfer for Digital Histological Imagescited by 68
- 2022How to Fine-Tune Vision Models with SGDcited by 23
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2024Morphological Prototyping for Unsupervised Slide Representation Learning in Computational Pathologycited by 70
- 2024Generative Modelling of Structurally Constrained Graphscited by 17
- 2025HASD: Hierarchical Adaption for pathology Slide-level Domain-shiftcited by 6
- 2025Optimal Transport with Heterogeneously Missing Datacited by 0
- 2025HASD: Hierarchical Adaption for pathology Slide-level Domain-shift30 Jun 2025
- 2025Optimal Transport with Heterogeneously Missing Data22 May 2025
- 2024Generative Modelling of Structurally Constrained Graphs25 Jun 2024
- 2024Morphological Prototyping for Unsupervised Slide Representation Learning in Computational Pathology19 May 2024