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

Yinger Zhang

dblp:293/6628 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0001-6453-7462ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 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
3 papers
Language models and text generation · 39% Planning, search and constraint satisfaction · 24% Efficient and distributed learning · 18%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 77% Information retrieval · 23%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
agent planning
1.012026
DeepPlanning: Benchmarking Long-Horizon Agentic Planning with Verifiable Constraints · ACL (1) 2026
Natural language and speech › Language models and text generation
LLM agents
1.012026
DeepPlanning: Benchmarking Long-Horizon Agentic Planning with Verifiable Constraints · ACL (1) 2026
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
planning evaluation
1.012026
DeepPlanning: Benchmarking Long-Horizon Agentic Planning with Verifiable Constraints · ACL (1) 2026
Natural language and speech › Language models and text generation › trustworthy language model › large language model reliability
factuality
0.812024
FoRAG: Factuality-optimized Retrieval Augmented Generation for Web-enhanced Long-form Question Answering · KDD 2024
Natural language and speech › Language models and text generation › trustworthy language model › large language model reliability › factuality
factuality improvement
0.812024
FoRAG: Factuality-optimized Retrieval Augmented Generation for Web-enhanced Long-form Question Answering · KDD 2024
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.812024
MoDE: A Mixture-of-Experts Model with Mutual Distillation among the Experts · AAAI 2024
Natural language and speech › Question answering and dialogue systems
long-form question answering
0.812024
FoRAG: Factuality-optimized Retrieval Augmented Generation for Web-enhanced Long-form Question Answering · KDD 2024
Machine learning › Deep learning architectures and training
mixture of experts
0.812024
MoDE: A Mixture-of-Experts Model with Mutual Distillation among the Experts · AAAI 2024
Machine learning › Efficient and distributed learning › model compression › knowledge distillation › online knowledge distillation
mutual learning
0.812024
MoDE: A Mixture-of-Experts Model with Mutual Distillation among the Experts · AAAI 2024
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.812024
FoRAG: Factuality-optimized Retrieval Augmented Generation for Web-enhanced Long-form Question Answering · KDD 2024
Recommender systems
conversion rate prediction
0.512021
Modeling the Sequential Dependence among Audience Multi-step Conversions with Multi-task Learning in Targeted Display Advertising · KDD 2021
Information retrieval › online advertising
display advertising targeting
0.112021
Modeling the Sequential Dependence among Audience Multi-step Conversions with Multi-task Learning in Targeted Display Advertising · KDD 2021

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

