Privacy-Preserving Model Upgrades with Bidirectional Compatible Training in Image Retrieval

• URL: http://arxiv.org/abs/2204.13919v1
• Date: Fri, 29 Apr 2022 07:38:09 GMT
• Title: Privacy-Preserving Model Upgrades with Bidirectional Compatible Training in Image Retrieval
• Authors: Shupeng Su, Binjie Zhang, Yixiao Ge, Xuyuan Xu, Yexin Wang, Chun Yuan, Ying Shan
• Abstract summary: We propose a new model upgrade paradigm, termed Bidirectional Compatible Training (BiCT) BiCT upgrades the old gallery embeddings by forward-compatible training towards the embedding space of the backward-compatible new model. We conduct comprehensive experiments to verify the prominent improvement by BiCT and observe that the inconspicuous loss weight of backward compatibility actually plays an essential role for both backward and forward retrieval performance.
• Score: 28.268764435617975
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The task of privacy-preserving model upgrades in image retrieval desires to reap the benefits of rapidly evolving new models without accessing the raw gallery images. A pioneering work introduced backward-compatible training, where the new model can be directly deployed in a backfill-free manner, i.e., the new query can be directly compared to the old gallery features. Despite a possible solution, its improvement in sequential model upgrades is gradually limited by the fixed and under-quality old gallery embeddings. To this end, we propose a new model upgrade paradigm, termed Bidirectional Compatible Training (BiCT), which will upgrade the old gallery embeddings by forward-compatible training towards the embedding space of the backward-compatible new model. We conduct comprehensive experiments to verify the prominent improvement by BiCT and interestingly observe that the inconspicuous loss weight of backward compatibility actually plays an essential role for both backward and forward retrieval performance. To summarize, we introduce a new and valuable problem named privacy-preserving model upgrades, with a proper solution BiCT. Several intriguing insights are further proposed to get the most out of our method.

Related papers

• Backward-Compatible Aligned Representations via an Orthogonal Transformation Layer [20.96380700548786]
  Visual retrieval systems face challenges when updating models with improved representations due to misalignment between the old and new representations. Prior research has explored backward-compatible training methods that enable direct comparisons between new and old representations without backfilling. In this paper, we address achieving a balance between backward compatibility and the performance of independently trained models.
  arXiv  Detail & Related papers  (2024-08-16T15:05:28Z)
• MixBCT: Towards Self-Adapting Backward-Compatible Training [66.52766344751635]
  We propose MixBCT, a simple yet highly effective backward-compatible training method. We conduct experiments on the large-scale face recognition datasets MS1Mv3 and IJB-C.
  arXiv  Detail & Related papers  (2023-08-14T05:55:38Z)
• Boundary-aware Backward-Compatible Representation via Adversarial Learning in Image Retrieval [17.995993499100017]
  Backward-compatible training (BCT) improves the compatibility of two models with less negative impact on retrieval performance. We introduce AdvBCT, an Adversarial Backward-Training method with an elastic boundary constraint. Our method outperforms other BCT methods on both compatibility and discrimination.
  arXiv  Detail & Related papers  (2023-05-04T07:37:07Z)
• Online Backfilling with No Regret for Large-Scale Image Retrieval [50.162438586686356]
  Backfilling is the process of re-extracting all gallery embeddings from upgraded models in image retrieval systems. We propose an online backfilling algorithm, which enables us to achieve a progressive performance improvement during the backfilling process. We incorporate a reverse transformation module for more effective and efficient merging, which is further enhanced by adopting a metric-compatible contrastive learning approach.
  arXiv  Detail & Related papers  (2023-01-10T03:10:32Z)
• $BT^2$: Backward-compatible Training with Basis Transformation [107.37014712361788]
  Retrieval system often requires recomputing the representation of every piece of data in the gallery when updating to a better representation model. This process is known as backfilling and can be especially costly in the real world where the gallery often contains billions of samples. Recently, researchers have proposed the idea of Backward compatible Training (BCT) where the new representation model can be trained with an auxiliary loss to make it backward compatible with the old representation.
  arXiv  Detail & Related papers  (2022-11-08T04:00:23Z)
• Darwinian Model Upgrades: Model Evolving with Selective Compatibility [29.920204547961696]
  BCT presents the first step towards backward-compatible model upgrades to get rid of backfilling. We propose Darwinian Model Upgrades (DMU) which disentangle the inheritance and variation in the model evolving with selective backward compatibility and forward adaptation. DMU effectively alleviates the new-to-new degradation and improves new-to-old compatibility, rendering a more proper model upgrading paradigm in large-scale retrieval systems.
  arXiv  Detail & Related papers  (2022-10-13T12:28:48Z)
• Towards Universal Backward-Compatible Representation Learning [29.77801805854168]
  backward-compatible representation learning is introduced to support backfill-free model upgrades. We first introduce a new problem of universal backward-compatible representation learning, covering all possible data split in model upgrades. We propose a simple yet effective method, dubbed Universal Backward- Training (UniBCT) with a novel structural prototype refinement algorithm.
  arXiv  Detail & Related papers  (2022-03-03T09:23:51Z)
• Hot-Refresh Model Upgrades with Regression-Alleviating Compatible Training in Image Retrieval [34.84329831602699]
  cold-refresh model upgrades can only deploy new models after the gallery is overall backfilled, taking weeks or even months for massive data. In contrast, hot-refresh model upgrades deploy the new model immediately and then gradually improve the retrieval accuracy by backfilling the gallery on-the-fly.
  arXiv  Detail & Related papers  (2022-01-24T14:59:12Z)
• Forward Compatible Training for Representation Learning [53.300192863727226]
  backward compatible training (BCT) modifies training of the new model to make its representations compatible with those of the old model. BCT can significantly hinder the performance of the new model. In this work, we propose a new learning paradigm for representation learning: forward compatible training (FCT)
  arXiv  Detail & Related papers  (2021-12-06T06:18:54Z)
• Neighborhood Consensus Contrastive Learning for Backward-Compatible Representation [46.86784621137665]
  backward-compatible representation is proposed to enable the "new" features compatible with "old"' features. We propose a Neighborhood Consensus Contrastive Learning (NCCL) method, which learns backward-compatible representation from a neighborhood consensus perspective. Our method ensures backward compatibility without impairing the accuracy of the new model.
  arXiv  Detail & Related papers  (2021-08-07T05:50:47Z)
• Towards Backward-Compatible Representation Learning [86.39292571306395]
  We propose a way to learn visual features that are compatible with previously computed ones even when they have different dimensions. This enables visual search systems to bypass computing new features for all previously seen images when updating the embedding models. We propose a framework to train embedding models, called backward-compatible training (BCT), as a first step towards backward compatible representation learning.
  arXiv  Detail & Related papers  (2020-03-26T14:34:09Z)

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.