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

Ningyuan Zhao

dblp:329/7644 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 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 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 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
Trustworthy machine learning · 31% Language models and text generation · 28% Representation and self-supervised learning · 15%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
neighborhood consistency
1.012026
Illusions of Confidence? Diagnosing LLM Truthfulness via Neighborhood Consistency · ACL (1) 2026
Natural language and speech › Language models and text generation › large language model evaluation
truthfulness evaluation
1.012026
Illusions of Confidence? Diagnosing LLM Truthfulness via Neighborhood Consistency · ACL (1) 2026
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief change
knowledge forgetting
0.912025
ReLearn: Unlearning via Learning for Large Language Models · ACL (1) 2025
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
ReLearn: Unlearning via Learning for Large Language Models · ACL (1) 2025
Machine learning › Trustworthy machine learning
machine unlearning
0.912025
ReLearn: Unlearning via Learning for Large Language Models · ACL (1) 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.912025
XCalBid: Robust and Efficient Real-Time Bidding Via Exploratory Pre-Training and Calibrated Q-Learning · ICDM 2025
Machine learning › Trustworthy machine learning › machine unlearning
unlearning evaluation
0.912025
ReLearn: Unlearning via Learning for Large Language Models · ACL (1) 2025
Information retrieval
online advertising
0.912025
XCalBid: Robust and Efficient Real-Time Bidding Via Exploratory Pre-Training and Calibrated Q-Learning · ICDM 2025
Information retrieval › online advertising
real-time bidding
0.912025
XCalBid: Robust and Efficient Real-Time Bidding Via Exploratory Pre-Training and Calibrated Q-Learning · ICDM 2025
Machine learning › Trustworthy machine learning
robustness
0.312026
Illusions of Confidence? Diagnosing LLM Truthfulness via Neighborhood Consistency · ACL (1) 2026

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

fine-tuning · 2.6soft actor-critic · 1.7pre-training · 1.7large language model probing · 1.0data augmentation · 0.9
YearPublicationVenuePosition
2026 Illusions of Confidence? Diagnosing LLM Truthfulness via Neighborhood Consistency
abstract
Haoming Xu, Ningyuan Zhao, Yunzhi Yao, Weihong Xu, Hongru Wang, Xinle Deng, Shumin Deng, Jeff Z. Pan, Huajun Chen, Ningyu Zhang. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Ningyuan Zhao, Yunzhi Yao, Hongru Wang 0003, Xinle Deng, Shumin Deng, Jeff Z. Pan, Huajun Chen, Ningyu Zhang 0001
ACL (1)2
2026 FacDNet: A low-rank factorized diffusion network with dual-U compensated attention for low-light enhancement
Peiguang Jing, Ningyuan Zhao, Lijun Lai, Weiming Wang 0002, Yuting Su 0001
Signal Process.3
2025 ReLearn: Unlearning via Learning for Large Language Models
abstract
Current unlearning methods for large language models usually rely on reverse optimization to reduce target token probabilities. However, this paradigm disrupts the subsequent tokens prediction, degrading model performance and linguistic coherence. Moreover, existing evaluation metrics overemphasize contextual forgetting while inadequately assessing response fluency and relevance. To address these challenges, we propose ReLearn, a data augmentation and fine-tuning pipeline for effective unlearning, along with a comprehensive evaluation framework. This framework introduces Knowledge Forgetting Ratio (KFR) and Knowledge Retention Ratio (KRR) to measure knowledge-level preservation, and Linguistic Score (LS) to evaluate generation quality. Our experiments show that ReLearn successfully achieves targeted forgetting while preserving high-quality outputs. Through mechanistic analysis, we further demonstrate how reverse optimization disrupts coherent text generation, while ReLearn preserves this essential capability.
Ningyuan Zhao, Sendong Zhao, Shumin Deng, Bryan Hooi, Nay Oo, Huajun Chen, Ningyu Zhang 0001
ACL (1)2
2025 XCalBid: Robust and Efficient Real-Time Bidding Via Exploratory Pre-Training and Calibrated Q-Learning
abstract
Real-Time Bidding (RTB) is a cornerstone of digital advertising, yet existing methods often struggle with slow convergence and poor adaptability in its dynamic, non-stationary environment. These challenges frequently arise from inefficient exploration and learning bidding strategies from scratch. To address this, we introduce eXploratory Calibrated Bidding (XCalBid), a novel three-step framework designed to accelerate learning and enhance performance. Our core innovation is a hybrid offlineonline approach that leverages a robust, pre-trained model to provide an effective initialization for online fine-tuning. XCalBid begins by collecting a diverse offline dataset using an exploratory bidding policy. This rich data then facilitates a two-phase pretraining regimen, which uses Soft Actor-Critic with Calibrated Q-Learning principles to learn a well-calibrated and robust value function. Finally, the pre-trained model is efficiently fine-tuned online, leveraging both historical and new experiences. Extensive experiments on the iPinYou dataset show that XCalBid achieves state-of-the-art performance, outperforming baselines in click maximization. It also demonstrates faster convergence, marking a leap in training efficiency for RTB systems. Our code is available at https://github.com/zhaoningyuan/XCalBid
Ningyuan Zhao
ICDM1
2025 RSDC-Net: Robust self-supervised dynamic collaboration network for infrared and visible image fusion
Yun Li 0006, Ningyuan Zhao, Peiguang Jing
Knowl. Based Syst.2