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

Yuedong Zhong

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 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
1 paper
Efficient and distributed learning · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 50% Requirements engineering and software design · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression › quantization
binary quantization
0.912025
STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMs · ICLR 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMs · ICLR 2025
Machine learning › Efficient and distributed learning › model compression › sparsity
structured sparsity
0.912025
STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMs · ICLR 2025
Information retrieval
question answering
0.912025
iKnow: an Intent-Guided Chatbot for Cloud Operations with Retrieval-Augmented Generation · ASE 2025
Information retrieval
retrieval-augmented generation
0.912025
iKnow: an Intent-Guided Chatbot for Cloud Operations with Retrieval-Augmented Generation · ASE 2025
Requirements engineering and software design
knowledge management
0.912025
iKnow: an Intent-Guided Chatbot for Cloud Operations with Retrieval-Augmented Generation · ASE 2025

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

retrieval-augmented generation · 1.7query rewriting · 1.7large language model · 1.7intent detection · 1.7quantization · 0.9n:m sparsity · 0.9importance metric · 0.9
YearPublicationVenuePosition
2026 LLMGuard: Multi-Agent Fault Diagnosis for Reliable Language-Model-as-a-Service
Yuedong Zhong, Guangba Yu, QunChao Fu, Yongqiang Yang, Michael R. Lyu
DSN1
2025 STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMs
abstract
In this paper, we present the first structural binarization method for LLM compression to less than 1-bit precision. Although LLMs have achieved remarkable performance, their memory-bound nature during the inference stage hinders the adoption of resource-constrained devices. Reducing weights to 1-bit precision through binarization substantially enhances computational efficiency. We observe that randomly flipping some weights in binarized LLMs does not significantly degrade the model's performance, suggesting the potential for further compression. To exploit this, our STBLLM employs an N:M sparsity technique to achieve structural binarization of the weights. Specifically, we introduce a novel Standardized Importance (SI) metric, which considers weight magnitude and input feature norm to more accurately assess weight significance. Then, we propose a layer-wise approach, allowing different layers of the LLM to be sparsified with varying N:M ratios, thereby balancing compression and accuracy. Furthermore, we implement a fine-grained grouping strategy for less important weights, applying distinct quantization schemes to sparse, intermediate, and dense regions. Finally, we design a specialized CUDA kernel to support structural binarization. We conduct extensive experiments on LLaMA, OPT, and Mistral family. STBLLM achieves a perplexity of 11.07 at 0.55 bits per weight, outperforming the BiLLM by 3×. The results demonstrate that our approach performs better than other compressed binarization LLM methods while significantly reducing memory requirements. Code is released at https://github.com/pprp/STBLLM.
Peijie Dong, Lujun Li 0001, Yuedong Zhong, Dayou Du, Ruibo Fan, Yuhan Chen 0008, Zhenheng Tang, Qiang Wang 0022, Wei Xue 0002, Yike Guo, Xiaowen Chu 0001
ICLR3
2025 iKnow: an Intent-Guided Chatbot for Cloud Operations with Retrieval-Augmented Generation
abstract
Managing complex cloud services requires standard operational documentation, but its sheer volume often hinders cloud engineers from efficient knowledge acquisition. Retrieval-Augmented Generation (RAG) can streamline this process by retrieving relevant knowledge and generating concise, referenced answers. However, deploying a reliable RAG-based chatbot for cloud operation remains a challenge. In this experience paper, we analyze the development and deployment of RAG-based chatbots for operational question answering (OpsQA) at a large-scale cloud vendor. Through an empirical study of 2,000 real-world queries across three operational teams, we identify five unique OpsQA intent types (e.g., symptom analysis and terminology explanation) and their corresponding requirements for a satisfactory answer, which differ from general software engineering queries. Our analysis further uncovers six root causes leading to chatbot failures—over half stem from query issues (i.e., incompleteness, out-of-scope, or invalid queries), while others are from retrieval or generation issues. To address these issues, we propose iKnow, an intent-guided RAG-based chatbot that integrates intent detection, query rewriting tailored to each intent, and missing knowledge detection to enhance answer quality. In internal evaluations, iKnow improves average answer accuracy from 65.8% to 81.3% with only a modest increase in latency. iKnow has been deployed for six months at CloudA, supporting thousands of cloud engineers in daily operations. We discuss lessons learned from real-world deployment, providing valuable insights for future research and practical implementations in similar domains.
Junjie Huang 0008, Yuedong Zhong, Guangba Yu, Minzhi Yan, Wenfei Luan, Michael R. Lyu
ASE2