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

Zitian Jin

dblp:317/1365 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0004-7419-049XORCID · reported

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

Graphics, 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
1 paper
Efficient and distributed learning · 61% Vision and language · 30% Deep learning architectures and training · 9%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression › pruning › dynamic pruning
adaptive pruning
0.712023
Bilaterally Slimmable Transformer for Elastic and Efficient Visual Question Answering · IEEE Trans. Multim. 2023
Machine learning › Efficient and distributed learning
model compression
0.712023
Bilaterally Slimmable Transformer for Elastic and Efficient Visual Question Answering · IEEE Trans. Multim. 2023
Computer vision › Vision and language
visual question answering
0.712023
Bilaterally Slimmable Transformer for Elastic and Efficient Visual Question Answering · IEEE Trans. Multim. 2023
Machine learning › Deep learning architectures and training
transformer
0.212023
Bilaterally Slimmable Transformer for Elastic and Efficient Visual Question Answering · IEEE Trans. Multim. 2023

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

slimmable networks · 0.7knowledge distillation · 0.7adaptive pruning · 0.7
YearPublicationVenuePosition
2023 Bilaterally Slimmable Transformer for Elastic and Efficient Visual Question Answering
abstract
Recent advances in Transformer architectures [1] have brought remarkable improvements to visual question answering (VQA). Nevertheless, Transformer-based VQA models are usually deep and wide to guarantee good performance, so they can only run on powerful GPU servers and cannot run on capacity-restricted platforms such as mobile phones. Therefore, it is desirable to learn an elastic VQA model that supports adaptive pruning at runtime to meet the efficiency constraints of different platforms. To this end, we present the bilaterally slimmable Transformer (BST), a general framework that can be seamlessly integrated into arbitrary Transformer-based VQA models to train a single model once and obtain various slimmed submodels of different widths and depths. To verify the effectiveness and generality of this method, we integrate the proposed BST framework with three typical Transformer-based VQA approaches, namely MCAN [2], UNITER [3], and CLIP-ViL [4], and conduct extensive experiments on two commonly-used benchmark datasets. In particular, one slimmed MCAN$_\mathsf {BST}$submodel achieves comparable accuracy on VQA-v2, while being 0.38× smaller in model size and having 0.27× fewer FLOPs than the reference MCAN model. The smallest MCAN$_\mathsf {BST}$submodel only has 9M parameters and 0.16G FLOPs during inference, making it possible to deploy it on a mobile device with less than 60 ms latency.
Zhou Yu 0001, Zitian Jin, Jun Yu 0002, Mingliang Xu 0001, Jianping Fan 0007
IEEE Trans. Multim.2