Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Canbin Huang

dblp:359/1198 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Language models and text generation · 30% Reinforcement learning · 28% Efficient and distributed learning · 16%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model merging
1.012026
ProFuser: Progressive Fusion of Large Language Models · AAAI 2026
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
co-teaching
0.912025
Mutual-Taught for Co-adapting Policy and Reward Models · ACL (1) 2025
Natural language and speech › Language models and text generation
large language model
0.912025
Lookahead Routing for Large Language Models · NeurIPS 2025
Machine learning › Reinforcement learning › reward learning
reward modeling
0.912025
Mutual-Taught for Co-adapting Policy and Reward Models · ACL (1) 2025
Machine learning › Reinforcement learning › reinforcement learning from human feedback › learning from human feedback
RLHF
0.912025
Mutual-Taught for Co-adapting Policy and Reward Models · ACL (1) 2025
Natural language and speech › Question answering and dialogue systems
task-oriented dialogue
0.712023
Retrieval-Generation Alignment for End-to-End Task-Oriented Dialogue System · EMNLP 2023
Information retrieval › retrieval-augmented generation
knowledge retrieval
0.712023
Retrieval-Generation Alignment for End-to-End Task-Oriented Dialogue System · EMNLP 2023
Natural language and speech › Question answering and dialogue systems › dialogue generation
dialogue response generation
0.212023
Retrieval-Generation Alignment for End-to-End Task-Oriented Dialogue System · EMNLP 2023

Methods — techniques the papers use, named apart from their topics

meta knowledge integration · 1.3maximal marginal likelihood · 1.3teacher forcing · 1.0progressive training · 1.0cross-entropy · 1.0policy-reward co-adaptation · 0.9mutual teaching · 0.9masked language model · 0.9latent representation prediction · 0.9causal language model · 0.9
YearPublicationVenuePosition
2026 ProFuser: Progressive Fusion of Large Language Models
abstract
While fusing the capacities and advantages of various large language models offers a pathway to construct more powerful and versatile models, a fundamental challenge is to properly select advantageous model during training. Existing fusion methods primarily focus on the training mode that uses cross entropy on ground truth in a teacher-forcing setup to measure a model's advantage, which may provide limited insight towards model advantage. In this paper, we introduce a novel approach that enhances the fusion process by incorporating both the training and inference modes. Our method evaluates model advantage not only through cross entropy during training but also by considering inference outputs, providing a more comprehensive assessment. To combine the two modes effectively, we introduce ProFuser to progressively transition from inference mode to training mode. To validate ProFuser's effectiveness, we fused three models, including Vicuna-7B-v1.5, Llama-2-7B-Chat, and MPT-7B-8K-Chat, and demonstrated the improved performance in knowledge, reasoning, and safety compared to baseline methods.
Tianyuan Shi, Fanqi Wan, Canbin Huang, Xiaojun Quan, Chenliang Li 0003, Ming Yan 0008, Ji Zhang 0011, Minhua Huang 0002, Wu Kai
AAAI3
2025 Mutual-Taught for Co-adapting Policy and Reward Models
abstract
Tianyuan Shi, Canbin Huang, Fanqi Wan, Longguang Zhong, Ziyi Yang, Weizhou Shen, Xiaojun Quan, Ming Yan. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
Tianyuan Shi, Canbin Huang, Fanqi Wan, Longguang Zhong, Weizhou Shen, Xiaojun Quan, Ming Yan 0008
ACL (1)2
2025 Lookahead Routing for Large Language Models
abstract
Large language model (LLM) routers improve the efficiency of multi-model systems by directing each query to the most appropriate model while leveraging the diverse strengths of heterogeneous LLMs. Most existing approaches frame routing as a classification problem based solely on the input query. While this reduces overhead by avoiding inference across all models, it overlooks valuable information that could be gleaned from potential outputs and fails to capture implicit intent or contextual nuances that often emerge only during response generation. These limitations can result in suboptimal routing decisions, particularly for complex or ambiguous queries that require deeper semantic understanding. To address this challenge, we propose Lookahead, a routing framework that "foresees" potential model outputs by predicting their latent representations and uses these predictions to guide model selection, thus enabling more informed routing without full inference. Within this framework, we implement two approaches based on causal and masked language models. Empirical evaluations across seven public benchmarks—spanning instruction following, mathematical reasoning, and code generation—show that Lookahead consistently outperforms existing routing baselines, achieving an average performance gain of 7.7\% over the state-of-the-art. Our code is available at https://github.com/huangcb01/lookahead-routing.
Canbin Huang, Tianyuan Shi, Yuhua Zhu, Ruijun Chen 0001, Xiaojun Quan
NeurIPS1
2023 Retrieval-Generation Alignment for End-to-End Task-Oriented Dialogue System
abstract
Developing an efficient retriever to retrieve knowledge from a large-scale knowledge base (KB) is critical for task-oriented dialogue systems to effectively handle localized and specialized tasks.However, widely used generative models such as T5 and ChatGPT often struggle to differentiate subtle differences among the retrieved KB records when generating responses, resulting in suboptimal quality of generated responses.In this paper, we propose the application of maximal marginal likelihood to train a perceptive retriever by utilizing signals from response generation for supervision.In addition, our approach goes beyond considering solely retrieved entities and incorporates various meta knowledge to guide the generator, thus improving the utilization of knowledge.We evaluate our approach on three task-oriented dialogue datasets using T5 and ChatGPT as the backbone models.The results demonstrate that when combined with meta knowledge, the response generator can effectively leverage high-quality knowledge records from the retriever and enhance the quality of generated responses.The code of this work is available at https://github.com/shenwzh3/MK-TOD.
Weizhou Shen, Yingqi Gao, Canbin Huang, Fanqi Wan, Xiaojun Quan, Wei Bi
EMNLP3