DenoiseRep: Denoising Model for Representation Learning

The denoising model has been proven a powerful generative model but has little exploration of discriminative tasks. Representation learning is important in discriminative tasks, which is defined as"learning representations (or features) of the data that make it easier to extract useful information when building classifiers or other predictors". In this paper, we propose a novel Denoising Model for Representation Learning (DenoiseRep) to improve feature discrimination with joint feature extraction and denoising. DenoiseRep views each embedding layer in a backbone as a denoising layer, processing the cascaded embedding layers as if we are recursively denoise features step-by-step. This unifies the frameworks of feature extraction and denoising, where the former progressively embeds features from low-level to high-level, and the latter recursively denoises features step-by-step. After that, DenoiseRep fuses the parameters of feature extraction and denoising layers, and theoretically demonstrates its equivalence before and after the fusion, thus making feature denoising computation-free. DenoiseRep is a label-free algorithm that incrementally improves features but also complementary to the label if available. Experimental results on various discriminative vision tasks, including re-identification (Market-1501, DukeMTMC-reID, MSMT17, CUHK-03, vehicleID), image classification (ImageNet, UB200, Oxford-Pet, Flowers), object detection (COCO), image segmentation (ADE20K) show stability and impressive improvements. We also validate its effectiveness on the CNN (ResNet) and Transformer (ViT, Swin, Vmamda) architectures.

Paper

Similar papers

Peer review

Reviewer Ckqo8/10 · confidence 5/52024-07-08

Summary

This paper proposes DenoiseReID to improve feature discriminative with joint feature extraction and denoising, in which FEFDFA is developed to merge parameters of the denoising layers into embedding layers. Experimental results show the proposed DenoiseReID improves performance.

Strengths

1. The proposed joint representation learning and denoising process. 2. The proposed FEFDFA is a computation-efficient algorithm.

Weaknesses

The author solves all my quentions.

Questions

N/A

Rating

8

Confidence

5

Soundness

4

Presentation

4

Contribution

4

Limitations

Yes

Reviewer Ckqo2024-08-12

The authors slove all my quentions. Overall, the motivation of this paper is clear, the idea is novel, the proposed is simple yet effective, and the writting is satifactory.

Authorsrebuttal2024-08-12

Responses by Authors

We thank the reviewer kind comment. We will keep improving the proposed method and apply it to more downstream tasks in future.

Reviewer DSeM8/10 · confidence 5/52024-07-09

Summary

This mauscript proposes a novel denosing model for representaetion learning and take person re-identification as a benchmark. It unifies the frameworks of feature extraction and feature denoising, where the former progressively embeds features from lowlevel to high-level, and the latter recursively denoises features step-by-step. Besides, a FEFDA is proposed to fuse feature extraction and denoising in a single backbone without changing its structure and taking extra runtime latency. Experiments on ReID, large-scale and fine-grained classification tasks show its effectivenss.

Strengths

1. The idea of unifying feature extraction and feature denoising in a single backbone without changing its structure is interesting. As far as I know, its first time to see the idea. 2. The characteristic computation-free and label-free is promising. The thoerical analysis seems precies and right. 3. Experiments on 3 typical tasks and 9 datasets of representation learning (retrieval, classfication, fine-grained classification) are sufficient and extensive.

Weaknesses

1. the proposed "Feature Extraction and Feature Denoising Fusion Algorithm" is little similar to reparameterization, please clarify their difference. 2. its application to transformer series are well analyzed, it will be better if peformance on CNN series are shown. 3. representation learning is a wide and fundational conception, its applications on more downstream tasks, such as detection, segmentation even generation, could be analyzed, in future. 4. The hyper-parameter analysis is missed. 5. This method seems need extra training steps, what if the baseline methods are trained under the same steps?

Questions

For questions, please see the weakness in the above section.

Rating

8

Confidence

5

Soundness

3

Presentation

3

Contribution

3

Limitations

The authors have discussed the limitations of the proposed method.

Reviewer 4MBF6/10 · confidence 5/52024-07-11

