Ranking Models in Unlabeled New Environments

• URL: http://arxiv.org/abs/2108.10310v1
• Date: Mon, 23 Aug 2021 17:57:15 GMT
• Title: Ranking Models in Unlabeled New Environments
• Authors: Xiaoxiao Sun, Yunzhong Hou, Weijian Deng, Hongdong Li, Liang Zheng
• Abstract summary: We introduce the problem of ranking models in unlabeled new environments. We use a proxy dataset that 1) is fully labeled and 2) well reflects the true model rankings in a given target environment. Specifically, datasets that are more similar to the unlabeled target domain are found to better preserve the relative performance rankings.
• Score: 74.33770013525647
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Consider a scenario where we are supplied with a number of ready-to-use models trained on a certain source domain and hope to directly apply the most appropriate ones to different target domains based on the models' relative performance. Ideally we should annotate a validation set for model performance assessment on each new target environment, but such annotations are often very expensive. Under this circumstance, we introduce the problem of ranking models in unlabeled new environments. For this problem, we propose to adopt a proxy dataset that 1) is fully labeled and 2) well reflects the true model rankings in a given target environment, and use the performance rankings on the proxy sets as surrogates. We first select labeled datasets as the proxy. Specifically, datasets that are more similar to the unlabeled target domain are found to better preserve the relative performance rankings. Motivated by this, we further propose to search the proxy set by sampling images from various datasets that have similar distributions as the target. We analyze the problem and its solutions on the person re-identification (re-ID) task, for which sufficient datasets are publicly available, and show that a carefully constructed proxy set effectively captures relative performance ranking in new environments. Code is available at \url{https://github.com/sxzrt/Proxy-Set}.

Related papers

• RanLayNet: A Dataset for Document Layout Detection used for Domain Adaptation and Generalization [36.973388673687815]
  RanLayNet is a synthetic document dataset enriched with automatically assigned labels. We show that a deep layout identification model trained on our dataset exhibits enhanced performance compared to a model trained solely on actual documents.
  arXiv  Detail & Related papers  (2024-04-15T07:50:15Z)
• Robust Target Training for Multi-Source Domain Adaptation [110.77704026569499]
  We propose a novel Bi-level Optimization based Robust Target Training (BORT$2$) method for MSDA. Our proposed method achieves the state of the art performance on three MSDA benchmarks, including the large-scale DomainNet dataset.
  arXiv  Detail & Related papers  (2022-10-04T15:20:01Z)
• ProxyMix: Proxy-based Mixup Training with Label Refinery for Source-Free Domain Adaptation [73.14508297140652]
  Unsupervised domain adaptation (UDA) aims to transfer knowledge from a labeled source domain to an unlabeled target domain. We propose an effective method named Proxy-based Mixup training with label refinery ( ProxyMix) Experiments on three 2D image and one 3D point cloud object recognition benchmarks demonstrate that ProxyMix yields state-of-the-art performance for source-free UDA tasks.
  arXiv  Detail & Related papers  (2022-05-29T03:45:00Z)
• On Universal Black-Box Domain Adaptation [53.7611757926922]
  We study an arguably least restrictive setting of domain adaptation in a sense of practical deployment. Only the interface of source model is available to the target domain, and where the label-space relations between the two domains are allowed to be different and unknown. We propose to unify them into a self-training framework, regularized by consistency of predictions in local neighborhoods of target samples.
  arXiv  Detail & Related papers  (2021-04-10T02:21:09Z)
• Domain Impression: A Source Data Free Domain Adaptation Method [27.19677042654432]
  Unsupervised domain adaptation methods solve the adaptation problem for an unlabeled target set, assuming that the source dataset is available with all labels. This paper proposes a domain adaptation technique that does not need any source data. Instead of the source data, we are only provided with a classifier that is trained on the source data.
  arXiv  Detail & Related papers  (2021-02-17T19:50:49Z)
• Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies [65.92826041406802]
  We propose a Proxy-based deep Graph Metric Learning approach from the perspective of graph classification. Multiple global proxies are leveraged to collectively approximate the original data points for each class. We design a novel reverse label propagation algorithm, by which the neighbor relationships are adjusted according to ground-truth labels.
  arXiv  Detail & Related papers  (2020-10-26T14:52:42Z)
• Learning to Cluster under Domain Shift [20.00056591000625]
  In this work we address the problem of transferring knowledge from a source to a target domain when both source and target data have no annotations. Inspired by recent works on deep clustering, our approach leverages information from data gathered from multiple source domains. We show that our method is able to automatically discover relevant semantic information even in presence of few target samples.
  arXiv  Detail & Related papers  (2020-08-11T12:03:01Z)
• Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification [91.67977602992657]
  We propose a new strategy based on feature selection, which is both simpler and more effective than previous feature adaptation approaches. We show that a simple non-parametric classifier built on top of such features produces high accuracy and generalizes to domains never seen during training.
  arXiv  Detail & Related papers  (2020-03-20T15:44:17Z)
• Enlarging Discriminative Power by Adding an Extra Class in Unsupervised Domain Adaptation [5.377369521932011]
  We propose an idea of empowering the discriminativeness: Adding a new, artificial class and training the model on the data together with the GAN-generated samples of the new class. Our idea is highly generic so that it is compatible with many existing methods such as DANN, VADA, and DIRT-T.
  arXiv  Detail & Related papers  (2020-02-19T07:58:24Z)
• Low-Budget Label Query through Domain Alignment Enforcement [48.06803561387064]
  We tackle a new problem named low-budget label query. We first improve an Unsupervised Domain Adaptation (UDA) method to better align source and target domains. We then propose a simple yet effective selection method based on uniform sampling of the prediction consistency distribution.
  arXiv  Detail & Related papers  (2020-01-01T16:52:44Z)

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.