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

Kerui Liu

dblp:355/1790 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, 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
Learning paradigms · 33% Representation and self-supervised learning · 33% Segmentation and scene understanding · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › contrastive learning › robust contrastive learning
noise-robust contrastive learning
0.712023
HyperMatch: Noise-Tolerant Semi-Supervised Learning via Relaxed Contrastive Constraint · CVPR 2023
Computer vision › Segmentation and scene understanding › pseudo-label learning
pseudo-label refinement
0.712023
HyperMatch: Noise-Tolerant Semi-Supervised Learning via Relaxed Contrastive Constraint · CVPR 2023
Machine learning › Learning paradigms
semi-supervised learning
0.712023
HyperMatch: Noise-Tolerant Semi-Supervised Learning via Relaxed Contrastive Constraint · CVPR 2023

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

relaxed contrastive loss · 0.7gaussian mixture model · 0.7contrastive learning · 0.7
YearPublicationVenuePosition
2026 LP-DS-Vim: Lightweight Patch and Dynamic State Vision Mamba Network for Gastrointestinal Disease Classification
Kerui Liu, Lingling Fang
ICIC (30)1
2026 Hierarchical Feature Fusion Framework with Modal Collaboration for 3D PET/CT Segmentation
Kerui Liu, Lingling Fang
ICIC (30)1
2023 HyperMatch: Noise-Tolerant Semi-Supervised Learning via Relaxed Contrastive Constraint
abstract
Recent developments of the application of Contrastive Learning in Semi-Supervised Learning (SSL) have demonstrated significant advancements, as a result of its exceptional ability to learn class-aware cluster representations and the full exploitation of massive unlabeled data. However, mismatched instance pairs caused by inaccurate pseudo labels would assign an unlabeled instance to the incorrect class in feature space, hence exacerbating SSL's renowned confirmation bias. To address this issue, we introduced a novel SSL approach, HyperMatch, which is a plugin to several SSL designs enabling noise-tolerant utilization of unlabeled data. In particular, confidence predictions are combined with semantic similarities to generate a more objective class distribution, followed by a Gaussian Mixture Model to divide pseudo labels into a ‘confident’ and a ‘less confident’ subset. Then, we introduce Relaxed Contrastive Loss by assigning the ‘less-confident’ samples to a hyper-class, i.e. the union of top-K nearest classes, which effectively regularizes the interference of incorrect pseudo labels and even increases the probability of pulling a ‘less confident’ sample close to its true class. Experiments and in-depth studies demonstrate that HyperMatch delivers remarkable state-of-the-art performance, outperforming Fix-Match on CIFAR100 with 400 and 2500 labeled samples by 11.86% and 4.88%, respectively.
Beitong Zhou, Jing Lu 0004, Kerui Liu, Yunlu Xu, Zhanzhan Cheng
CVPR3