Summary

This paper proposes a new method, Feature Extraction and Feature Denoising Fusion Algorithm (FEFDFA), which utilizes the denoising ability of diffusion models to denoise the features in the feature extraction layer, and fuses the parameters of the denoising layer with those of the feature extraction layer through parameter fusion, further improving retrieval accuracy without incurring additional computational costs. The effectiveness of the FEFDFA method has been validated on multiple common image discrimination task datasets.

Strengths

1.The article structure is complete and writing is generally clear. 2.Some experimental results seem to good.

Weaknesses

1.In fact, the intermediate layer features of the pre-trained diffusion model can be used directly for the downstream task such as the discrimination task [1][2][3]. The authors need to enrich the Related Work. 2.Line144-146, no evidence provided to support the proposed hypothesis. 3.The authors treat the backbone as a series of denoising layers, so the training loss in Eq. (11) should be the sum of the MSE losses of each denoising layer. 4.The statement is inconsistent. Line172-173,"we freeze the original parameters and only trained the FEFDFA." Line509-511,"the parameters of the FEFDFA and baseline were trained alternately." In addition, unless the baseline and FEFDFA are trained together, Eq. (12) is incorrect. [1] Mukhopadhyay, Soumik, et al. "Diffusion models beat gans on image classification." arXiv preprint arXiv:2307.08702 (2023). [2] Li, Alexander C., et al. "Your diffusion model is secretly a zero-shot classifier." ICCV 2023. [3] Baranchuk, Dmitry, et al. "Label-Efficient Semantic Segmentation with Diffusion Models." ICLR 2022.

Questions

same to the weaknesses.

Rating

6

Confidence

5

Soundness

2

Presentation

3

Contribution

2

Limitations

The authors have addressed the limitations.

Reviewer w7Th8/10 · confidence 4/52024-07-12

Summary

This paper proposes a novel denoising model called DenoiseReID, designed to enhance representation learning in person re-identification (ReID) tasks. This approach combines traditional denoising processes with feature extraction through a feature extraction and denoising fusion algorithm (FEFDFA) that incurs no additional computational cost. It incrementally improves the discriminability of features without the need for labels.

Strengths

The experimental results demonstrate that DenoiseReID achieves stable performance improvements across multiple ReID datasets. Furthermore, it can be extended to large-scale image classification tasks such as ImageNet, CUB200, Oxford-Pet, and Flowers datasets.

Weaknesses

1. In the comparative experiments, the authors missed an opportunity to benchmark their method against the latest advancements like CLIP-ReID, restricting comparisons solely to TransReID. 2. When contrasted with TransReID, this approach shows a moderate enhancement in performance.

Questions

I am particularly concerned about the performance comparison in this paper. Is it necessary to use diffusion models for conducting ReID tasks, and what advantages do they offer compared to CNNs or ViTs? Currently, it seems that their performance improvement is rather modest.

Rating

8

Confidence

4

Soundness

3

Presentation

3

Contribution

3

Limitations

yes, the authors adequately addressed the limitations.

Authorsrebuttal2024-08-06

Open Discussion

Hi dear reviewers, we thank all your professional and kind comments. We have carefully read and responded to all the comments. Please allow me to clarify some misunderstandings and highlight our contributions. Our proposed method is test-time computation-free (FREE LUNCH!) and scalable to various baseline and downstream tasks, which has been proven in CNN series (e.g. ResNet50), Transformer series (e.g. ViT, Vmanba), Person Re-ID (MSMT, Duke), Vehicle Re-ID (vehicReID), Large-Scale Image Classification (ImageNet), Fine-Grained Image Classification (CUB) and Object Detection (COCO). For its scalability, we DO NOT hack it for backbones or tasks. With the same hyper-parameters, ours achieve consistent and stable improvement on ALL backbones and tasks above. For example, based on the famous object detection method Mask-RCNN, our proposed method achieves extra improvement from 1.6%-1.1% on COCO. Based on previous state-of-the-art CLIP-ReID, our proposed method achieves extra improvements from 0.8%-0.6% on Duke, MSMT and Market. All those improvements take NO extra test-time computation and NO specific hyper-parameters customized by tasks. Considering the advantages of **test-time computation-free** and the **consistent and stable improvement on the MANY backbones and tasks** (CNN series, Transformer series, Person ReID, Vehicle ReID, Occluded ReID, Large-Scale Image Classification, Fine-Grained Image Classification, Object Detection), we believe the proposed method will make significant contributions to the Representation Learning community. Code will be released in future.

