paper-with-me

Papers

Class Interference Regularization

2020-09-04 · Bharti Munjal, Sikandar Amin, Fabio Galasso

Contrastive losses yield state-of-the-art performance for person re-identification, face verification and few shot learning. They have recently outperformed the cross-entropy loss on classification at the ImageNet scale and outperformed all self-supervision prior results by a large margin (SimCLR). Simple and effective regularization techniques such as label smoothing and self-distillation do not apply anymore, because they act on multinomial label distributions, adopted in cross-entropy losses, and not on tuple comparative terms, which characterize the contrastive losses. Here we propose a novel, simple and effective regularization technique, the Class Interference Regularization (CIR), which applies to cross-entropy losses but is especially effective on contrastive losses. CIR perturbs the output features by randomly moving them towards the average embeddings of the negative classes. To the best of our knowledge, CIR is the first regularization technique to act on the output features. In experimental evaluation, the combination of CIR and a plain Siamese-net with triplet loss yields best few-shot learning performance on the challenging tieredImageNet. CIR also improves the state-of-the-art technique in person re-identification on the Market-1501 dataset, based on triplet loss, and the state-of-the-art technique in person search on the CUHK-SYSU dataset, based on a cross-entropy loss. Finally, on the task of classification CIR performs on par with the popular label smoothing, as demonstrated for CIFAR-10 and -100.

📄 PDF Abstract BibTeX arXiv:2009.02396

Code (0)

등록된 구현이 없습니다.

Tasks

Face VerificationFew-Shot LearningPerson Re-IdentificationPerson SearchTriplet

Methods 이 논문이 사용한 방법론

Triplet Loss The goal of Triplet loss, in the context of Siamese Networks, is to maximize the joint probability among all score-pairs i.e. the product of all probabilities. By using its…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…

Similar Papers 제목 키워드 기반

Revisiting Weight Regularization for Low-Rank Continual Learning

2026-02-19 · Yaoyue Zheng, Yin Zhang, Joost van de Weijer, Gido M van de Ven 외 arxiv

Continual Learning (CL) with large-scale pre-trained models (PTMs) has recently gained wide attention, shifting the focus from training from scratch to continually adapting PTMs. This has given rise to a promising paradi…

Continual Learning

Iterative Network Pruning with Uncertainty Regularization for Lifelong Sentiment Classification

2021-06-21 · Binzong Geng, Min Yang, Fajie Yuan, Shupeng Wang 외

Lifelong learning capabilities are crucial for sentiment classifiers to process continuous streams of opinioned information on the Web. However, performing lifelong learning is non-trivial for deep neural networks as con…

Lifelong learningNetwork PruningSentiment AnalysisSentiment Classification

Externally Validated Multi-Task Learning via Consistency Regularization Using Differentiable BI-RADS Features for Breast Ultrasound Tumor Segmentation

2025-11-20 · Jingru Zhang, Saed Moradi, Ashirbani Saha arxiv

Multi-task learning can suffer from destructive task interference, where jointly trained models underperform single-task baselines and limit generalization. To improve generalization performance in breast ultrasound-base…

Multi-Task LearningTumor Segmentation

Catastrophic Interference in Reinforcement Learning: A Solution Based on Context Division and Knowledge Distillation

2021-09-01 · Tiantian Zhang, Xueqian Wang, Bin Liang, Bo Yuan

The powerful learning ability of deep neural networks enables reinforcement learning agents to learn competent control policies directly from continuous environments. In theory, to achieve stable performance, neural netw…

Deep Reinforcement LearningGeneral Reinforcement LearningKnowledge DistillationOnline Clustering+5

Continual Learning in Low-rank Orthogonal Subspaces

2020-10-22 · NeurIPS 2020 12 · Arslan Chaudhry, Naeemullah Khan, Puneet K. Dokania, Philip H. S. Torr

In continual learning (CL), a learner is faced with a sequence of tasks, arriving one after the other, and the goal is to remember all the tasks once the continual learning experience is finished. The prior art in CL use…

Continual Learning