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.

Yang Liu 0350

dblp:51/3710-350 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0008-3676-0921ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
Video understanding and tracking · 75% Representation and self-supervised learning · 25%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked modeling
masked video modeling
0.912025
When the Future Becomes the Past: Taming Temporal Correspondence for Self-supervised Video Representation Learning · CVPR 2025
Computer vision › Video understanding and tracking › video representation learning
self-supervised video representation learning
0.912025
When the Future Becomes the Past: Taming Temporal Correspondence for Self-supervised Video Representation Learning · CVPR 2025
Computer vision › Video understanding and tracking
temporal alignment
0.912025
When the Future Becomes the Past: Taming Temporal Correspondence for Self-supervised Video Representation Learning · CVPR 2025
Computer vision › Video understanding and tracking
video representation learning
0.912025
When the Future Becomes the Past: Taming Temporal Correspondence for Self-supervised Video Representation Learning · CVPR 2025
Information retrieval
retrieval models
0.812024
Not All Pairs are Equal: Hierarchical Learning for Average-Precision-Oriented Video Retrieval · ACM Multimedia 2024
Information retrieval
similarity measure
0.812024
Not All Pairs are Equal: Hierarchical Learning for Average-Precision-Oriented Video Retrieval · ACM Multimedia 2024
Information retrieval › multimedia analysis and retrieval
video retrieval
0.812024
Not All Pairs are Equal: Hierarchical Learning for Average-Precision-Oriented Video Retrieval · ACM Multimedia 2024
Information retrieval › evaluation › effectiveness metrics
average precision
0.212024
Not All Pairs are Equal: Hierarchical Learning for Average-Precision-Oriented Video Retrieval · ACM Multimedia 2024

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

self-distillation · 0.9masked autoencoder · 0.9pairwise loss · 0.8hierarchical learning · 0.8QuadLinear-AP loss · 0.8
YearPublicationVenuePosition
2025 When the Future Becomes the Past: Taming Temporal Correspondence for Self-supervised Video Representation Learning
abstract
The past decade has witnessed notable achievements in self-supervised learning for video tasks. Recent efforts typically adopt the Masked Video Modeling (MVM) paradigm, leading to significant progress on multiple video tasks. However, two critical challenges remain: 1) Without human annotations, the random temporal sampling introduces uncertainty, increasing the difficulty of model training. 2) Previous MVM methods primarily recover the masked patches in the pixel space, leading to insufficient information compression for downstream tasks. To address these challenges jointly, we propose a self-supervised framework that leverages Temporal Correspondence for video Representation learning (T-CoRe). For challenge 1), we propose a sandwich sampling strategy that selects two auxiliary frames to reduce reconstruction uncertainty in a two-side-squeezing manner. Addressing challenge 2), we introduce an auxiliary branch into a self-distillation architecture to restore representations in the latent space, generating high-level semantic representations enriched with temporal information. Experiments of T-CoRe consistently present superior performance across several downstream tasks, demonstrating its effectiveness for video representation learning. The code is available at https://github.com/yafeng19/T-CORE.
Yang Liu 0350, Qianqian Xu 0001, Peisong Wen, Siran Dai, Qingming Huang
CVPR1
2025 Exploring Structural Degradation in Dense Representations for Self-supervised Learning
abstract
In this work, we observe a counterintuitive phenomenon in self-supervised learning (SSL): longer training may impair the performance of dense prediction tasks (e.g., semantic segmentation). We refer to this phenomenon as Self-supervised Dense Degradation (SDD) and demonstrate its consistent presence across sixteen state-of-the-art SSL methods with various losses, architectures, and datasets. When the model performs suboptimally on dense tasks at the end of training, measuring the performance during training becomes essential. However, evaluating dense performance effectively without annotations remains an open challenge. To tackle this issue, we introduce a Dense representation Structure Estimator (DSE), composed of a class-relevance measure and an effective dimensionality measure. The proposed DSE is both theoretically grounded and empirically validated to be closely correlated with the downstream performance. Based on this metric, we introduce a straightforward yet effective model selection strategy and a DSE-based regularization method. Experiments on sixteen SSL methods across four benchmarks confirm that model selection improves mIoU by $3.0\\%$ on average with negligible computational cost. Additionally, DSE regularization consistently mitigates the effects of dense degradation. Code is available at \url{https://github.com/EldercatSAM/SSL-Degradation}.
Siran Dai, Qianqian Xu 0001, Peisong Wen, Yang Liu 0350, Qingming Huang
NeurIPS4
2024 Not All Pairs are Equal: Hierarchical Learning for Average-Precision-Oriented Video Retrieval
abstract
The rapid growth of online video resources has significantly promoted the development of video retrieval methods. As a standard evaluation metric for video retrieval, Average Precision (AP) assesses the overall rankings of relevant videos at the top list, making the predicted scores a reliable reference for the users. However, recent video retrieval methods utilize pair-wise losses that treat all sample pairs equally, leading to an evident gap between the training objective and evaluation metric. To effectively bridge this gap, in this work, we aim to address two primary challenges: a) The current similarity measure and AP-based loss are suboptimal for video retrieval; b) The noticeable noise from frame-to-frame matching introduces ambiguity in estimating the AP loss. In response to these challenges, we propose the Hierarchical learning framework for Average-Precision-oriented Video Retrieval (HAP-VR). For the former challenge, we develop the TopK-Chamfer Similarity and QuadLinear-AP loss to measure and optimize video-level similarities in terms of AP. For the latter challenge, we suggest constraining the frame-level similarities to achieve an accurate AP loss estimation. Experimental results present that HAP-VR outperforms existing methods on several benchmark datasets, providing a feasible solution for video retrieval tasks and thus offering potential benefits for the multi-media application.
Yang Liu 0350, Qianqian Xu 0001, Peisong Wen, Siran Dai, Qingming Huang
ACM Multimedia1