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

Kexin Bao

dblp:349/2684 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
8since 2021 · last 2026
0000-0003-4921-6112ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 5 since 2021Artificial intelligence and machine learning · 4 · 4 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
5 papers
Efficient and distributed learning · 25% Transfer learning and domain adaptation · 22% Image recognition and object detection · 18%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › object detection › infrared object detection
infrared small target detection
1.522024
Learning Shape-Biased Representations for Infrared Small Target Detection · IEEE Trans. Multim. 2024
Learning Contrast-Enhanced Shape-Biased Representations for Infrared Small Target Detection · IEEE Trans. Image Process. 2024
Machine learning › Representation and self-supervised learning › representation learning › visual representation learning
shape-biased representation learning
1.522024
Learning Shape-Biased Representations for Infrared Small Target Detection · IEEE Trans. Multim. 2024
Learning Contrast-Enhanced Shape-Biased Representations for Infrared Small Target Detection · IEEE Trans. Image Process. 2024
Machine learning › Transfer learning and domain adaptation › few-shot learning
few-shot class-incremental learning
1.322026
Few-shot Class-Incremental Learning via Generative Co-Memory Regularization · Int. J. Comput. Vis. 2026
CD^2: Constrained Dataset Distillation for Few-Shot Class-Incremental Learning · IJCAI 2025
Machine learning › Learning paradigms › continual learning
class-incremental learning
1.012026
Few-shot Class-Incremental Learning via Generative Co-Memory Regularization · Int. J. Comput. Vis. 2026
Machine learning › Efficient and distributed learning
dataset distillation
0.912025
CD^2: Constrained Dataset Distillation for Few-Shot Class-Incremental Learning · IJCAI 2025
Machine learning › Efficient and distributed learning
federated learning
0.712023
Federated Learning with Label-Masking Distillation · ACM Multimedia 2023
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.712023
Federated Learning with Label-Masking Distillation · ACM Multimedia 2023
Machine learning › Transfer learning and domain adaptation
label shift
0.712023
Federated Learning with Label-Masking Distillation · ACM Multimedia 2023
Computer vision › 3D vision › 3d reconstruction
contour-based reconstruction
0.212024
Learning Shape-Biased Representations for Infrared Small Target Detection · IEEE Trans. Multim. 2024

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

