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

Jiaxin Gu

dblp:218/5361 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
3since 2021 · last 2023
—ORCID · conflict

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

Artificial intelligence and machine learning · 7 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

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 · 50% Vision and language · 22% Image recognition and object detection · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.742022
Towards Compact 1-bit CNNs via Bayesian Learning · Int. J. Comput. Vis. 2022
Bayesian Optimized 1-Bit CNNs · ICCV 2019
Circulant Binary Convolutional Networks: Enhancing the Performance of 1-Bit DCNNs With Circulant Back Propagation · CVPR 2019
Machine learning › Efficient and distributed learning › model quantization
1-bit CNNs
1.022022
Towards Compact 1-bit CNNs via Bayesian Learning · Int. J. Comput. Vis. 2022
Bayesian Optimized 1-Bit CNNs · ICCV 2019
Machine learning › Efficient and distributed learning › model compression › quantization › quantized neural network
binary neural network
0.822019
Circulant Binary Convolutional Networks: Enhancing the Performance of 1-Bit DCNNs With Circulant Back Propagation · CVPR 2019
Projection Convolutional Neural Networks for 1-bit CNNs via Discrete Back Propagation · AAAI 2019
Machine learning › Efficient and distributed learning › model compression › quantization
quantized neural network
0.822019
Bayesian Optimized 1-Bit CNNs · ICCV 2019
Projection Convolutional Neural Networks for 1-bit CNNs via Discrete Back Propagation · AAAI 2019
Computer vision › Image recognition and object detection
human-object interaction detection
0.712023
End-to-End Zero-Shot HOI Detection via Vision and Language Knowledge Distillation · AAAI 2023
Computer vision › Vision and language
vision-language model distillation
0.712023
End-to-End Zero-Shot HOI Detection via Vision and Language Knowledge Distillation · AAAI 2023
Computer vision › Image recognition and object detection › human-object interaction detection
zero-shot human-object interaction detection
0.712023
End-to-End Zero-Shot HOI Detection via Vision and Language Knowledge Distillation · AAAI 2023
Computer vision › Vision and language
image captioning
0.612022
DIFNet: Boosting Visual Information Flow for Image Captioning · CVPR 2022
Computer vision › Vision and language
multimodal fusion
0.612022
DIFNet: Boosting Visual Information Flow for Image Captioning · CVPR 2022
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models
bayesian deep learning
0.412019
Bayesian Optimized 1-Bit CNNs · ICCV 2019
Machine learning › Deep learning architectures and training
convolutional neural network
0.412019
Circulant Binary Convolutional Networks: Enhancing the Performance of 1-Bit DCNNs With Circulant Back Propagation · CVPR 2019
Computer vision › Image recognition and object detection
image classification
0.112019
Projection Convolutional Neural Networks for 1-bit CNNs via Discrete Back Propagation · AAAI 2019

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

