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

Xianghuan He

dblp:336/0559 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0007-3962-4549ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 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
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.812024
Improving Network Interpretability via Explanation Consistency Evaluation · IEEE Trans. Multim. 2024
Machine learning › Trustworthy machine learning › language model interpretability
explanation consistency
0.812024
Improving Network Interpretability via Explanation Consistency Evaluation · IEEE Trans. Multim. 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Improving Network Interpretability via Explanation Consistency Evaluation · IEEE Trans. Multim. 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Improving Network Interpretability via Explanation Consistency Evaluation · IEEE Trans. Multim. 2024

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

sample reweighting · 0.8explanation heatmaps · 0.8adversarial perturbation · 0.8
YearPublicationVenuePosition
2026 Flareon: Stealthy All2all Backdoor Injection via Poisoned Augmentation
abstract
Open source software supply-chain attacks, once successful, can exact heavy costs in mission-critical applications. As open source ecosystems for deep learning flourish and become increasingly universal, they present attackers previously unexplored avenues to code-inject malicious backdoors in deep neural network models. This article proposes Flareon , a small, stealthy, seemingly harmless code modification that specifically targets the data augmentation pipeline with motion-based triggers. Flareon neither alters ground-truth labels, nor modifies the training loss objective, nor does it assume prior knowledge of the victim model architecture, training data, and training hyperparameters. Yet, it has a surprisingly large ramification on training—models trained under Flareon learn powerful target-conditioned (or “ all2all ”) backdoors. We also proposed a learnable variant of Flareon that is even stealthier in terms of added perturbations. The resulting models can exhibit high attack success rates for any target choices and better clean accuracies than backdoor attacks that not only seize greater control but also assume more restrictive attack capabilities. We also demonstrate the resilience of Flareon against a wide range of defenses. Flareon is fully open source and available online to the deep learning community.
Tianrui Qin, Xuan Wang 0029, Xianghuan He, Kejiang Ye, Cheng-Zhong Xu 0001
ACM Trans. Knowl. Discov. Data3
2024 Improving Network Interpretability via Explanation Consistency Evaluation
abstract
While deep neural networks have achieved remarkable performance, they tend to lack transparency in prediction. The pursuit of greater interpretability in neural networks often results in a degradation of their original performance. Some works strive to improve both interpretability and performance, but they primarily depend on meticulously imposed conditions. In this paper, we propose a simple yet effective framework that acquires more explainable activation heatmaps and simultaneously increases the model performance, without the need for any extra supervision. Specifically, our concise framework introduces a new metric, i.e., explanation consistency, to reweight the training samples adaptively in model learning. The explanation consistency metric is utilized to measure the similarity between the model's visual explanations of the original samples and those of semantic-preserved adversarial samples, whose background regions are perturbed by using image adversarial attack techniques. Our framework then promotes the model learning by paying closer attention to those training samples with a high difference in explanations (i.e., low explanation consistency), for which the current model cannot provide robust interpretations. Comprehensive experimental results on various benchmarks demonstrate the superiority of our framework in multiple aspects, including higher recognition accuracy, greater data debiasing capability, stronger network robustness, and more precise localization ability on both regular networks and interpretable networks. We also provide extensive ablation studies and qualitative analyses to unveil the detailed contribution of each component.
Hefeng Wu, Keze Wang, Xianghuan He, Liang Lin 0004
IEEE Trans. Multim.5