ANFI: Rethinking Neighbor Feature Interaction in Person Re-ID

• URL: http://arxiv.org/abs/2607.25407v1
• Date: Tue, 28 Jul 2026 08:06:44 GMT
• Title: ANFI: Rethinking Neighbor Feature Interaction in Person Re-ID
• Abstract summary: We propose a novel Adaptive Neighbor Feature Interaction (ANFI) method for person re-identification.<n>ANFI accounts for negative effects from noisy neighbors, allowing samples to remain distinguishable from false positive neighbors.<n>In addition, we propose Noisy Relation Supervision (NRS) to train ANFI, gradually injecting robustness to noisy relations into the model.
• Score: 55.27872970486155
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In person re-identification, neighbor-based methods have achieved significant success by interacting with neighbor samples to obtain more robust representations. However, existing methods rely only on affinity relations, causing their success to depend heavily on the reliability of selected neighbors. We find that affinity-only interaction often fails in challenging scenarios due to the inevitable presence of noisy neighbors. To enable effective interactions under noisy neighborhoods, we revisit neighbor-based methods under distinct reliability conditions and propose a novel Adaptive Neighbor Feature Interaction (ANFI) method. The core idea of ANFI is to account for negative effects from noisy neighbors, allowing samples to remain distinguishable from false positive neighbors. Unlike existing methods, ANFI models not only affinity relations but also discrepancy relations, and employs sample-wise adaptive weighting for these two types of relations. Given that capturing negative effects from noisy neighbors differs significantly from traditional relation learning, we derive discrepancy relations from a new neighborhood similarity, which provides more information than pairwise similarity. In addition, we propose Noisy Relation Supervision (NRS) to train ANFI, gradually injecting robustness to noisy relations into the model. Extensive experiments conducted under standard, cross-modal, and cross-domain settings, including comparisons with neighbor-based methods and re-ranking methods, demonstrate the superiority of our method across various neighbor distributions.

Related papers

• Test-time Adaptive Hierarchical Co-enhanced Denoising Network for Reliable Multimodal Classification [55.56234913868664]
  We propose Test-time Adaptive Hierarchical Co-enhanced Denoising Network (TAHCD) for reliable learning on multimodal data.<n>The proposed method achieves superior classification performance, robustness, and generalization compared with state-of-the-art reliable multimodal learning approaches.
  arXiv  Detail & Related papers  (2026-01-12T03:14:12Z)
• Unleashing the Potential of Neighbors: Diffusion-based Latent Neighbor Generation for Session-based Recommendation [51.74332787641956]
  Session-based recommendation aims to predict the next item that anonymous users may be interested in, based on their current session interactions.<n>Recent studies have demonstrated that retrieving neighbor sessions to augment the current session can effectively alleviate the data sparsity issue.<n>We propose a novel model of diffusion-based latent neighbor generation for session-based recommendation, named DiffSBR.
  arXiv  Detail & Related papers  (2026-01-07T13:14:12Z)
• NeighborRetr: Balancing Hub Centrality in Cross-Modal Retrieval [15.409022911063241]
  NeighborRetr is a novel method that balances the learning of hubs and adaptively adjusts the relations of various kinds of neighbors.<n>We show that NeighborRetr achieves state-of-the-art results on multiple cross-modal retrieval benchmarks.
  arXiv  Detail & Related papers  (2025-03-13T16:33:55Z)
• Stable Neighbor Denoising for Source-free Domain Adaptive Segmentation [91.83820250747935]
  Pseudo-label noise is mainly contained in unstable samples in which predictions of most pixels undergo significant variations during self-training. We introduce the Stable Neighbor Denoising (SND) approach, which effectively discovers highly correlated stable and unstable samples. SND consistently outperforms state-of-the-art methods in various SFUDA semantic segmentation settings.
  arXiv  Detail & Related papers  (2024-06-10T21:44:52Z)
• Contextually Affinitive Neighborhood Refinery for Deep Clustering [13.48547883315848]
  We propose an efficient online re-ranking process to mine more informative neighbors in a Contextually Affinitive (ConAff) Neighborhood. Our method can be easily integrated into the generic self-supervised frameworks and outperforms the state-of-the-art methods on several popular benchmarks.
  arXiv  Detail & Related papers  (2023-12-12T23:56:51Z)
• MNN: Mixed Nearest-Neighbors for Self-Supervised Learning [10.327408694770709]
  Mixed Nearest-Neighbors for Self-Supervised Learning (MNN) We present a simple self-supervised learning framework called Mixed Nearest-Neighbors for Self-Supervised Learning (MNN)
  arXiv  Detail & Related papers  (2023-11-01T14:59:41Z)
• pNNCLR: Stochastic Pseudo Neighborhoods for Contrastive Learning based Unsupervised Representation Learning Problems [7.967118716309239]
  Nearest neighbor (NN) sampling provides more semantic variations than pre-defined transformations for self-supervised learning (SSL) based image recognition problems. We show that the quality of the support set plays a crucial role in any nearest neighbor based method for SSL. We introduce pseudo nearest neighbors (pNN) to control the quality of the support set and employ a sampling strategy to improve the performance.
  arXiv  Detail & Related papers  (2023-08-14T07:35:43Z)
• Analyzing and Mitigating Interference in Neural Architecture Search [96.60805562853153]
  We investigate the interference issue by sampling different child models and calculating the gradient similarity of shared operators. Inspired by these two observations, we propose two approaches to mitigate the interference. Our searched architecture outperforms RoBERTa$_rm base$ by 1.1 and 0.6 scores and ELECTRA$_rm base$ by 1.6 and 1.1 scores on the dev and test set of GLUE benchmark.
  arXiv  Detail & Related papers  (2021-08-29T11:07:46Z)
• Deep Interactive Bayesian Reinforcement Learning via Meta-Learning [63.96201773395921]
  The optimal adaptive behaviour under uncertainty over the other agents' strategies can be computed using the Interactive Bayesian Reinforcement Learning framework. We propose to meta-learn approximate belief inference and Bayes-optimal behaviour for a given prior. We show empirically that our approach outperforms existing methods that use a model-free approach, sample from the approximate posterior, maintain memory-free models of others, or do not fully utilise the known structure of the environment.
  arXiv  Detail & Related papers  (2021-01-11T13:25:13Z)
• A Unified Model for Recommendation with Selective Neighborhood Modeling [9.367539466637664]
  We propose a novel neighborhood-based recommender, where a hybrid gated network is designed to automatically separate similar neighbors from dissimilar (noisy) ones. We show that the proposed model consistently outperforms state-of-the-art neighborhood-based recommenders.
  arXiv  Detail & Related papers  (2020-10-19T08:06:16Z)

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.