Huacan Chai

dblp:356/2680 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0006-4313-6516ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers
Language models and text generation · 54% Multi-agent systems · 46%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › agentic language model › tool-augmented language models
function calling
1.012026
ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling · ACL (1) 2026
Natural language and speech › Language models and text generation › text generation
structured generation
1.012026
ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling · ACL (1) 2026
Knowledge, reasoning and agents › Multi-agent systems › multi-agent coordination
distributed coordination
0.912025
AgentNet: Decentralized Evolutionary Coordination for LLM-based Multi-Agent Systems · NeurIPS 2025
Knowledge, reasoning and agents › Multi-agent systems
LLM-based multi-agent systems
0.912025
AgentNet: Decentralized Evolutionary Coordination for LLM-based Multi-Agent Systems · NeurIPS 2025
Distributed systems
fault tolerance
0.312025
AgentNet: Decentralized Evolutionary Coordination for LLM-based Multi-Agent Systems · NeurIPS 2025

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

retrieval-augmented generation · 1.7knowledge distillation · 1.7directed acyclic graph · 1.7process reward model · 1.0inference scaling · 1.0
YearPublicationVenuePosition
2026 ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling
abstract
Jianghao Lin, Yuanyuan Shi, Xin Peng, Renjie Ding, Hairui Wang, Yuxuan Peng, Bizhe Bai, Weixi Song, Fengshuo Bai, Huacan Chai, Weinan Zhang, Fei Huang, Ying Wen. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Jianghao Lin, Renjie Ding, Yuxuan Peng, Bizhe Bai, Weixi Song, Fengshuo Bai, Huacan Chai, Weinan Zhang 0001, Ying Wen 0001
ACL (1)10
2025 An Efficient Approximation Framework for LLM-Enhanced Recommendation
Huacan Chai, Menghui Zhu, Jianghao Lin, Yunjia Xi, Weinan Zhang 0001, Yong Yu 0001
ICIC (8)1
2025 AgentNet: Decentralized Evolutionary Coordination for LLM-based Multi-Agent Systems
abstract
The rapid advancement of Large Language Models (LLMs) has catalyzed the development of multi-agent systems, where multiple LLM-based agents collaborate to solve complex tasks. However, existing systems predominantly rely on centralized coordination, which introduces scalability bottlenecks, limits adaptability, and creates single points of failure. Additionally, concerns over privacy and proprietary knowledge sharing hinder cross-organizational collaboration, leading to siloed expertise. To address these challenges, we propose AgentNet, a decentralized, Retrieval-Augmented Generation (RAG)-based framework that enables LLM-based agents to autonomously evolve their capabilities and collaborate efficiently in a Directed Acyclic Graph (DAG)-structured network. Unlike traditional multi-agent systems that depend on static role assignments or centralized control, AgentNet allows agents to specialize dynamically, adjust their connectivity, and route tasks without relying on predefined workflows. AgentNet’s core design is built upon several key innovations: (1) Fully Decentralized Paradigm: Removing the central orchestrator, allowing agents to coordinate and specialize autonomously, fostering fault tolerance and emergent collective intelligence. (2) Dynamically Evolving Graph Topology: Real-time adaptation of agent connections based on task demands, ensuring scalability and resilience. (3) Adaptive Learning for Expertise Refinement: A retrieval-based memory system that enables agents to continuously update and refine their specialized skills. By eliminating centralized control, AgentNet enhances fault tolerance, promotes scalable specialization, and enables privacy-preserving collaboration across organizations. Through decentralized coordination and minimal data exchange, agents can leverage diverse knowledge sources while safeguarding sensitive information. Experimental results demonstrate that AgentNet outperforms traditional centralized multi-agent systems, significantly improving efficiency, adaptability, and scalability in dynamic environments, making it a promising foundation for next-generation autonomous, privacy-respecting multi-agent ecosystems.
Yingxuan Yang, Huacan Chai, Yuanyi Song, Siyuan Qi, Renting Rui, Weinan Zhang 0001
NeurIPS2
2024 Search-based Time-aware Graph-enhanced Recommendation with Sequential Behavior Data
abstract
Extending from sequential recommendation models, in this article, we present a novel framework named Search-based Time-Aware Recommendation (STARec), which first retrieves the historical behaviors of the given user through a search-based retriever and then captures the user’s evolving demands over time through a time-aware sequential network. We notice that the key insight of STARec is to use the feature and labels to augment the representations, and thus the effectiveness of STARec relies on the acquisition of rich browsing records of the target user and powerful representation of each browsed item and thus its performance could heavily drop regarding long-tail users and items. To this end, we extend STARec by constructing a graph upon the user–item interactions and leveraging the graph structure to enhance the representation learning. We call this extended version Search-based Time-Aware Graph-Enhanced Recommendation (STAGE). We conduct extensive experiments on three real-world datasets and STARec achieves consistent superiority. We further compare STAGE against STARec long-tail users and our results demonstrate that STAGE could outperform STARec at most cases. Results of online A/B tests show that STARec and STAGE achieve an average click-through rate improvement of around 6% and 1.5% in the two main item recommendation scenarios, respectively. 1
Lei Zheng 0004, Huacan Chai, Jiarui Jin, Weinan Zhang 0001, Yong Yu 0001, Can Ge, Ziming Feng
Trans. Recomm. Syst.2