Reviewer DSeM2024-08-09

Thanks for authors's feedback. After reading it, all of my questions have been addressed. I also read the comments from other reviewers and notice an extra point "minimal gains on TransReID". The authors claim that 1.1-1.6% extra gain based on MaskRCNN and 0.6-0.8% extra gain based on latest state-of-the-art CLIP-ReID. I thought this is a satisfying improvement. I prefer its novelty, concision, and its advantages of no-extra-lancy, stable improvements and scalibity to many downstream tasks. In summary, I keep my original rating (strong accept). Looking forward to seeing its application to more tasks.

Authorsrebuttal2024-08-11

Reponse to reviewer's comment

We thank the reviewer kind comment. We will keep improving the proposed method and apply it to more downstream tasks in future.

Reviewer w7Th2024-08-10

After carefully reviewing the author's rebuttal, I believe that the concerns I previously raised have been thoroughly addressed. I have decided to accept this paper for the following main reasons: This paper presents a novel representation learning denoising model for person re-identification, named DenoiseRelD. By integrating feature extraction and denoising techniques, the model significantly enhances feature discriminability. The approach is both theoretically elegant and practically feasible. The author has clearly articulated the motivation and design details of the DenoiseRelD method in both the paper and the rebuttal. Compared to existing methods, DenoiseRelD demonstrates outstanding performance across four benchmark datasets, showing significant advantages. Given these reasons, along with the author's effective response to the concerns raised by other reviewers, I have decided to revise my initial rating to 'Strong Accept'.

Authorsrebuttal2024-08-11

Response to reviewer's comment

We thank the reviewer kind comment. We will keep improving the proposed method and apply it to more downstream tasks in future.

Reviewer 4MBF2024-08-10

Thanks for the authors' feedback. I am still concerned about the following issues. For Q1, I think the motivation of this paper is the same as that of [1, 2, 3], both of which apply denoising features to downstream tasks. I think it makes more reasonable to directly use the features of the pre-trained diffusion model. For Q2, the results in Table 3 cannot provide strong evidence for the hypothesis stated by the authors in Line144-146 of the paper. Since the ReID loss is used to optimize the parameters of FEFDFA and the parameters of the FEFDFA are fused with the backbone in the final, I suspect that the performance improvement in the Table 3 is more like the data augmentation effect brought about by adding noise, rather than denoising. For Q4, unless the authors provide relevant theory or previous works to prove that denoising loss can be used with other task losses to optimize diffusion models or visual task models, I believe that the training loss Eq.(12) is questionable. Denoising in diffusion is fundamentally different from other downstream visual tasks as the optimization objective of them are inconsistent. The relevant paper listed by the author cannot provide evidence to the rebuttal. DiffDet[4] applies the idea of denoising to the bbox regression in object detection. DiffSeg[5] directly uses the intermediate attention layer features of the stable diffusion for the segmentation task, which is similar to the method [1,2,3] mentioned in Q1 that directly uses the intermediate layer features of the pre-trained diffusion model. [1] Mukhopadhyay, Soumik, et al. "Diffusion models beat gans on image classification." arXiv preprint arXiv:2307.08702 (2023). [2] Li, Alexander C., et al. "Your diffusion model is secretly a zero-shot classifier." ICCV 2023. [3] Baranchuk, Dmitry, et al. "Label-Efficient Semantic Segmentation with Diffusion Models." ICLR 2022. [4] Chen, Shoufa, et al. "Diffusiondet: Diffusion model for object detection." ICCV 2023. [5] Tian, Junjiao, et al. "Diffuse Attend and Segment: Unsupervised Zero-Shot Segmentation using Stable Diffusion." CVPR 2024.

