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

Yurui Chang

dblp:296/1044 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0002-0204-021XORCID · reported

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 69% Graph learning · 16% Generative modeling · 15%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.622025
JoPA: Explaining Large Language Model's Generation via Joint Prompt Attribution · ACL (1) 2025
Globally Interpretable Graph Learning via Distribution Matching · WWW 2024
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation
0.912025
JoPA: Explaining Large Language Model's Generation via Joint Prompt Attribution · ACL (1) 2025
Machine learning › Generative modeling
diffusion model
0.912025
AdvI2I: Adversarial Image Attack on Image-to-Image Diffusion Models · ICML 2025
Machine learning › Trustworthy machine learning › language model interpretability
large language model interpretation
0.912025
JoPA: Explaining Large Language Model's Generation via Joint Prompt Attribution · ACL (1) 2025
Security and privacy of machine learning › adversarial attack
adversarial attacks on generative models
0.912025
AdvI2I: Adversarial Image Attack on Image-to-Image Diffusion Models · ICML 2025
Machine learning › Trustworthy machine learning › interpretability › model explanation
global explanation
0.812024
Globally Interpretable Graph Learning via Distribution Matching · WWW 2024
Machine learning › Graph learning
graph neural network
0.812024
Globally Interpretable Graph Learning via Distribution Matching · WWW 2024
Machine learning › Graph learning
graph classification
0.212024
Globally Interpretable Graph Learning via Distribution Matching · WWW 2024

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

generator training · 1.7adversarial optimization · 1.7probabilistic search · 0.9combinatorial optimization · 0.9distribution matching · 0.8
YearPublicationVenuePosition
2025 JoPA: Explaining Large Language Model's Generation via Joint Prompt Attribution
abstract
Large Language Models (LLMs) have demonstrated impressive performances in complex text generation tasks.However, the contribution of the input prompt to the generated content still remains obscure to humans, underscoring the necessity of understanding the causality between input and output pairs.Existing works for providing prompt-specific explanation often confine model output to be classification or next-word prediction.Few initial attempts aiming to explain the entire language generation often treat input prompt texts independently, ignoring their combinatorial effects on the followup generation.In this study, we introduce a counterfactual explanation framework based on Joint Prompt Attribution, JoPA, which aims to explain how a few prompt texts collaboratively influences the LLM's complete generation.Particularly, we formulate the task of prompt attribution for generation interpretation as a combinatorial optimization problem, and introduce a probabilistic algorithm to search for the casual input combination in the discrete space.We define and utilize multiple metrics to evaluate the produced explanations, demonstrating both the faithfulness and efficiency of our framework.
Yurui Chang, Bochuan Cao, Lu Lin 0001
ACL (1)1
2025 AdvI2I: Adversarial Image Attack on Image-to-Image Diffusion Models
abstract
Recent advances in diffusion models have significantly enhanced the quality of image synthesis, yet they have also introduced serious safety concerns, particularly the generation of Not Safe for Work (NSFW) content. Previous research has demonstrated that adversarial prompts can be used to generate NSFW content. However, such adversarial text prompts are often easily detectable by text-based filters, limiting their efficacy. In this paper, we expose a previously overlooked vulnerability: adversarial image attacks targeting Image-to-Image (I2I) diffusion models. We propose AdvI2I, a novel framework that manipulates input images to induce diffusion models to generate NSFW content. By optimizing a generator to craft adversarial images, AdvI2I circumvents existing defense mechanisms, such as Safe Latent Diffusion (SLD), without altering the text prompts. Furthermore, we introduce AdvI2I-Adaptive, an enhanced version that adapts to potential countermeasures and minimizes the resemblance between adversarial images and NSFW concept embeddings, making the attack more resilient against defenses. Through extensive experiments, we demonstrate that both AdvI2I and AdvI2I-Adaptive can effectively bypass current safeguards, highlighting the urgent need for stronger security measures to address the misuse of I2I diffusion models.
Yaopei Zeng, Yuanpu Cao, Bochuan Cao, Yurui Chang, Lu Lin 0001
ICML4
2024 Globally Interpretable Graph Learning via Distribution Matching
abstract
Graph neural networks (GNNs) have emerged as a powerful model to capture critical graph patterns. Instead of treating them as black boxes in an end-to-end fashion, attempts are arising to explain the model behavior. Existing works mainly focus on local interpretation to reveal the discriminative pattern for each individual instance, which however cannot directly reflect the high-level model behavior across instances. To gain global insights, we aim to answer an important question that is not yet well studied: how to provide a global interpretation for the graph learning procedure? We formulate this problem as globally interpretable graph learning, which targets on distilling high-level and human-intelligible patterns that dominate the learning procedure, such that training on this pattern can recover a similar model. As a start, we propose a novel model fidelity metric, tailored for evaluating the fidelity of the resulting model trained on interpretations. Our preliminary analysis shows that interpretative patterns generated by existing global methods fail to recover the model training procedure. Thus, we further propose our solution, Graph Distribution Matching (GDM), which synthesizes interpretive graphs by matching the distribution of the original and interpretive graphs in the GNN's feature space as its training proceeds, thus capturing the most informative patterns the model learns during training. Extensive experiments on graph classification datasets demonstrate multiple advantages of the proposed method, including high model fidelity, predictive accuracy and time efficiency, as well as the ability to reveal class-relevant structure.
Yi Nian, Yurui Chang, Wei Jin 0009, Lu Lin 0001
WWW2