Demo Data from VLDB 2026 / reviewers in the wild / expert
Qi Tian 0003
dblp:78/1467-3
· DBLP profile ↗
7ranked-venue papers
3as first author
7since 2021 · last 2025
0000-0001-8389-5484ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
6 papers |
Efficient and distributed learning · 25% Transfer learning and domain adaptation · 19% Generative modeling · 18% | |
| Computer graphics and multimedia
1 paper |
Computer animation and physical simulation · 44% Visual content generation and editing · 44% Image and video processing · 13% | |
| Network and information security
1 paper |
Privacy and data protection · 50% Security and privacy of machine learning · 50% |
Topics — the 19 heaviest of 22, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | Infinite-Canvas: Higher-Resolution Video Outpainting with Extensive Content Generation · AAAI 2025 |
Machine learning › Transfer learning and domain adaptation
domain shift |
0.9 | 1 | 2025 | Tackling Device Data Distribution Real-time Shift via Prototype-based Parameter Editing · ACM Multimedia 2025 |
Machine learning › Generative modeling › video generation
high-resolution video generation |
0.9 | 1 | 2025 | Infinite-Canvas: Higher-Resolution Video Outpainting with Extensive Content Generation · AAAI 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge engineering
knowledge integration |
0.9 | 1 | 2025 | Optimize Incompatible Parameters Through Compatibility-aware Knowledge Integration · AAAI 2025 |
Machine learning › Efficient and distributed learning
model merging |
0.9 | 1 | 2025 | Optimize Incompatible Parameters Through Compatibility-aware Knowledge Integration · AAAI 2025 |
Machine learning › Efficient and distributed learning › edge computing › on-device machine learning
on-device learning |
0.9 | 1 | 2025 | Tackling Device Data Distribution Real-time Shift via Prototype-based Parameter Editing · ACM Multimedia 2025 |
Machine learning › Transfer learning and domain adaptation
test-time adaptation |
0.9 | 1 | 2025 | Tackling Device Data Distribution Real-time Shift via Prototype-based Parameter Editing · ACM Multimedia 2025 |
Computer animation and physical simulation › character animation
multi-character animation |
0.9 | 1 | 2025 | Towards Multiple Character Image Animation Through Enhancing Implicit Decoupling · ICLR 2025 |
Machine learning › Reinforcement learning › multi-agent reinforcement learning
offline multi-agent reinforcement learning |
0.7 | 1 | 2023 | Learning from Good Trajectories in Offline Multi-Agent Reinforcement Learning · AAAI 2023 |
Privacy and data protection
data privacy protection |
0.6 | 1 | 2022 | ConfounderGAN: Protecting Image Data Privacy with Causal Confounder · NeurIPS 2022 |
Security and privacy of machine learning › poisoning attack
unlearnable examples |
0.6 | 1 | 2022 | ConfounderGAN: Protecting Image Data Privacy with Causal Confounder · NeurIPS 2022 |
Machine learning › Trustworthy machine learning › robustness
adversarial attack |
0.5 | 1 | 2021 | Analysis and Applications of Class-wise Robustness in Adversarial Training · KDD 2021 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training |
0.5 | 1 | 2021 | Analysis and Applications of Class-wise Robustness in Adversarial Training · KDD 2021 |
Machine learning › Trustworthy machine learning
robustness |
0.5 | 1 | 2021 | Analysis and Applications of Class-wise Robustness in Adversarial Training · KDD 2021 |
Machine learning › Transfer learning and domain adaptation › pre-training and adaptation
pretrained model reuse |
0.3 | 1 | 2025 | Optimize Incompatible Parameters Through Compatibility-aware Knowledge Integration · AAAI 2025 |
Image and video processing › motion estimation
optical flow |
0.3 | 1 | 2025 | Towards Multiple Character Image Animation Through Enhancing Implicit Decoupling · ICLR 2025 |
Machine learning › Reinforcement learning
offline reinforcement learning |
0.2 | 1 | 2023 | Learning from Good Trajectories in Offline Multi-Agent Reinforcement Learning · AAAI 2023 |
Machine learning › Generative modeling
generative adversarial network |
0.2 | 1 | 2022 | ConfounderGAN: Protecting Image Data Privacy with Causal Confounder · NeurIPS 2022 |
Computer vision › Image recognition and object detection › image classification
image classification robustness |
0.1 | 1 | 2021 | Analysis and Applications of Class-wise Robustness in Adversarial Training · KDD 2021 |
Methods — techniques the papers use, named apart from their topics
spatial window merging · 0.9reference pose map · 0.9prototype-based parameter editing · 0.9positional relation injection · 0.9parameter splicing · 0.9parameter compatibility assessment · 0.9optical flow guidance · 0.9neural adapter · 0.9depth order guidance · 0.9backpropagation-free adaptation · 0.9graph attention network · 0.7differentiable key-value memory · 0.7attention-based reward decomposition · 0.7noise generation · 0.6generative adversarial network · 0.6confounder property · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Infinite-Canvas: Higher-Resolution Video Outpainting with Extensive Content GenerationabstractThis paper explores higher-resolution video outpainting with extensive content generation. We point out common issues faced by existing methods when attempting to largely outpaint videos: the generation of low-quality content and limitations imposed by GPU memory. To address these challenges, we propose a diffusion-based method called Infinite-Canvas. It builds upon two core designs. First, instead of employing the common practice of "single-shot" outpainting, we distribute the task across spatial windows and seamlessly merge them. It allows us to outpaint videos of any size and resolution without being constrained by GPU memory. Second, the source video and its relative positional relation are injected into the generation process of each window. It makes the generated spatial layout within each window harmonize with the source video. Coupling with these two designs enables us to generate higher-resolution outpainting videos with rich content while keeping spatial and temporal consistency. Infinite-Canvas excels in large-scale video outpainting, e.g., from 512 × 512 to 1152 × 2048 (9×), while producing high-quality and aesthetically pleasing results. It achieves the best quantitative results across various resolution and scale setups. The code is available at https://github.com/mayuelala/FollowYourCanvas. Qihua Chen, Yue Ma 0016, Hongfa Wang, Junkun Yuan, Qi Tian 0003, Shaobo Min, Qifeng Chen 0001, Wei Liu 0005 |
AAAI | 6 |
| 2025 | Optimize Incompatible Parameters Through Compatibility-aware Knowledge IntegrationabstractDeep neural networks have become foundational to advancements in multiple domains, including recommendation systems, natural language processing, and so on. Despite their successes, these models often contain incompatible parameters that can be underutilized or detrimental to model performance, particularly when faced with specific, varying data distributions. Existing research excels in removing such parameters or merging the outputs of multiple different pretrained models. However, the former focuses on efficiency rather than performance, while the latter requires several times more computing and storage resources to support inference. In this paper, we set the goal to explicitly improve these incompatible parameters by leveraging the complementary strengths of different models, thereby directly enhancing the models without any additional parameters. Specifically, we propose Compatibility-aware Knowledge Integration (CKI), which consists of Parameter Compatibility Assessment and Parameter Splicing, which are used to evaluate the knowledge content of multiple models and integrate the knowledge into one model, respectively. The integrated model can be used directly for inference or for further fine-tuning. Extensive experiments on various recommendation and language datasets show that CKI can effectively optimize incompatible parameters under multiple tasks and settings to break through the training limit of the original model without increasing the inference cost. Zheqi Lv, Keming Ye, Zishu Wei, Qi Tian 0003, Shengyu Zhang 0001, Wenqiao Zhang, Wenjie Wang 0007, Kun Kuang 0001, Tat-Seng Chua, Fei Wu 0001 |
AAAI | 4 |
| 2025 | Towards Multiple Character Image Animation Through Enhancing Implicit DecouplingabstractControllable character image animation has a wide range of applications. Although existing studies have consistently improved performance, challenges persist in the field of character image animation, particularly concerning stability in complex backgrounds and tasks involving multiple characters. To address these challenges, we propose a novel multi-condition guided framework for character image animation, employing several well-designed input modules to enhance the implicit decoupling capability of the model. First, the optical flow guider calculates the background optical flow map as guidance information, which enables the model to implicitly learn to decouple the background motion into background constants and background momentum during training, and generate a stable background by setting zero background momentum during inference. Second, the depth order guider calculates the order map of the characters, which transforms the depth information into the positional information of multiple characters. This facilitates the implicit learning of decoupling different characters, especially in accurately separating the occluded body parts of multiple characters. Third, the reference pose map is input to enhance the ability to decouple character texture and pose information in the reference image. Furthermore, to fill the gap of fair evaluation of multi-character image animation, we propose a new benchmark comprising about 4,000 frames. Extensive qualitative and quantitative evaluations demonstrate that our method excels in generating high-quality character animations, especially in scenarios of complex backgrounds and multiple characters. Jingyun Xue, Hongfa Wang, Qi Tian 0003, Yue Ma 0016, Andong Wang, Zhiyuan Zhao 0002, Shaobo Min, Kaihao Zhang, Harry Shum, Wei Liu 0005, Mengyang Liu, Wenhan Luo |
ICLR | 3 |
| 2025 | Tackling Device Data Distribution Real-time Shift via Prototype-based Parameter EditingabstractThe on-device real-time data distribution shift on devices challenges the generalization of lightweight on-device models. This critical issue is often overlooked in current research, which predominantly relies on data-intensive and computationally expensive fine-tuning approaches. To tackle this, we introduce Persona, a novel personalized method using a prototype-based, backpropagation-free parameter editing framework to enhance model generalization without post-deployment retraining. Persona employs a neural adapter in the cloud to generate a parameter editing matrix based on real-time device data. This matrix adeptly adapts on-device models to the prevailing data distributions, efficiently clustering them into prototype models. The prototypes are dynamically refined via the parameter editing matrix, facilitating efficient evolution. Furthermore, the integration of cross-layer knowledge transfer ensures consistent and context-aware multi-layer parameter changes and prototype assignment. Extensive experiments on vision task and recommendation task on multiple datasets confirm Persona's effectiveness and generality. Zheqi Lv, Wenqiao Zhang, Kairui Fu, Qi Tian 0003, Shengyu Zhang 0001, Jiajie Su, Jingyuan Chen 0003, Kun Kuang 0001, Fei Wu 0001 |
ACM Multimedia | 4 |
| 2023 | Learning from Good Trajectories in Offline Multi-Agent Reinforcement LearningabstractOffline multi-agent reinforcement learning (MARL) aims to learn effective multi-agent policies from pre-collected datasets, which is an important step toward the deployment of multi-agent systems in real-world applications. However, in practice, each individual behavior policy that generates multi-agent joint trajectories usually has a different level of how well it performs. e.g., an agent is a random policy while other agents are medium policies. In the cooperative game with global reward, one agent learned by existing offline MARL often inherits this random policy, jeopardizing the utility of the entire team. In this paper, we investigate offline MARL with explicit consideration on the diversity of agent-wise trajectories and propose a novel framework called Shared Individual Trajectories (SIT) to address this problem. Specifically, an attention-based reward decomposition network assigns the credit to each agent through a differentiable key-value memory mechanism in an offline manner. These decomposed credits are then used to reconstruct the joint offline datasets into prioritized experience replay with individual trajectories, thereafter agents can share their good trajectories and conservatively train their policies with a graph attention network (GAT) based critic. We evaluate our method in both discrete control (i.e., StarCraft II and multi-agent particle environment) and continuous control (i.e., multi-agent mujoco). The results indicate that our method achieves significantly better results in complex and mixed offline multi-agent datasets, especially when the difference of data quality between individual trajectories is large. Qi Tian 0003, Kun Kuang 0001, Furui Liu, Baoxiang Wang 0001 |
AAAI | 1 |
| 2022 | ConfounderGAN: Protecting Image Data Privacy with Causal ConfounderabstractThe success of deep learning is partly attributed to the availability of massive data downloaded freely from the Internet. However, it also means that users' private data may be collected by commercial organizations without consent and used to train their models. Therefore, it's important and necessary to develop a method or tool to prevent unauthorized data exploitation. In this paper, we propose ConfounderGAN, a generative adversarial network (GAN) that can make personal image data unlearnable to protect the data privacy of its owners. Specifically, the noise produced by the generator for each image has the confounder property. It can build spurious correlations between images and labels, so that the model cannot learn the correct mapping from images to labels in this noise-added dataset. Meanwhile, the discriminator is used to ensure that the generated noise is small and imperceptible, thereby remaining the normal utility of the encrypted image for humans. The experiments are conducted in six image classification datasets, including three natural object datasets and three medical datasets. The results demonstrate that our method not only outperforms state-of-the-art methods in standard settings, but can also be applied to fast encryption scenarios. Moreover, we show a series of transferability and stability experiments to further illustrate the effectiveness and superiority of our method. Qi Tian 0003, Kun Kuang 0001, Kelu Jiang, Furui Liu, Zhihua Wang 0008, Fei Wu 0001 |
NeurIPS | 1 |
| 2021 | Analysis and Applications of Class-wise Robustness in Adversarial TrainingabstractAdversarial training is one of the most effective approaches to improve model robustness against adversarial examples. However, previous works mainly focus on the overall robustness of the model, and the in-depth analysis on the role of each class involved in adversarial training is still missing. In this paper, we propose to analyze the class-wise robustness in adversarial training. First, we provide a detailed diagnosis of adversarial training on six benchmark datasets, i.e., MNIST, CIFAR-10, CIFAR-100, SVHN, STL-10 and ImageNet. Surprisingly, we find that there are remarkable robustness discrepancies among classes, leading to unbalance/unfair class-wise robustness in the robust models. Furthermore, we keep investigating the relations between classes and find that the unbalanced class-wise robustness is pretty consistent among different attack and defense methods. Moreover, we observe that the stronger attack methods in adversarial learning achieve performance improvement mainly from a more successful attack on the vulnerable classes (i.e., classes with less robustness). Inspired by these interesting findings, we design a simple but effective attack method based on the traditional PGD attack, named Temperature-PGD attack, which proposes to enlarge the robustness disparity among classes with a temperature factor on the confidence distribution of each image. Experiments demonstrate our method can achieve a higher attack rate than the PGD attack. Furthermore, from the defense perspective, we also make some modifications in the training and inference phase to improve the robustness of the most vulnerable class, so as to mitigate the large difference in class-wise robustness. We believe our work can contribute to a more comprehensive understanding of adversarial training as well as rethinking the class-wise properties in robust models. Qi Tian 0003, Kun Kuang 0001, Kelu Jiang, Fei Wu 0001, Yisen Wang 0001 |
KDD | 1 |