Authorsrebuttal2024-08-11

Response to Comment by Reviewer 4MBF

We thank the reviewer's detailed comment. It seems that there are still some misunderstandings. Please allow us to explain them again. The responses are listed below and free feel to deeply discuss. **Q: "For Q2"** A: As we have clarified in the rebuttal, we DO NOT use any label (i.e. ReID loss is NOT used) in this experiment. The improvement should come from denoising loss. Based on the observation, we "suppose that in the inference stage, the features obtained by backbone extraction are noisy". **Q: "For Q4"** A: As far as I know, "unifying feature extraction and feature denoising" is pioneeringly proposed in this manuscript. Thus, we can't provide previous works to prove "why denoising loss and task losses can be used together". However, we show the fake code of our proposed method, hoping this can solve your misunderstanding. Please pay attention to the line "denoised_feats = feats - self.denoise_layer(x)", which we think may cause your misunderstanding. ``` // Fake Code of the Proposed Algorithm // Plz note that, this code targets understanding "why reid_loss and denosing_loss can be used together". Thus, we only show some critical logic and details may be missed and inaccurate. class DenoiseLinear: def __init__(self): self.linear = nn.Linear() self.denoise_layer = nn.Linear() set_require_grad_false(self.linear) def forward_train(self, x): // basic branch feats = self.linear(x) // denoising branch, this process is the same with DDPM gt_noise = sample_from_gaussian() pred_noise = self.denoise_layer(x + gt_noise) denoise_loss = l1_or_l2_loss(gt_noise, pred_noise) // tip to optimzie denoise layer with reid_loss is returning denoised_feats NOT feats denoised_feats = feats - self.denoise_layer(x) return denoised_feats, denoise_loss def forward_test(self, x); w, b = fuse_weight(self.linear, self.denoise_layer) // compute offline denosied_feats = w * x + b return denosied_feats // A Toy ReID Model with 2 linear layers class ReIDModel: def __init__(self): self.linear1 = DenoiseLinear() self.linear2 = DenoiseLienar() // unsupervised manner def train_without_reid_loss(self, x): feat1, denoise_loss1 = self.linear1.forward_train(x) feat2, denoise_loss2 = self.lienar2.forward_train(x) return feat2, denoise_loss1 + denoise_loss2 // supervised manner def train_with_reid_loss(self, x, y): feat1, denoise_loss1 = self.linear1.forward_train(x) feat2, denoise_loss2 = self.lienar2.forward_train(x) reid_loss = compute_reid_loss(feat2, y) return feat2, denoise_loss1 + denoise_loss2 + reid_loss def forward_test(self, x): feat1 = self.linear1.forward_test(x) feat2 = self.linear2.forward_test(feat1) return feat2 ``` **Q: "For Q1"** A: Our proposed method is very different from the related work [1-3]. We summarize them in the table below: | | Usage | Scalibity | Improvement and Latency | | :-----------------: | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | | Ours | Improve existing vision models, which could be from many vision tasks. | [better] ONE method for MANY vision taks without customizing implementation and hyper-parameters. | [better] Given a model of specific vision task (e.g. CLIP-REID), achieve STABLE improvement with NO extra latency compared to the given model. | | Related Works [1-3] | Customize a model for a specific vision task based on a well-trained strong diffusion model. | ONE method for ONE vision task. Need customize Implementation and hyper-parameters for specific tasks. | Given a diffusion model (e.g. StableDiffusionXL), improvement and latency depend on how strong the diffusion model is and the details of the customized implementation for specific tasks. |

Reviewer 4MBF2024-08-13

Thank you for your the positive response. The authors have addressed some of my concerns. I will revise my initial rating, combined with the comments of other reviewers.

Program Chairsdecision2024-09-25

Decision

Accept (oral)

© 2026 NYSGPT2525 LLC