reinforcement learning from human feedback · 0.8mutual distillation · 0.8expert probing · 0.8multi-task learning · 0.5adaptive information transfer · 0.5
YearPublicationVenuePosition
2026 DeepPlanning: Benchmarking Long-Horizon Agentic Planning with Verifiable Constraints
abstract
Yinger Zhang, Shutong Jiang, Renhao Li, Jianhong Tu, Yang Su, Lianghao Deng, Xudong Guo, ChenXu Lv, Junyang Lin. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Yinger Zhang, Shutong Jiang, Renhao Li, Jianhong Tu, Lianghao Deng, Chenxu Lv, Junyang Lin
ACL (1)1
2024 MoDE: A Mixture-of-Experts Model with Mutual Distillation among the Experts
abstract
The application of mixture-of-experts (MoE) is gaining popularity due to its ability to improve model's performance. In an MoE structure, the gate layer plays a significant role in distinguishing and routing input features to different experts. This enables each expert to specialize in processing their corresponding sub-tasks. However, the gate's routing mechanism also gives rise to "narrow vision": the individual MoE's expert fails to use more samples in learning the allocated subtask, which in turn limits the MoE to further improve its generalization ability. To effectively address this, we propose a method called Mixture-of-Distilled-Expert (MoDE), which applies moderate mutual distillation among experts to enable each expert to pick up more features learned by other experts and gain more accurate perceptions on their allocated sub-tasks. We conduct plenty experiments including tabular, NLP and CV datasets, which shows MoDE's effectiveness, universality and robustness. Furthermore, we develop a parallel study through innovatively constructing "expert probing", to experimentally prove why MoDE works: moderate distilling knowledge from other experts can improve each individual expert's test performances on their assigned tasks, leading to MoE's overall performance improvement.
Zhitian Xie, Yinger Zhang, Chenyi Zhuang, Qitao Shi, Zhining Liu 0001, Jinjie Gu
AAAI2
2024 FoRAG: Factuality-optimized Retrieval Augmented Generation for Web-enhanced Long-form Question Answering
abstract
Retrieval Augmented Generation (RAG) has become prevalent in question-answering (QA) tasks due to its ability of utilizing search engine to enhance the quality of long-form question-answering (LFQA). Despite the emergence of various open source methods and web-enhanced commercial systems such as Bing Chat, two critical problems remain unsolved, i.e., the lack of factuality and clear logic in the generated long-form answers. In this paper, we remedy these issues via a systematic study on answer generation in web-enhanced LFQA. Specifically, we first propose a novel outline-enhanced generator to achieve clear logic in the generation of multifaceted answers and construct two datasets accordingly. Then we propose a factuality optimization method based on a carefully designed doubly fine-grained RLHF framework, which contains automatic evaluation and reward modeling in different levels of granularity. Our generic framework comprises conventional fine-grained RLHF methods as special cases. Extensive experiments verify the superiority of our proposed Factuality-optimized RAG (FoRAG) method on both English and Chinese benchmarks. In particular, when applying our method to Llama2-7B-chat, the derived model FoRAG-L-7B outperforms WebGPT-175B in terms of three commonly used metrics (i.e., coherence, helpfulness, and factuality), while the number of parameters is much smaller (only 1/24 of that of WebGPT-175B). Our datasets and models are made publicly available for better reproducibility.https://huggingface.co/forag łabelfootnote_dataset_url
Tianchi Cai, Zhiwen Tan, Xierui Song, Tao Sun 0018, Jiyan Jiang, Yunqi Xu, Yinger Zhang, Jinjie Gu
KDD7
2021 Modeling the Sequential Dependence among Audience Multi-step Conversions with Multi-task Learning in Targeted Display Advertising
abstract
In most real-world large-scale online applications (e.g., e-commerce or finance), customer acquisition is usually a multi-step conversion process of audiences. For example, an impression->click->purchase process is usually performed of audiences for e-commerce platforms. However, it is more difficult to acquire customers in financial advertising (e.g., credit card advertising) than in traditional advertising. On the one hand, the audience multi-step conversion path is longer, an impression->click->application->approval->activation process usually occurs during the audience conversion for credit card business in financial advertising. On the other hand, the positive feedback is sparser (class imbalance) step by step, and it is difficult to obtain the final positive feedback due to the delayed feedback of activation. Therefore, it is necessary to use the positive feedback information of the former step to alleviate the class imbalance of the latter step. Multi-task learning is a typical solution in this direction. While considerable multi-task efforts have been made in this direction, a long-standing challenge is how to explicitly model the long-path sequential dependence among audience multi-step conversions for improving the end-to-end conversion. In this paper, we propose an Adaptive Information Transfer Multi-task (AITM) framework, which models the sequential dependence among audience multi-step conversions via the Adaptive Information Transfer (AIT) module. The AIT module can adaptively learn what and how much information to transfer for different conversion stages. Besides, by combining the Behavioral Expectation Calibrator in the loss function, the AITM framework can yield more accurate end-to-end conversion identification. The proposed framework is deployed in Meituan app, which utilizes it to real-timely show a banner to the audience with a high end-to-end conversion rate for Meituan Co-Branded Credit Cards. Offline experimental results on both industrial and public real-world datasets clearly demonstrate that the proposed framework achieves significantly better performance compared with state-of-the-art baselines. Besides, online experiments also demonstrate significant improvement compared with existing online models. Furthermore,we have released the source code of the proposed framework at https://github.com/xidongbo/AITM.
Dongbo Xi, Yinger Zhang, Yongchun Zhu, Fuzhen Zhuang, Yu Chen 0091
KDD4