English

Probabilistic Test-Time Generalization by Variational Neighbor-Labeling

Machine Learning 2024-07-02 v3 Artificial Intelligence

Abstract

This paper strives for domain generalization, where models are trained exclusively on source domains before being deployed on unseen target domains. We follow the strict separation of source training and target testing, but exploit the value of the unlabeled target data itself during inference. We make three contributions. First, we propose probabilistic pseudo-labeling of target samples to generalize the source-trained model to the target domain at test time. We formulate the generalization at test time as a variational inference problem, by modeling pseudo labels as distributions, to consider the uncertainty during generalization and alleviate the misleading signal of inaccurate pseudo labels. Second, we learn variational neighbor labels that incorporate the information of neighboring target samples to generate more robust pseudo labels. Third, to learn the ability to incorporate more representative target information and generate more precise and robust variational neighbor labels, we introduce a meta-generalization stage during training to simulate the generalization procedure. Experiments on seven widely-used datasets demonstrate the benefits, abilities, and effectiveness of our proposal.

Keywords

Cite

@article{arxiv.2307.04033,
  title  = {Probabilistic Test-Time Generalization by Variational Neighbor-Labeling},
  author = {Sameer Ambekar and Zehao Xiao and Jiayi Shen and Xiantong Zhen and Cees G. M. Snoek},
  journal= {arXiv preprint arXiv:2307.04033},
  year   = {2024}
}

Comments

Accepted by CoLLAs 2024

R2 v1 2026-06-28T11:25:12.204Z