The reviewed record of science sign in
Pith

arxiv: 2211.15671 · v1 · pith:JHZPEXX7 · submitted 2022-11-28 · cs.LG

Deep Semi-supervised Learning with Double-Contrast of Features and Semantics

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JHZPEXX7record.jsonopen to challenge →

classification cs.LG
keywords learningfeaturesdatasemanticsamountsemanticsemi-supervisedconsistency
0
0 comments X
read the original abstract

In recent years, the field of intelligent transportation systems (ITS) has achieved remarkable success, which is mainly due to the large amount of available annotation data. However, obtaining these annotated data has to afford expensive costs in reality. Therefore, a more realistic strategy is to leverage semi-supervised learning (SSL) with a small amount of labeled data and a large amount of unlabeled data. Typically, semantic consistency regularization and the two-stage learning methods of decoupling feature extraction and classification have been proven effective. Nevertheless, representation learning only limited to semantic consistency regularization may not guarantee the separation or discriminability of representations of samples with different semantics; due to the inherent limitations of the two-stage learning methods, the extracted features may not match the specific downstream tasks. In order to deal with the above drawbacks, this paper proposes an end-to-end deep semi-supervised learning double contrast of semantic and feature, which extracts effective tasks specific discriminative features by contrasting the semantics/features of positive and negative augmented samples pairs. Moreover, we leverage information theory to explain the rationality of double contrast of semantics and features and slack mutual information to contrastive loss in a simpler way. Finally, the effectiveness of our method is verified in benchmark datasets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.