Demo Data from VLDB 2026 / reviewers in the wild / expert
Jiacheng Li 0002
dblp:18/5576-2
· DBLP profile ↗
4ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0003-2964-6107ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 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
4 papers |
Efficient and distributed learning · 30% Generative modeling · 30% Vision and language · 12% |
Topics — the 10 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Vision and language › vision-language generation
visual storytelling |
0.8 | 2 | 2020 | Topic Adaptation and Prototype Encoding for Few-Shot Visual Storytelling · ACM Multimedia 2020 Informative Visual Storytelling with Cross-modal Rules · ACM Multimedia 2019 |
Machine learning › Generative modeling › concept erasure
concept unlearning in diffusion models |
0.7 | 1 | 2023 | Degeneration-Tuning: Using Scrambled Grid shield Unwanted Concepts from Stable Diffusion · ACM Multimedia 2023 |
Machine learning › Generative modeling
diffusion model |
0.7 | 1 | 2023 | Degeneration-Tuning: Using Scrambled Grid shield Unwanted Concepts from Stable Diffusion · ACM Multimedia 2023 |
Machine learning › Efficient and distributed learning › adaptive computation
early exit |
0.7 | 1 | 2023 | SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT Inference · IJCAI 2023 |
Machine learning › Efficient and distributed learning
inference efficiency |
0.7 | 1 | 2023 | SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT Inference · IJCAI 2023 |
Machine learning › Efficient and distributed learning › adaptive computation
layer skipping |
0.7 | 1 | 2023 | SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT Inference · IJCAI 2023 |
Machine learning › Trustworthy machine learning › AI safety
model safety |
0.7 | 1 | 2023 | Degeneration-Tuning: Using Scrambled Grid shield Unwanted Concepts from Stable Diffusion · ACM Multimedia 2023 |
Machine learning › Generative modeling › diffusion model › text-to-image generation
text-to-image diffusion model |
0.7 | 1 | 2023 | Degeneration-Tuning: Using Scrambled Grid shield Unwanted Concepts from Stable Diffusion · ACM Multimedia 2023 |
Machine learning › Transfer learning and domain adaptation
few-shot learning |
0.4 | 1 | 2020 | Topic Adaptation and Prototype Encoding for Few-Shot Visual Storytelling · ACM Multimedia 2020 |
Natural language and speech › Language models and text generation › text generation
story generation |
0.2 | 2 | 2020 | Topic Adaptation and Prototype Encoding for Few-Shot Visual Storytelling · ACM Multimedia 2020 Informative Visual Storytelling with Cross-modal Rules · ACM Multimedia 2019 |
Methods — techniques the papers use, named apart from their topics
scrambled grid · 0.7layer skipping · 0.7early exiting · 0.7degeneration-tuning · 0.7cross-layer contrastive learning · 0.7prototype encoding · 0.4multimodal seq2seq · 0.4gradient-based meta-learning · 0.4attention mechanism · 0.4association rule mining · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT InferenceabstractDynamic early exiting has been proven to improve the inference speed of the pre-trained language model like BERT. However, all samples must go through all consecutive layers before early exiting and more complex samples usually go through more layers, which still exists redundant computation. In this paper, we propose a novel dynamic early exiting combined with layer skipping for BERT inference named SmartBERT, which adds a skipping gate and an exiting operator into each layer of BERT. SmartBERT can adaptively skip some layers and adaptively choose whether to exit. Besides, we propose cross-layer contrastive learning and combine it into our training phases to boost the intermediate layers and classifiers which would be beneficial for early exiting. To keep the inconsistent usage of skipping gates between training and inference phases, we propose a hard weight mechanism during training phase. We conduct experiments on eight classification datasets of the GLUE benchmark. Experimental results show that SmartBERT achieves 2-3× computation reduction with minimal accuracy drops compared with BERT and our method outperforms previous methods in both efficiency and accuracy. Moreover, in some complex datasets, we prove that the early exiting based on entropy hardly works, and the skipping mechanism is essential for reducing computation. Boren Hu, Yun Zhu 0007, Jiacheng Li 0002, Siliang Tang |
IJCAI | 3 |
| 2023 | Degeneration-Tuning: Using Scrambled Grid shield Unwanted Concepts from Stable DiffusionabstractOwing to the unrestricted nature of the content in the training data, large text-to-image diffusion models, such as Stable Diffusion (SD), are capable of generating images with potentially copyrighted or dangerous content based on corresponding textual concepts information. This includes specific intellectual property (IP), human faces, and various artistic styles. However, Negative Prompt, a widely used method for content removal, frequently fails to conceal this content due to inherent limitations in its inference logic. In this work, we propose a novel strategy named Degeneration-Tuning (DT) to shield contents of unwanted concepts from SD weights. By utilizing Scrambled Grid to reconstruct the correlation between undesired concepts and their corresponding image domain, we guide SD to generate meaningless content when such textual concepts are provided as input. As this adaptation occurs at the level of the model's weights, the SD, after DT, can be grafted onto other conditional diffusion frameworks like ControlNet to shield unwanted concepts. In addition to qualitatively showcasing the effectiveness of our DT method in protecting various types of concepts, a quantitative comparison of the SD before and after DT indicates that the DT method does not significantly impact the generative quality of other contents. The FID and IS scores of the model on COCO-30K exhibit only minor changes after DT, shifting from 12.61 and 39.20 to 13.04 and 38.25, respectively, which clearly outperforms the previous methods. Zixuan Ni, Longhui Wei, Jiacheng Li 0002, Siliang Tang, Yueting Zhuang, Qi Tian 0001 |
ACM Multimedia | 3 |
| 2020 | Topic Adaptation and Prototype Encoding for Few-Shot Visual StorytellingabstractVisual Storytelling~(VIST) is a task to tell a narrative story about a certain topic according to the given photo stream. The existing studies focus on designing complex models, which rely on a huge amount of human-annotated data. However, the annotation of VIST is extremely costly and many topics cannot be covered in the training dataset due to the long-tail topic distribution. In this paper, we focus on enhancing the generalization ability of the VIST model by considering the few-shot setting. Inspired by the way humans tell a story, we propose a topic adaptive storyteller to model the ability of inter-topic generalization. In practice, we apply the gradient-based meta-learning algorithm on multi-modal seq2seq models to endow the model the ability to adapt quickly from topic to topic. Besides, We further propose a prototype encoding structure to model the ability of intra-topic derivation. Specifically, we encode and restore the few training story text to serve as a reference to guide the generation at inference time. Experimental results show that topic adaptation and prototype encoding structure mutually bring benefit to the few-shot model on BLEU and METEOR metric. The further case study shows that the stories generated after few-shot adaptation are more relative and expressive. Jiacheng Li 0002, Siliang Tang, Juncheng Li 0006, Jun Xiao 0001, Fei Wu 0001, Shiliang Pu, Yueting Zhuang |
ACM Multimedia | 1 |
| 2019 | Informative Visual Storytelling with Cross-modal RulesabstractExisting methods in the Visual Storytelling field often suffer from the problem of generating general descriptions, while the image contains a lot of meaningful contents remaining unnoticed. The failure of informative story generation can be concluded to the model's incompetence of capturing enough meaningful concepts. The categories of these concepts include entities, attributes, actions, and events, which are in some cases crucial to grounded storytelling. To solve this problem, we propose a method to mine the cross-modal rules to help the model infer these informative concepts given certain visual input. We first build the multimodal transactions by concatenating the CNN activations and the word indices. Then we use the association rule mining algorithm to mine the cross-modal rules, which will be used for the concept inference. With the help of the cross-modal rules, the generated stories are more grounded and informative. Besides, our proposed method holds the advantages of interpretation, expandability, and transferability, indicating potential for wider application. Finally, we leverage these concepts in our encoder-decoder framework with the attention mechanism. We conduct several experiments on the VIsual StoryTelling~(VIST) dataset, the results of which demonstrate the effectiveness of our approach in terms of both automatic metrics and human evaluation. Additional experiments are also conducted showing that our mined cross-modal rules as additional knowledge helps the model gain better performance when trained on a small dataset. Jiacheng Li 0002, Haizhou Shi, Siliang Tang, Fei Wu 0001, Yueting Zhuang |
ACM Multimedia | 1 |