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

Zihan Niu

dblp:303/8924 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
8since 2021 · last 2025
—ORCID · conflict

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 · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 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.

Computer networks
1 paper
Datacenter networks · 33% Network optimization and economics · 33% Transport protocols and congestion control · 33%
Artificial intelligence
1 paper
Question answering and dialogue systems · 50% Language models and text generation · 50%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
dialogue systems
0.912025
PaRT: Enhancing Proactive Social Chatbots with Personalized Real-Time Retrieval · SIGIR 2025
Transport protocols and congestion control
congestion feedback
0.912025
THEMIS: Addressing Congestion-Induced Unfairness in Long-Haul RDMA Networks · ICNP 2025
Network optimization and economics
fairness
0.912025
THEMIS: Addressing Congestion-Induced Unfairness in Long-Haul RDMA Networks · ICNP 2025
Datacenter networks › RDMA
RDMA congestion control
0.912025
THEMIS: Addressing Congestion-Induced Unfairness in Long-Haul RDMA Networks · ICNP 2025
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.812024
Retrieve-Plan-Generation: An Iterative Planning and Answering Framework for Knowledge-Intensive LLM Generation · EMNLP 2024
Information retrieval
retrieval-augmented generation
0.312025
PaRT: Enhancing Proactive Social Chatbots with Personalized Real-Time Retrieval · SIGIR 2025

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

