paper-with-me

홈 › Papers

DAC: 2D-3D Retrieval with Noisy Labels via Divide-and-Conquer Alignment and Correction

2024-07-25 · Chaofan Gan, Yuanpeng Tu, Yuxi Li, Weiyao Lin

With the recent burst of 2D and 3D data, cross-modal retrieval has attracted increasing attention recently. However, manual labeling by non-experts will inevitably introduce corrupted annotations given ambiguous 2D/3D content. Though previous works have addressed this issue by designing a naive division strategy with hand-crafted thresholds, their performance generally exhibits great sensitivity to the threshold value. Besides, they fail to fully utilize the valuable supervisory signals within each divided subset. To tackle this problem, we propose a Divide-and-conquer 2D-3D cross-modal Alignment and Correction framework (DAC), which comprises Multimodal Dynamic Division (MDD) and Adaptive Alignment and Correction (AAC). Specifically, the former performs accurate sample division by adaptive credibility modeling for each sample based on the compensation information within multimodal loss distribution. Then in AAC, samples in distinct subsets are exploited with different alignment strategies to fully enhance the semantic compactness and meanwhile alleviate over-fitting to noisy labels, where a self-correction strategy is introduced to improve the quality of representation. Moreover. To evaluate the effectiveness in real-world scenarios, we introduce a challenging noisy benchmark, namely Objaverse-N200, which comprises 200k-level samples annotated with 1156 realistic noisy labels. Extensive experiments on both traditional and the newly proposed benchmarks demonstrate the generality and superiority of our DAC, where DAC outperforms state-of-the-art models by a large margin. (i.e., with +5.9% gain on ModelNet40 and +5.8% on Objaverse-N200).

📄 PDF Abstract BibTeX arXiv:2407.17779

Code (1)

ganchaofan0000/DAC 공식 구현 pytorch

Tasks

cross-modal alignmentCross-Modal RetrievalRetrieval

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Attention 설명 없음
DAC 설명 없음

Similar Papers 제목 키워드 기반

Improve Sentence Alignment by Divide-and-conquer

2022-01-18 · Wu Zhang

In this paper, we introduce a divide-and-conquer algorithm to improve sentence alignment speed. We utilize external bilingual sentence embeddings to find accurate hard delimiters for the parallel texts to be aligned. We …

Optical Character Recognition (OCR)SentenceSentence Embeddings

Memory Consistency Guided Divide-and-Conquer Learning for Generalized Category Discovery

2024-01-24 · Yuanpeng Tu, Zhun Zhong, Yuxi Li, Hengshuang Zhao

Generalized category discovery (GCD) aims at addressing a more realistic and challenging setting of semi-supervised learning, where only part of the category labels are assigned to certain training samples. Previous meth…

Contrastive Learning

A Neural Divide-and-Conquer Reasoning Framework for Image Retrieval from Linguistically Complex Text

2023-05-03 · Yunxin Li, Baotian Hu, Yuxin Ding, Lin Ma 외

Pretrained Vision-Language Models (VLMs) have achieved remarkable performance in image retrieval from text. However, their performance drops drastically when confronted with linguistically complex texts that they struggl…

Image RetrievalLogical ReasoningRetrieval

Hide and Seek in Noise Labels: Noise-Robust Collaborative Active Learning with LLM-Powered Assistance

2025-04-03 · Bo Yuan, Yulin Chen, Yin Zhang, Wei Jiang

Learning from noisy labels (LNL) is a challenge that arises in many real-world scenarios where collected training data can contain incorrect or corrupted labels. Most existing solutions identify noisy labels and adopt ac…

Active LearningDenoising

Divide-and-Conquer Matrix Factorization

2011-12-01 · NeurIPS 2011 12 · Lester W. Mackey, Michael. I. Jordan, Ameet Talwalkar

This work introduces Divide-Factor-Combine (DFC), a parallel divide-and-conquer framework for noisy matrix factorization. DFC divides a large-scale matrix factorization task into smaller subproblems, solves each subprob…

Collaborative Filtering