paper-with-me

Papers

Co-Supervised Learning: Improving Weak-to-Strong Generalization with Hierarchical Mixture of Experts

2024-02-23 · Yuejiang Liu, Alexandre Alahi

Steering the behavior of a strong model pre-trained on internet-scale data can be difficult due to the scarcity of competent supervisors. Recent studies reveal that, despite supervisory noises, a strong student model may surpass its weak teacher when fine-tuned on specific objectives. Yet, the effectiveness of such weak-to-strong generalization remains limited, especially in the presence of large capability gaps. In this paper, we propose to address this challenge by harnessing a diverse set of specialized teachers, instead of a single generalist one, that collectively supervises the strong student. Our approach resembles the classical hierarchical mixture of experts, with two components tailored for co-supervision: (i) we progressively alternate student training and teacher assignment, leveraging the growth of the strong student to identify plausible supervisions; (ii) we conservatively enforce teacher-student and local-global consistency, leveraging their dependencies to reject potential annotation noises. We validate the proposed method through visual recognition tasks on the OpenAI weak-to-strong benchmark and additional multi-domain datasets. Our code is available at \url{https://github.com/yuejiangliu/csl}.

📄 PDF Abstract BibTeX arXiv:2402.15505

Code (0)

등록된 구현이 없습니다.

Tasks

Mixture-of-Experts

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Weakly Supervised Graph Clustering

2021-09-29 · Tian Bian, Tingyang Xu, Yu Rong, Wenbing Huang 외

Graph Clustering, which clusters the nodes of a graph given its collection of node features and edge connections in an unsupervised manner, has long been researched in graph learning and is essential in certain applicati…

ClusteringGraph ClusteringGraph Learning

Understanding the Capabilities and Limitations of Weak-to-Strong Generalization

2025-02-03 · Wei Yao, Wenkai Yang, Ziqiao Wang, Yankai Lin 외

Weak-to-strong generalization, where weakly supervised strong models outperform their weaker teachers, offers a promising approach to aligning superhuman models with human values. To deepen the understanding of this appr…

Mixture of Weak & Strong Experts on Graphs

2023-11-09 · Hanqing Zeng, Hanjia Lyu, Diyi Hu, Yinglong Xia 외

Realistic graphs contain both (1) rich self-features of nodes and (2) informative structures of neighborhoods, jointly handled by a Graph Neural Network (GNN) in the typical setup. We propose to decouple the two modaliti…

Graph Neural NetworkNode Classification

Weak-to-Strong Generalization with Failure Trajectories: A Tree-based Approach to Elicit Optimal Policy in Strong Models

2025-07-25 · Ruimeng Ye, Zihan Wang, Yang Xiao, Zinan Ling 외 arxiv

Weak-to-Strong generalization (W2SG) is a new trend to elicit the full capabilities of a strong model with supervision from a weak model. While existing W2SG studies focus on simple tasks like binary classification, we e…

Binary Classification

Deep asymmetric mixture model for unsupervised cell segmentation

2024-06-03 · Yang Nan, Guang Yang

Automated cell segmentation has become increasingly crucial for disease diagnosis and drug discovery, as manual delineation is excessively laborious and subjective. To address this issue with limited manual annotation, r…

Cell SegmentationDrug DiscoverymodelSegmentation