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

Ganggui Ding

dblp:378/1612 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 1 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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 graphics and multimedia
3 papers
Visual content generation and editing · 100%
Artificial intelligence
3 papers
Efficient and distributed learning · 50% Language models and text generation · 25% Generative modeling · 19%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.012026
FreerCustom: Training-Free Multi-Concept Customization for Image and Video Generation · Int. J. Comput. Vis. 2026
Natural language and speech › Language models and text generation
inference-time intervention
1.012026
Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention · ACL (1) 2026
Visual content generation and editing
image and video generation
1.012026
FreerCustom: Training-Free Multi-Concept Customization for Image and Video Generation · Int. J. Comput. Vis. 2026
Visual content generation and editing › image generation › image customization
multi-concept customization
1.012026
FreerCustom: Training-Free Multi-Concept Customization for Image and Video Generation · Int. J. Comput. Vis. 2026
Machine learning › Efficient and distributed learning › model merging
expert merging
0.912025
Channel Merging: Preserving Specialization for Merged Experts · AAAI 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Channel Merging: Preserving Specialization for Merged Experts · AAAI 2025
Machine learning › Efficient and distributed learning
model merging
0.912025
Channel Merging: Preserving Specialization for Merged Experts · AAAI 2025
Visual content generation and editing › image editing
diffusion-based image editing
0.812024
Object-Aware Inversion and Reassembly for Image Editing · ICLR 2024
Visual content generation and editing
image editing
0.812024
Object-Aware Inversion and Reassembly for Image Editing · ICLR 2024
Visual content generation and editing › image generation
personalized image generation
0.812024
FreeCustom: Tuning-Free Customized Image Generation for Multi-Concept Composition · CVPR 2024
Visual content generation and editing › image editing
text-guided image editing
0.812024
Object-Aware Inversion and Reassembly for Image Editing · ICLR 2024
Visual content generation and editing › image generation
text-to-image generation
0.812024
FreeCustom: Tuning-Free Customized Image Generation for Multi-Concept Composition · CVPR 2024
Natural language and speech › Language models and text generation › large language model inference
inference-time computation
0.312026
Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention · ACL (1) 2026
Machine learning › Transfer learning and domain adaptation › fine-tuning
task-specific fine-tuning
0.312025
Channel Merging: Preserving Specialization for Merged Experts · AAAI 2025

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

