Ning Chen

Mr. Ning Chen

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 December 2025 in Pattern Recognition
Verified
Journal Article
Closed access
NCNing Chen
Ning Chen
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
TWTian-Shuang Wu
Tian-Shuang Wu
YWYanyan Wang
Yanyan Wang
BTBin Tang
Bin Tang

13 January 2026 in Pattern Recognition Letters
Verified
Journal Article
Closed access
TWTian-Shuang Wu
Tian-Shuang Wu
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
YWYanyan Wang
Yanyan Wang
NCNing Chen
Ning Chen
ZQZhihao Qu
Zhihao Qu
BYBaoliu Ye
Baoliu Ye

31 January 2025 in arXiv
Verified
Preprint
Open access
PDF file
NCNing Chen
Ning Chen
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
TWTian-Shuang Wu
Tian-Shuang Wu
YWYanyan Wang
Yanyan Wang
BTBin Tang
Bin Tang
In multi-label learning, leveraging contrastive learning to learn better representations faces a key challenge: selecting positive and negative samples and effectively utilizing label information. Previous studies selected positive and negative samples based on the overlap between labels and used them for label-wise loss balancing. However, these methods suffer from a complex selection process and fail to account for the varying importance of different labels. To address these problems, we propose a novel method that improves multi-label contrastive learning through label distribution. Specifically, when selecting positive and negative samples, we only need to consider whether there is an intersection between labels. To model the relationships between labels, we introduce two methods to recover label distributions from logical labels, based on Radial Basis Function (RBF) and contrastive loss, respectively. We evaluate our method on nine widely used multi-label datasets, including image and vector datasets. The results demonstrate that our method outperforms state-of-the-art methods in six evaluation metrics.

10 September 2026 in Electronics
Verified
Journal Article
Open access
PDF file
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
NCNing Chen
Ning Chen
CJCan Jiao
Can Jiao
LWLingfeng Wang
Lingfeng Wang
YHYi-Xiao He
Yi-Xiao He
Partial multi-label learning (PML) learns from over-complete candidate labels: All true labels are included in the candidate set, but irrelevant labels may also be annotated. Existing PML methods mainly reduce this ambiguity during classifier training by estimating label reliability, recovering latent label distributions, or modeling label correlations. This paper studies a complementary question: how can PML supervision be used for contrastive representation pretraining? The main difficulty is relation construction. Raw candidate label overlap is not a reliable contrastive signal, because two images can share only false candidate labels. We therefore formulate PML pretraining as a relation disambiguation problem and propose a confidence-aware relation contrastive learning framework. The method estimates candidate label confidence, uses it to construct semantic relation distributions over current and queued samples, and aligns the embedding distribution with these confidence-weighted relations. The same candidate label confidence semantics are used during downstream fine-tuning, keeping non-candidate labels as reliable negatives while softly disambiguating the candidate set. Across VOC2007, NUS-WIDE, and COCO2014, the method improves subset accuracy and F1-oriented measures under moderate and severe partial-label noise. For example, on VOC2007 at p=0.8, it improves subset accuracy from 0.3322 to 0.5269 and micro-F1 from 0.6710 to 0.7617 over PML-CD. However, the CUB200 results further identify a limitation: fine-grained attribute prediction is less consistently served by the present global representation pretraining design.

9 February 2025 in arXiv
Verified
Preprint
Open access
PDF file
TWTian-Shuang Wu
Tian-Shuang Wu
Shen-Huan LyuShen-Huan Lyu
Shen-Huan Lyu
NCNing Chen
Ning Chen
ZQZhihao Qu
Zhihao Qu
BYBaoliu Ye
Baoliu Ye
In recent years, as a compromise between privacy and performance, few-sample model compression has been widely adopted to deal with limited data resulting from privacy and security concerns. However, when the number of available samples is extremely limited, class imbalance becomes a common and tricky problem. Achieving an equal number of samples across all classes is often costly and impractical in real-world applications, and previous studies on few-sample model compression have mostly ignored this significant issue. Our experiments comprehensively demonstrate that class imbalance negatively affects the overall performance of few-sample model compression methods. To address this problem, we propose a novel and adaptive framework named OOD-Enhanced Few-Sample Model Compression (OE-FSMC). This framework integrates easily accessible out-of-distribution (OOD) data into both the compression and fine-tuning processes, effectively rebalancing the training distribution. We also incorporate a joint distillation loss and a regularization term to reduce the risk of the model overfitting to the OOD data. Extensive experiments on multiple benchmark datasets show that our framework can be seamlessly incorporated into existing few-sample model compression methods, effectively mitigating the accuracy degradation caused by class imbalance.