testbed evaluation · 1.7simulation · 1.7real-time retrieval · 0.9large language model · 0.9prompt tuning · 0.8iterative planning · 0.8
YearPublicationVenuePosition
2025 THEMIS: Addressing Congestion-Induced Unfairness in Long-Haul RDMA Networks
abstract
RDMA is promising for enhancing the performance of cross-datacenter (DC) services. However, deploying RDMA over wide-area networks introduces severe congestion control unfairness, primarily due to asymmetric congestion feedback delays between inter-DC flows and intra-DC flows. As a result, intra-DC flows often bear the full burden of congestion response, leading to drastically increased flow completion times (FCT). In this work, we identify two key forms of unfairness — near-source and near-destination — depending on whether congestion occurs near the sender or receiver of inter-DC flows. Based on this, we propose THEMIS, a fairness maintenance patch for long-haul RDMA networks. To mitigate near-source unfairness, THEMIS devises a Proactive Notification Point to shorten the congestion feedback loop within a single DC. To alleviate near-destination unfairness, THEMIS introduces a Temporary Reaction Point to temporarily slow down the target inter-DC flow until the sender receives the corresponding congestion feedback. We implement an open-source prototype of THEMIS, and evaluate it on both real-world testbed and large-scale simulations. Compared to DCQCN, Annulus and BiCC, THEMIS reduces the intra-DC FCT by up to 79.2%, 63.6% and 55.6%, and decreases overall FCT by up to 61.2%, 31.9% and 59.5% respectively.
Zihan Niu, Menghao Zhang 0001, Renjie Xie, Yuan Yang 0001, Xiaohe Hu
ICNP1
2025 Generating Event-Oriented Attribution for Movies via Two-Stage Prefix-Enhanced Multimodal LLM
Yuanjie Lyu, Tong Xu 0001, Zihan Niu, Jing Ke
KSEM (4)3
2025 PaRT: Enhancing Proactive Social Chatbots with Personalized Real-Time Retrieval
abstract
Social chatbots have become essential companions in daily scenarios ranging from emotional support to personal interaction. However, conventional chatbots with passive response mechanisms usually rely on users to initiate or sustain dialogues by bringing up new topics, resulting in diminished engagement and shortened dialogue duration. In this paper, we present PaRT, a novel framework enabling context-aware proactive dialogues for social chatbots through personalized real-time retrieval and generation. Specifically, PaRT first integrates user profiles and dialogue context into a large language model (LLM), which is initially prompted to refine user queries and recognize underlying intents for the upcoming conversation. Guided by refined intents, the LLM generates personalized dialogue topics as targeted queries to retrieve relevant passages from RedNote. Finally, we prompt LLMs with summarized passages to generate knowledge-grounded and engagement-optimized responses. Our approach has been running stably in a real-world production environment for more than 30 days, achieving a 21.77% improvement in the average duration of dialogues.
Zihan Niu, Zheyong Xie, Shaosheng Cao, Chonggang Lu, Zheyu Ye, Tong Xu 0001, Zuozhu Liu, Yan Gao 0017, Jia Chen 0003, Yao Hu 0002
SIGIR1
2024 Retrieve-Plan-Generation: An Iterative Planning and Answering Framework for Knowledge-Intensive LLM Generation
abstract
Despite the significant progress of large language models (LLMs) in various tasks, they often produce factual errors due to their limited internal knowledge.Retrieval-Augmented Generation (RAG), which enhances LLMs with external knowledge sources, offers a promising solution.However, these methods can be misled by irrelevant paragraphs in retrieved documents.Due to the inherent uncertainty in LLM generation, inputting the entire document may introduce off-topic information, causing the model to deviate from the central topic and affecting the relevance of the generated content.To address these issues, we propose the Retrieve-Plan-Generation (RPG) framework.RPG generates plan tokens to guide subsequent generation in the plan stage.In the answer stage, the model selects relevant fine-grained paragraphs based on the plan and uses them for further answer generation.This plan-answer process is repeated iteratively until completion, enhancing generation relevance by focusing on specific topics.To implement this framework efficiently, we utilize a simple but effective multi-task prompt-tuning method, enabling the existing LLMs to handle both planning and answering.We comprehensively compare RPG with baselines across 5 knowledge-intensive generation tasks, demonstrating the effectiveness of our approach.1
Yuanjie Lyu, Zihan Niu, Zheyong Xie, Chao Zhang 0096, Tong Xu 0001, Yang Wang 0001, Enhong Chen
EMNLP2
2024 Knowledge-Enhanced Multi-perspective Incongruity Perception Network for Multimodal Sarcasm Detection
abstract
Recent years have witnessed the urgent request for multi-modal sarcasm detection in social media platforms. Though large efforts have been made with significant progress, prior arts may fail to fully integrate the commonsense knowledge, and struggle to model the incongruity within implicit meanings of multimodal cues. To address these limitations, we propose a novel Knowledge-Enhanced Multi-perspective Incongruity Perception network, named KEMIP. Specifically, we adopt generative language models to produce captions and commonsense for image and text respectively for comprehensive understanding. Subsequently, to exploit the essential cues from multiple perspectives, we customize an incongruity perception module, which utilizes several fusion networks to capture both literal and implicit inconsistencies. Afterwards, an ensemble weighting gate is employed to integrate the result of individual perspective. Experiments on a public multimodal sarcasm detection benchmark demonstrate the superiority of our proposed KEMIP framework.
Zihan Niu, Zheyong Xie, Tong Xu 0001, Xiangfeng Wang 0005, Yao Hu 0002, Enhong Chen
ICME1
2023 Improved Deep Learning-Based Efficientpose Algorithm for Egocentric Marker-Less Tool and Hand Pose Estimation in Manual Assembly
Zihan Niu, Jun Zhang 0011, Bing Wang 0004, Peng Chen 0001
ICIC (5)1
2022 Object Detection Networks and Mixed Reality for Cable Harnesses Identification in Assembly Environment
Yixiong Wei, Hongqiao Zhou, Qianhao Wu, Zihan Niu
ICIC (3)5
2022 Resolving the Cohenian paradox in judicial probability theory
abstract
Abstract The Cohenian paradox is one of the main themes of judicial probability theory and one of the core topics discussed by the new evidence scholarship. To resolve this paradox, evidence scholars nowadays have proposed various solutions, including legal probabilism, judicial Bayesian decision theory and relative plausibility theory. These three solutions can be classified into two approaches, i.e. the probabilism and the explanationism. Among them, the former includes legal probabilism and judicial Bayesian decision theory, and the latter includes the relative plausibility theory. However, the two approaches have recently begun to converge and become more understandable to each other. For example, Welch (2020, Int. J. Evid. Proof, 24, 351–373) has recently defended and improved the relative plausibility theory by substantially improving it with the help of Bayesian decision theory. In this paper, by contrast, we attempt to defend the probabilistic approach—legal probabilism and Bayesian decision theory on the basis of relative plausibility theory.
Wenjing Du, Zihan Niu
J. Log. Comput.2