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

Chumeng Liang

dblp:330/5426 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
7since 2021 · last 2025
0000-0002-7074-4502ORCID · reported

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

Artificial intelligence and machine learning · 7 · 3 first-author · 7 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
7 papers
Generative modeling · 58% Reinforcement learning · 12% Trustworthy machine learning · 11%
Network and information security
4 papers
Security and privacy of machine learning · 88% Digital forensics and information hiding · 12%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%
Databases, data mining, and information retrieval
1 paper
Graph data management · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
2.752025
Toward effective protection against diffusion-based mimicry through score distillation · ICLR 2024
CGI-DM: Digital Copyright Authentication for Diffusion Models via Contrasting Gradient Inversion · CVPR 2024
Adversarial Example Does Good: Preventing Painting Imitation from Diffusion Models via Adversarial Examples · ICML 2023
Machine learning › Generative modeling
flow matching
0.912025
Online Reward-Weighted Fine-Tuning of Flow Matching with Wasserstein Regularization · ICLR 2025
Machine learning › Reinforcement learning
policy optimization
0.912025
Online Reward-Weighted Fine-Tuning of Flow Matching with Wasserstein Regularization · ICLR 2025
Machine learning › Transfer learning and domain adaptation › fine-tuning
regularization for fine-tuning
0.912025
Online Reward-Weighted Fine-Tuning of Flow Matching with Wasserstein Regularization · ICLR 2025
Machine learning › Generative modeling › diffusion model › diffusion model adaptation
reward fine-tuning
0.912025
Online Reward-Weighted Fine-Tuning of Flow Matching with Wasserstein Regularization · ICLR 2025
Natural language and speech › Language models and text generation
text generation evaluation
0.912025
Evaluating LLM-Generated Diagrams as Graphs · EMNLP 2025
Security and privacy of machine learning
adversarial attack
0.912025
Targeted Attack Improves Protection against Unauthorized Diffusion Customization · ICLR 2025
Security and privacy of machine learning › model intellectual property protection
diffusion model protection
0.912025
Targeted Attack Improves Protection against Unauthorized Diffusion Customization · ICLR 2025
Security and privacy of machine learning › adversarial attack
targeted attack
0.912025
Targeted Attack Improves Protection against Unauthorized Diffusion Customization · ICLR 2025
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.812024
Toward effective protection against diffusion-based mimicry through score distillation · ICLR 2024
Machine learning › Generative modeling › diffusion model
latent diffusion model
0.812024
Toward effective protection against diffusion-based mimicry through score distillation · ICLR 2024
Security and privacy of machine learning › generative model security
generative model misuse
0.812024
Toward effective protection against diffusion-based mimicry through score distillation · ICLR 2024
Smart cities and intelligent transportation
traffic control
0.712023
CBLab: Supporting the Training of Large-scale Traffic Control Policies with Scalable Traffic Simulation · KDD 2023
Smart cities and intelligent transportation › traffic modeling
traffic simulation
0.712023
CBLab: Supporting the Training of Large-scale Traffic Control Policies with Scalable Traffic Simulation · KDD 2023
Security and privacy of machine learning
adversarial example
0.712023
Adversarial Example Does Good: Preventing Painting Imitation from Diffusion Models via Adversarial Examples · ICML 2023
Digital forensics and information hiding
copyright protection
0.712023
Adversarial Example Does Good: Preventing Painting Imitation from Diffusion Models via Adversarial Examples · ICML 2023
Machine learning › Trustworthy machine learning
robustness
0.212024
Toward effective protection against diffusion-based mimicry through score distillation · ICLR 2024
Machine learning › Reinforcement learning
policy learning
0.212023
CBLab: Supporting the Training of Large-scale Traffic Control Policies with Scalable Traffic Simulation · KDD 2023

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

