Self-Supervised Learning in Multi-Task Graphs through Iterative Consensus Shift
원문 초록
The human ability to synchronize the feedback from all their senses inspired recent works in multi-task and multi-modal learning. While these works rely on expensive supervision, our multi-task graph requires only pseudo-labels from expert models. Every graph node represents a task, and each edge learns between tasks transformations. Once initialized, the graph learns self-supervised, based on a novel consensus shift algorithm that intelligently exploits the agreement between graph pathways to generate new pseudo-labels for the next learning cycle. We demonstrate significant improvement from one unsupervised learning iteration to the next, outperforming related recent methods in extensive multi-task learning experiments on two challenging datasets. Our code is available at https://github.com/bit-ml/cshift.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
MSDA: Combining Pseudo-labeling and Self-Supervision for Unsupervised Domain Adaptation in ASR
Unlocking Constraints: Source-Free Occlusion-Aware Seamless Segmentation
Efficient and Generalizable Speaker Diarization via Structured Pruning of Self-Supervised Models
Diffusion Domain Teacher: Diffusion Guided Domain Adaptive Object Detector
Unleashing the Power of Intermediate Domains for Mixed Domain Semi-Supervised Medical Image Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.