knowledge distillation · 1.5generative co-memory regularization · 1.0dataset distillation · 0.9catastrophic forgetting mitigation · 0.9shape-guided decoder · 0.8large-kernel encoder · 0.8large kernel convolution · 0.8gated resnet blocks · 0.8convolutional neural network · 0.8central difference convolution · 0.8
YearPublicationVenuePosition
2026 Few-shot Class-Incremental Learning via Generative Co-Memory Regularization
Kexin Bao, Dan Zeng 0001, Shiming Ge
Int. J. Comput. Vis.1
2025 CD^2: Constrained Dataset Distillation for Few-Shot Class-Incremental Learning
abstract
Few-shot class-incremental learning (FSCIL) receives significant attention from the public to perform classification continuously with a few training samples, which suffers from the key catastrophic forgetting problem. Existing methods usually employ an external memory to store previous knowledge and treat it with incremental classes equally, which cannot properly preserve previous essential knowledge. To solve this problem and inspired by recent distillation works on knowledge transfer, we propose a framework termed Constrained Dataset Distillation (CD^2) to facilitate FSCIL, which includes a dataset distillation module (DDM) and a distillation constraint module (DCM). Specifically, the DDM synthesizes highly condensed samples guided by the classifier, forcing the model to learn compacted essential class-related clues from a few incremental samples. The DCM introduces a designed loss to constrain the previously learned class distribution, which can preserve distilled knowledge more sufficiently. Extensive experiments on three public datasets show the superiority of our method against other state-of-the-art competitors.
Kexin Bao, Daichi Zhang, Hansong Zhang 0003, Yutao Yue, Shiming Ge
IJCAI1
2025 Divide and Conquer: Static-Dynamic Collaboration for Few-Shot Class-Incremental Learning
abstract
Continual learning systems suffer from catastrophic forgetting, where updates for new tasks destructively interfere with previously acquired knowledge. Recent empirical advances—including flatness-based optimization, static–dynamic architectural decomposition, and probabilistic reg- ularization— have demonstrated strong mitigation of forgetting. However, a unified structural explanation for why these methods succeed remains underdeveloped. This paper proposes a constraint geometry perspective on representation updates in continual learning. We argue that catastrophic forgetting can be interpreted as a curvature-induced vio- lation of constraint-preserving update dynamics. Under this view, successful continual learning methods implicitly regulate update directions in high-curvature regions of the loss landscape. Rather than introducing a new algorithm, this work provides a structural interpretation that clarifies why diverse empirical strategies succeed. Identifying and preserving geometric constraints during gradient-based updates may serve as a guiding principle for future continual learning research.
Kexin Bao, Daichi Zhang, Dan Zeng 0001, Shiming Ge
ICMR1
2025 PKI: Prior knowledge-infused neural network for few-shot class-incremental learning
Kexin Bao, Fanzhao Lin, Dan Zeng 0001, Shiming Ge
Neural Networks1
2024 DB-FSCIL: Few-Shot Class-Incremental Learning Using Dual Bridges
Kexin Bao, Fanzhao Lin, Ruyue Liu, Shiming Ge
PRICAI (3)1
2024 Learning Contrast-Enhanced Shape-Biased Representations for Infrared Small Target Detection
abstract
Detecting infrared small targets under cluttered background is mainly challenged by dim textures, low contrast and varying shapes. This paper proposes an approach to facilitate infrared small target detection by learning contrast-enhanced shape-biased representations. The approach cascades a contrast-shape encoder and a shape-reconstructable decoder to learn discriminative representations that can effectively identify target objects. The contrast-shape encoder applies a stem of central difference convolutions and a few large-kernel convolutions to extract shape-preserving features from input infrared images. This specific design in convolutions can effectively overcome the challenges of low contrast and varying shapes in a unified way. Meanwhile, the shape-reconstructable decoder accepts the edge map of input infrared image and is learned by simultaneously optimizing two shape-related consistencies: the internal one decodes the encoder representations by upsampling reconstruction and constraints segmentation consistency, whilst the external one cascades three gated ResNet blocks to hierarchically fuse edge maps and decoder representations and constrains contour consistency. This decoding way can bypass the challenge of dim texture and varying shapes. In our approach, the encoder and decoder are learned in an end-to-end manner, and the resulting shape-biased encoder representations are suitable for identifying infrared small targets. Extensive experimental evaluations are conducted on public benchmarks and the results demonstrate the effectiveness of our approach.
Fanzhao Lin, Kexin Bao, Dan Zeng 0001, Shiming Ge
IEEE Trans. Image Process.2
2024 Learning Shape-Biased Representations for Infrared Small Target Detection
abstract
Typically, infrared small target detection aims to accurately localize objects from complex backgrounds where the object textures are often dim and the object shapes are varying. A feasible solution is learning discriminative representations with deep convolutional neural networks (CNNs). However, the representations learned by traditional deep CNNs often suffer from low shape bias. In this work, we propose a unified framework to learn shape-biased representations for facilitating infrared small target detection by explicitly incorporating shape information into model learning. The framework cascades a large-kernel encoder and a shape-guided decoder to learn discriminative shape-biased representations in an end-to-end manner. The large-kernel encoder describes infrared images into shape-preserving representations by using a few convolutions whose kernel size is as large as$9\times 9$, in contrast to commonly used$3\times 3$. The shape-guided decoder simultaneously addresses two tasks: decodes the encoder representations via upsampling reconstruction to reconstruct the segmentation, and hierarchically fuses the decoder representations and edge information via cascaded gated ResNet blocks to reconstruct the contour. In this way, the learned shape-biased representations are effective for identifying infrared small targets. Extensive experiments show our approach outperforms 18 state-of-the-arts.
Fanzhao Lin, Shiming Ge, Kexin Bao, Chenggang Yan 0001, Dan Zeng 0001
IEEE Trans. Multim.3
2023 Federated Learning with Label-Masking Distillation
abstract
Federated learning provides a privacy-preserving manner to collaboratively train models on data distributed over multiple local clients via the coordination of a global server. In this paper, we focus on label distribution skew in federated learning, where due to the different user behavior of the client, label distributions between different clients are significantly different. When faced with such cases, most existing methods will lead to a suboptimal optimization due to the inadequate utilization of label distribution information in clients. Inspired by this, we propose a label-masking distillation approach termed FedLMD to facilitate federated learning via perceiving the various label distributions of each client. We classify the labels into majority and minority labels based on the number of examples per class during training. The client model learns the knowledge of majority labels from local data. The process of distillation masks out the predictions of majority labels from the global model, so that it can focus more on preserving the minority label knowledge of the client. A series of experiments show that the proposed approach can achieve state-of-the-art performance in various cases. Moreover, considering the limited resources of the clients, we propose a variant FedLMD-Tf that does not require an additional teacher, which outperforms previous lightweight approaches without increasing computational costs. Our code is available at https://github.com/wnma3mz/FedLMD.
Jianghu Lu, Shikun Li, Kexin Bao, Zhenxing Qian, Shiming Ge
ACM Multimedia3