diffusion model · 2.8training-free customization · 2.0minimal test-time intervention · 1.0large language model reasoning · 1.0task-specific router · 0.9channel clustering · 0.9weighted mask strategy · 0.8multi-reference self-attention · 0.8inversion and reassembly · 0.8
YearPublicationVenuePosition
2026 Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention
abstract
Zhen Yang, Mingyang Zhang, Feng Chen, Ganggui Ding, Liang Hou, Xin Tao, Ying-Cong Chen. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Ganggui Ding, Xin Tao 0001, Ying-Cong Chen
ACL (1)4
2026 FreerCustom: Training-Free Multi-Concept Customization for Image and Video Generation
Canyu Zhao, Ganggui Ding, Wen Wang 0015, Zhen Yang 0009, Zide Liu, Hao Chen 0041, Chunhua Shen
Int. J. Comput. Vis.2
2025 Channel Merging: Preserving Specialization for Merged Experts
abstract
Lately, the practice of utilizing task-specific fine-tuning has been implemented to improve the performance of large language models (LLM) in subsequent tasks. Through the integration of diverse LLMs, the overall competency of LLMs is significantly boosted. Nevertheless, traditional ensemble methods are notably memory-intensive, necessitating the simultaneous loading of all specialized models into GPU memory. To address the inefficiency, model merging strategies have emerged, merging all LLMs into one model to reduce the memory footprint during inference. Despite these advances, model merging often leads to parameter conflicts and performance decline as the number of experts increases. Previous methods to mitigate these conflicts include post-pruning and partial merging. However, both approaches have limitations, particularly in terms of performance and storage efficiency when merged experts increase. To address these challenges, we introduce Channel Merging, a novel strategy designed to minimize parameter conflicts while enhancing storage efficiency. This method initially clusters and merges channel parameters based on their similarity to form several groups offline. By ensuring that only highly similar parameters are merged within each group, it significantly reduces parameter conflicts. During inference, we can instantly look up the expert parameters from the merged groups, preserving specialized knowledge. Our experiments demonstrate that Channel Merging consistently delivers high performance, matching unmerged models in tasks like English and Chinese reasoning, mathematical reasoning, and code generation. Moreover, it obtains results comparable to model ensemble with just 53% parameters when used with a task-specific router.
Mingyang Zhang 0007, Jing Liu 0048, Ganggui Ding, Linlin Ou, Bohan Zhuang
AAAI3
2024 FreeCustom: Tuning-Free Customized Image Generation for Multi-Concept Composition
abstract
Benefiting from large-scale pre-trained text-to-image (T2I) generative models, impressive progress has been achieved in customized image generation, which aims to generate user-specified concepts. Existing approaches have extensively focused on single-concept customization and still encounter challenges when it comes to complex scenarios that involve combining multiple concepts. These approaches often require retraining/fine-tuning using a few images, leading to time-consuming training processes and impeding their swift implementation. Furthermore, the reliance on multiple images to represent a singular concept increases the difficulty of customization. To this end, we propose FreeCustom, a novel tuning-free method to generate customized images of multi-concept composition based on reference concepts, using only one image per concept as input. Specifically, we introduce a new multi-reference self-attention (MRSA) mechanism and a weighted mask strategy that enables the generated image to access and focus more on the reference concepts. In addition, MRSA leverages our key finding that input concepts are better preserved when providing images with context interactions. Experiments show that our method's produced images are consistent with the given concepts and better aligned with the input text. Our method outperforms or performs on par with other training-based methods in terms of multi-concept composition and single-concept customization, but is simpler. Codes can be found here.
Ganggui Ding, Canyu Zhao, Wen Wang 0015, Zhen Yang 0009, Zide Liu, Hao Chen 0041, Chunhua Shen
CVPR1
2024 Object-Aware Inversion and Reassembly for Image Editing
abstract
Diffusion-based image editing methods have achieved remarkable advances in text-driven image editing. The editing task aims to convert an input image with the original text prompt into the desired image that is well-aligned with the target text prompt. By comparing the original and target prompts, we can obtain numerous editing pairs, each comprising an object and its corresponding editing target. To allow editability while maintaining fidelity to the input image, existing editing methods typically involve a fixed number of inversion steps that project the whole input image to its noisier latent representation, followed by a denoising process guided by the target prompt. However, we find that the optimal number of inversion steps for achieving ideal editing results varies significantly among different editing pairs, owing to varying editing difficulties. Therefore, the current literature, which relies on a fixed number of inversion steps, produces sub-optimal generation quality, especially when handling multiple editing pairs in a natural image. To this end, we propose a new image editing paradigm, dubbed Object-aware Inversion and Reassembly (OIR), to enable object-level fine-grained editing. Specifically, we design a new search metric, which determines the optimal inversion steps for each editing pair, by jointly considering the editability of the target and the fidelity of the non-editing region. We use our search metric to find the optimal inversion step for each editing pair when editing an image. We then edit these editing pairs separately to avoid \concept. Subsequently, we propose an additional reassembly step to seamlessly integrate the respective editing results and the non-editing region to obtain the final edited image. To systematically evaluate the effectiveness of our method, we collect two datasets called OIRBench for benchmarking single- and multi-object editing, respectively. Experiments demonstrate that our method achieves superior performance in editing object shapes, colors, materials, categories, \textit{etc.}, especially in multi-object editing scenarios. The project page can be found in https://aim-uofa.github.io/OIR-Diffusion/.
Zhen Yang 0009, Ganggui Ding, Wen Wang 0015, Hao Chen 0041, Bohan Zhuang, Chunhua Shen
ICLR2
2024 Unveiling Universal Forensics of Diffusion Models with Adversarial Perturbations
abstract
With state-of-the-art performance in image synthesis especially in text-to-image generation, diffusion models (DMs) have received unprecedented attention. Despite promising application prospects, fake images generated from diffusion models are causing potential security concerns. To this end, in this work, we aim to investigate whether the generated images of DMs are different from other generated models e.g. generative adversarial networks (GANs) and whether a universal forensic classifier exists. To perform this work, we first collected a dataset consisting of 409k fake images generated from different types of DMs. Through a comprehensive analysis on this benchmark, we showcased that common forensic artifacts are shared among DMs and a forensic classifier trained for one model can generalize well for other agnostic generative models. Specifically, we first demonstrated that despite photorealism of the images generated by DMs, they still contain artifacts namely non-robust visual features which are hard for human but easy for machine to recognize. Then we studied the characteristics of the artifacts from the view of adversarial attack and unexpectedly found there exists a universal adversarial perturbation to fool the classifier. Furthermore, we devised visualization and analysis tools focusing on the spectral properties of the generated samples and adversarial features which demonstrates augmentations in the frequency domain greatly affect the performance of the detectors.
Kangyang Xie, Jiaan Liu, Muzhi Zhu, Ganggui Ding, Zide Liu, Hao Chen 0041, Hangyue Chen
IJCNN4