path alignment · 2.6node alignment · 2.6watermarking · 1.7adversarial attack · 1.7projected gradient descent · 1.5monte carlo sampling · 1.5gradient inversion · 1.5KL divergence · 1.5wasserstein-2 regularization · 0.9online reward weighting · 0.9score distillation sampling · 0.8calibrated perturbation · 0.8traffic simulation · 0.7monte-carlo estimation · 0.7adversarial examples · 0.7
YearPublicationVenuePosition
2025 Evaluating LLM-Generated Diagrams as Graphs
abstract
Diagrams play a central role in research papers for conveying ideas, yet they are often notoriously complex and labor-intensive to create.Although diagrams are presented as images, standard image generative models struggle to produce clear diagrams with well-defined structure.We argue that a promising direction is to generate demonstration diagrams directly in textual form as SVGs, which can leverage recent advances in large language models (LLMs).However, due to the complexity of components and the multimodal nature of diagrams, sufficiently discriminative and explainable metrics for evaluating the quality of LLM-generated diagrams remain lacking.In this paper, we propose DiagramEval, a novel evaluation metric designed to assess demonstration diagrams generated by LLMs.Specifically, DiagramEval conceptualizes diagrams as graphs, treating text elements as nodes and their connections as directed edges, and evaluates diagram quality using two new groups of metrics: node alignment and path alignment.For the first time, we effectively evaluate diagrams produced by stateof-the-art LLMs on recent research literature, quantitatively demonstrating the validity of our metrics.Furthermore, we show how the enhanced explainability of our proposed metrics offers valuable insights into the characteristics of LLM-generated diagrams.Code
Chumeng Liang, Jiaxuan You
EMNLP1
2025 Online Reward-Weighted Fine-Tuning of Flow Matching with Wasserstein Regularization
abstract
Recent advancements in reinforcement learning (RL) have achieved great success in fine-tuning diffusion-based generative models. However, fine-tuning continuous flow-based generative models to align with arbitrary user-defined reward functions remains challenging, particularly due to issues such as policy collapse from overoptimization and the prohibitively high computational cost of likelihoods in continuous-time flows. In this paper, we propose an easy-to-use and theoretically sound RL fine-tuning method, which we term Online Reward-Weighted Conditional Flow Matching with Wasserstein-2 Regularization (ORW-CFM-W2). Our method integrates RL into the flow matching framework to fine-tune generative models with arbitrary reward functions, without relying on gradients of rewards or filtered datasets. By introducing an online reward-weighting mechanism, our approach guides the model to prioritize high-reward regions in the data manifold. To prevent policy collapse and maintain diversity, we incorporate Wasserstein-2 (W2) distance regularization into our method and derive a tractable upper bound for it in flow matching, effectively balancing exploration and exploitation of policy optimization. We provide theoretical analyses to demonstrate the convergence properties and induced data distributions of our method, establishing connections with traditional RL algorithms featuring Kullback-Leibler (KL) regularization and offering a more comprehensive understanding of the underlying mechanisms and learning behavior of our approach. Extensive experiments on tasks including target image generation, image compression, and text-image alignment demonstrate the effectiveness of our method, where our method achieves optimal policy convergence while allowing controllable trade-offs between reward maximization and diversity preservation.
Jiajun Fan, Shuaike Shen, Chaoran Cheng, Chumeng Liang
ICLR5
2025 Targeted Attack Improves Protection against Unauthorized Diffusion Customization
abstract
Diffusion models build a new milestone for image generation yet raising public concerns, for they can be fine-tuned on unauthorized images for customization. Protection based on adversarial attacks rises to encounter this unauthorized diffusion customization, by adding protective watermarks to images and poisoning diffusion models. However, current protection, leveraging untargeted attacks, does not appear to be effective enough. In this paper, we propose a simple yet effective improvement for the protection against unauthorized diffusion customization by introducing targeted attacks. We show that by carefully selecting the target, targeted attacks significantly outperform untargeted attacks in poisoning diffusion models and degrading the customization image quality. Extensive experiments validate the superiority of our method on two mainstream customization methods of diffusion models, compared to existing protections. To explain the surprising success of targeted attacks, we delve into the mechanism of attack-based protections and propose a hypothesis based on our observation, which enhances the comprehension of attack-based protections. To the best of our knowledge, we are the first to both reveal the vulnerability of diffusion models to targeted attacks and leverage targeted attacks to enhance protection against unauthorized diffusion customization.
Boyang Zheng, Chumeng Liang
ICLR2
2024 CGI-DM: Digital Copyright Authentication for Diffusion Models via Contrasting Gradient Inversion
abstract
Diffusion Models (DMs) have evolved into advanced image generation tools, especially for few-shot generation where a pretrained model is fine-tuned on a small set of images to capture a specific style or object. Despite their success, concerns exist about potential copyright violations stemming from the use of unauthorized data in this process. In response, we present Contrasting Gradient Inversion for Diffusion Models (CGI-DM), a novel method featuring vivid visual representations for digital copyright authentication. Our approach involves removing partial information of an image and recovering missing details by exploiting conceptual differences between the pretrained and fine-tuned models. We formulate the differences as KL divergence between latent variables of the two models when given the same input image, which can be maximized through Monte Carlo sampling and Projected Gradient Descent (PGD). The similarity between original and recovered images serves as a strong indicator of potential infringements. Extensive experiments on the WikiArt and Dream-booth datasets demonstrate the high accuracy of CGI-DM in digital copyright authentication, surpassing alternative validation techniques. Code implementation is available at https://github.com/Nicholas0228/Revelio.
Yang Hua 0001, Chumeng Liang, Jiaru Zhang, Hao Wang 0022, Tao Song 0003, Haibing Guan
CVPR3
2024 Toward effective protection against diffusion-based mimicry through score distillation
abstract
While generative diffusion models excel in producing high-quality images, they can also be misused to mimic authorized images, posing a significant threat to AI systems. Efforts have been made to add calibrated perturbations to protect images from diffusion-based mimicry pipelines. However, most of the existing methods are too ineffective and even impractical to be used by individual users due to their high computation and memory requirements. In this work, we present novel findings on attacking latent diffusion models (LDM) and propose new plug-and-play strategies for more effective protection. In particular, we explore the bottleneck in attacking an LDM, discovering that the encoder module rather than the denoiser module is the vulnerable point. Based on this insight, we present our strategy using Score Distillation Sampling (SDS) to double the speed of protection and reduce memory occupation by half without compromising its strength. Additionally, we provide a robust protection strategy by counterintuitively minimizing the semantic loss, which can assist in generating more natural perturbations. Finally, we conduct extensive experiments to substantiate our findings and comprehensively evaluate our newly proposed strategies. We hope our insights and protective measures can contribute to better defense against malicious diffusion-based mimicry, advancing the development of secure AI systems.
Haotian Xue 0002, Chumeng Liang
ICLR2
2023 Adversarial Example Does Good: Preventing Painting Imitation from Diffusion Models via Adversarial Examples
abstract
Recently, Diffusion Models (DMs) boost a wave in AI for Art yet raise new copyright concerns, where infringers benefit from using unauthorized paintings to train DMs and generate novel paintings in a similar style. To address these emerging copyright violations, in this paper, we are the first to explore and propose to utilize adversarial examples for DMs to protect human-created artworks. Specifically, we first build a theoretical framework to define and evaluate the adversarial examples for DMs. Then, based on this framework, we design a novel algorithm to generate these adversarial examples, named AdvDM, which exploits a Monte-Carlo estimation of adversarial examples for DMs by optimizing upon different latent variables sampled from the reverse process of DMs. Extensive experiments show that the generated adversarial examples can effectively hinder DMs from extracting their features. Therefore, our method can be a powerful tool for human artists to protect their copyright against infringers equipped with DM-based AI-for-Art applications. The code of our method is available on GitHub: https://github.com/mist-project/mist.git.
Chumeng Liang, Yang Hua 0001, Jiaru Zhang, Yiming Xue, Tao Song 0003, Zhengui Xue, Ruhui Ma, Haibing Guan
ICML1
2023 CBLab: Supporting the Training of Large-scale Traffic Control Policies with Scalable Traffic Simulation
abstract
Traffic simulation provides interactive data for the optimization of traffic control policies. However, existing traffic simulators are limited by their lack of scalability and shortage in input data, which prevents them from generating interactive data from traffic simulation in the scenarios of real large-scale city road networks.
Chumeng Liang, Zherui Huang, Zhanyu Liu, Guanjie Zheng, Hanyuan Shi, Fuliang Li, Zhenhui Jessie Li
KDD1