mlsanityData to 14 Oct 2026

Test-time Assessment of a Model's Performance on Unseen Domains via Optimal Transport

arXiv 2405.01451 ↗First posted 2 May 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Gauging the performance of ML models on data from unseen domains at test-time is essential yet a challenging problem due to the lack of labels in this setting. Moreover, the performance of these models on in-distribution data is a poor indicator of their performance on data from unseen domains. Thus, it is essential to develop metrics that can provide insights into the model's performance at test time and can be computed only with the information available at test time (such as their model parameters, the training data or its statistics, and the unlabeled test data). To this end, we propose a metric based on Optimal Transport that is highly correlated with the model's performance on unseen domains and is efficiently computable only using information available at test time. Concretely, our metric characterizes the model's performance on unseen domains using only a small amount of unlabeled data from these domains and data or statistics from the training (source) domain(s). Through extensive empirical evaluation using standard benchmark datasets, and their corruptions, we demonstrate the utility of our metric in estimating the model's performance in various practical applications. These include the problems of selecting the source data and architecture that leads to the best performance on data from an unseen domain and the problem of predicting a deployed model's performance at test time on unseen domains. Our empirical results show that our metric, which uses information from both the source and the unseen domain, is highly correlated with the model's performance, achieving a significantly better correlation than that obtained via the popular prediction entropy-based metric, which is computed solely using the data from the unseen domain.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 41 references that are in the map. First posted on arXiv 2 May 2024.

Builds on

27 of 41 references.

References · 27

  1. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  2. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  4. 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,082
  5. 2020In Search of Lost Domain Generalizationcited by 1,054
  6. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  7. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
  8. 2018Generalizing to Unseen Domains via Adversarial Data Augmentationcited by 451
  9. 2020Learning to Learn Single Domain Generalizationcited by 296
  10. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
  11. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
  12. 2020LEEP: A New Measure to Evaluate Transferability of Learned Representationscited by 188
15 more
  1. 2021LogME: Practical Assessment of Pre-trained Models for Transfer Learningcited by 172
  2. 2020Geometric Dataset Distances via Optimal Transportcited by 158
  3. 2019Transferability and Hardness of Supervised Classification Taskscited by 127
  4. 2019Generalizing to unseen domains via distribution matchingcited by 110
  5. 2018Benchmarking Neural Network Robustness to Common Corruptions and Surface Variationscited by 99
  6. 2019Support and Invertibility in Domain-Invariant Representationscited by 87
  7. 2022An Information-Theoretic Approach to Transferability in Task Transfer Learningcited by 81
  8. 2021Test-Time Adaptation to Distribution Shift by Confidence Maximization and Input Transformationcited by 68
  9. 2021OTCE: A Transferability Metric for Cross-Domain Cross-Task Representationscited by 62
  10. 2021Frustratingly Easy Transferability Estimationcited by 45
  11. 2021Quantifying and Improving Transferability in Domain Generalizationcited by 35
  12. 2021Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoningcited by 11
  13. 2023Understanding the Transferability of Representations via Task-Relatednesscited by 11
  14. 2022Domain Alignment Meets Fully Test-Time Adaptationcited by 4
  15. 2023On the Fly Neural Style Smoothing for Risk-Averse Domain Generalizationcited by 3

Built on by

Not cited yet.