paper-with-me

Papers

When the Future Becomes the Past: Taming Temporal Correspondence for Self-supervised Video Representation Learning

2025-03-19 · CVPR 2025 1 · Yang Liu, Qianqian Xu, Peisong Wen, Siran Dai, Qingming Huang

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.

📄 PDF Abstract BibTeX arXiv:2503.15096

Code (1)

yafeng19/t-core 공식 구현 pytorch

Tasks

Representation LearningSelf-Supervised Learning

Methods 이 논문이 사용한 방법론

ADOPT Please enter a description about the method here

Similar Papers 제목 키워드 기반

Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs

2020-11-01 · EMNLP 2020 11 · Woojeong Jin, Meng Qu, Xisen Jin, Xiang Ren

Knowledge graph reasoning is a critical task in natural language processing. The task becomes more challenging on temporal knowledge graphs, where each fact is associated with a timestamp. Most existing methods focus on …

Knowledge GraphsLink PredictionTemporal Sequences

Recurrent Event Network: Autoregressive Structure Inference over Temporal Knowledge Graphs

2019-04-11 · Woojeong Jin, Meng Qu, Xisen Jin, Xiang Ren

Knowledge graph reasoning is a critical task in natural language processing. The task becomes more challenging on temporal knowledge graphs, where each fact is associated with a timestamp. Most existing methods focus on …

Knowledge GraphsLink PredictionTemporal Sequences

TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction

2025-10-23 · Zhongyi Yu, Jianqiu Wu, Zhenghao Wu, Shuhan Zhong 외 arxiv

Temporal graph link prediction aims to predict future interactions between nodes in a graph based on their historical interactions, which are encoded in node embeddings. We observe that heterogeneity naturally appears in…

Link Prediction

Taming Reasoning in Temporal Probabilistic Relational Models

2019-11-16 · Marcel Gehrke, Ralf Möller, Tanya Braun

Evidence often grounds temporal probabilistic relational models over time, which makes reasoning infeasible. To counteract groundings over time and to keep reasoning polynomial by restoring a lifted representation, we pr…

Clustering

Structured yet Bounded Temporal Understanding in Large Language Models

2025-10-19 · Damin Zhang, Julia Rayz arxiv

Large language models (LLMs) increasingly show strong performance on temporally grounded tasks, such as timeline construction, temporal question answering, and event ordering. However, it remains unclear how their behavi…

Question Answering