knowledge distillation · 0.7interactive score module · 0.7bipartite matching · 0.7segmentation feature · 0.6quantization · 0.6iterative independent layer normalization · 0.6dual information flow · 0.6bayesian learning · 0.6projection function · 0.4discrete back propagation · 0.4
YearPublicationVenuePosition
2023 End-to-End Zero-Shot HOI Detection via Vision and Language Knowledge Distillation
abstract
Most existing Human-Object Interaction (HOI) Detection methods rely heavily on full annotations with predefined HOI categories, which is limited in diversity and costly to scale further. We aim at advancing zero-shot HOI detection to detect both seen and unseen HOIs simultaneously. The fundamental challenges are to discover potential human-object pairs and identify novel HOI categories. To overcome the above challenges, we propose a novel End-to-end zero-shot HOI Detection (EoID) framework via vision-language knowledge distillation. We first design an Interactive Score module combined with a Two-stage Bipartite Matching algorithm to achieve interaction distinguishment for human-object pairs in an action-agnostic manner. Then we transfer the distribution of action probability from the pretrained vision-language teacher as well as the seen ground truth to the HOI model to attain zero-shot HOI classification. Extensive experiments on HICO-Det dataset demonstrate that our model discovers potential interactive pairs and enables the recognition of unseen HOIs. Finally, our method outperforms the previous SOTA under various zero-shot settings. Moreover, our method is generalizable to large-scale object detection data to further scale up the action sets. The source code is available at: https://github.com/mrwu-mac/EoID.
Mingrui Wu, Jiaxin Gu, Yunhang Shen, Mingbao Lin, Chao Chen 0026, Xiaoshuai Sun
AAAI2
2022 DIFNet: Boosting Visual Information Flow for Image Captioning
abstract
Current Image Captioning (IC) methods predict textual words sequentially based on the input visual information from the visual feature extractor and the partially generated sentence information. However, for most cases, the partially generated sentence may dominate the target word prediction due to the insufficiency of visual information, making the generated descriptions irrelevant to the content of the given image. In this paper, we propose a Dual Information Flow Network (DIFNet11Source code is available at: https://github.com/mrwu-mac/DIFNet) to address this issue, which takes segmentation feature as another visual information source to enhance the contribution of visual information for prediction. To maximize the use of two information flows, we also propose an effective feature fusion module termed Iterative Independent Layer Normalization (IILN) which can condense the most relevant inputs while retraining modality-specific information in each flow. Experiments show that our method is able to enhance the dependence of prediction on visual information, making word prediction more focused on the visual content, and thus achieves new state-of-the-art performance on the MSCOCO dataset, e.g., 136.2 CIDEr on COCO Karpathy test split.
Mingrui Wu, Xuying Zhang, Xiaoshuai Sun, Yiyi Zhou, Chao Chen 0026, Jiaxin Gu, Xing Sun 0001, Rongrong Ji
CVPR6
2022 Towards Compact 1-bit CNNs via Bayesian Learning
Junhe Zhao, Sheng Xu 0007, Baochang Zhang 0001, Jiaxin Gu, David S. Doermann, Guodong Guo
Int. J. Comput. Vis.4
2019 Projection Convolutional Neural Networks for 1-bit CNNs via Discrete Back Propagation
abstract
The advancement of deep convolutional neural networks (DCNNs) has driven significant improvement in the accuracy of recognition systems for many computer vision tasks. However, their practical applications are often restricted in resource-constrained environments. In this paper, we introduce projection convolutional neural networks (PCNNs) with a discrete back propagation via projection (DBPP) to improve the performance of binarized neural networks (BNNs). The contributions of our paper include: 1) for the first time, the projection function is exploited to efficiently solve the discrete back propagation problem, which leads to a new highly compressed CNNs (termed PCNNs); 2) by exploiting multiple projections, we learn a set of diverse quantized kernels that compress the full-precision kernels in a more efficient way than those proposed previously; 3) PCNNs achieve the best classification performance compared to other state-ofthe-art BNNs on the ImageNet and CIFAR datasets.
Jiaxin Gu, Ce Li 0002, Baochang Zhang 0001, Jungong Han, Xianbin Cao 0001, Jianzhuang Liu, David S. Doermann
AAAI1
2019 Search for K: Assessing Five Topic-Modeling Approaches to 120, 000 Canadian Articles
abstract
Topic modeling has been an important field in natural language processing (NLP) and recently witnessed great methodological advances. Yet, the development of topic modeling is still, if not increasingly, challenged by two critical issues. First, despite intense efforts toward nonparametric/post-training methods, the search for the optimal number of topics K remains a fundamental question in topic modeling and warrants input from domain experts. Second, with the development of more sophisticated models, topic modeling is now ironically been treated as a black box and it becomes increasingly difficult to tell how research findings are informed by data, model specifications, or inference algorithms. Based on about 120,000 newspaper articles retrieved from three major Canadian newspapers (Globe and Mail, Toronto Star, and National Post) since 1977, we employ five methods with different model specifications and inference algorithms (Latent Semantic Analysis, Latent Dirichlet Allocation, Principal Component Analysis, Factor Analysis, Nonnegative Matrix Factorization) to identify discussion topics. The optimal topics are then assessed using three measures: coherence statistics, held-out likelihood (loss), and graph-based dimensionality selection. Mixed findings from this research complement advances in topic modeling and provide insights into the choice of optimal topics in social science research.
Qiang Fu 0022, Yufan Zhuang, Jiaxin Gu, Yushu Zhu, Huihui Qin, Xin Guo 0003
IEEE BigData3
2019 Circulant Binary Convolutional Networks: Enhancing the Performance of 1-Bit DCNNs With Circulant Back Propagation
abstract
The rapidly decreasing computation and memory cost has recently driven the success of many applications in the field of deep learning. Practical applications of deep learning in resource-limited hardware, such as embedded devices and smart phones, however, remain challenging. For binary convolutional networks, the reason lies in the degraded representation caused by binarizing full-precision filters. To address this problem, we propose new circulant filters (CiFs) and a circulant binary convolution (CBConv) to enhance the capacity of binarized convolutional features via our circulant back propagation (CBP). The CiFs can be easily incorporated into existing deep convolutional neural networks (DCNNs), which leads to new Circulant Binary Convolutional Networks (CBCNs). Extensive experiments confirm that the performance gap between the 1-bit and full-precision DCNNs is minimized by increasing the filter diversity, which further increases the representational ability in our networks. Our experiments on ImageNet show that CBCNs achieve 61.4% top-1 accuracy with ResNet18. Compared to the state-of-the-art such as XNOR, CBCNs can achieve up to 10% higher top-1 accuracy with more powerful representational ability.
Chunlei Liu 0001, Wenrui Ding, Xin Xia 0005, Baochang Zhang 0001, Jiaxin Gu, Jianzhuang Liu, Rongrong Ji, David S. Doermann
CVPR5
2019 Bayesian Optimized 1-Bit CNNs
abstract
Deep convolutional neural networks (DCNNs) have dominated the recent developments in computer vision through making various record-breaking models. However, it is still a great challenge to achieve powerful DCNNs in resource-limited environments, such as on embedded devices and smart phones. Researchers have realized that 1-bit CNNs can be one feasible solution to resolve the issue; however, they are baffled by the inferior performance compared to the full-precision DCNNs. In this paper, we propose a novel approach, called Bayesian optimized 1-bit CNNs (denoted as BONNs), taking the advantage of Bayesian learning, a well-established strategy for hard problems, to significantly improve the performance of extreme 1-bit CNNs. We incorporate the prior distributions of full-precision kernels and features into the Bayesian framework to construct 1-bit CNNs in an end-to-end manner, which have not been considered in any previous related methods. The Bayesian losses are achieved with a theoretical support to optimize the network simultaneously in both continuous and discrete spaces, aggregating different losses jointly to improve the model capacity. Extensive experiments on the ImageNet and CIFAR datasets show that BONNs achieve the best classification performance compared to state-of-the-art 1-bit CNNs.
Jiaxin Gu, Junhe Zhao, Baochang Zhang 0001, Jianzhuang Liu, Guodong Guo, Rongrong Ji
ICCV1