Spectral Temporal Contrastive Learning
원문 초록
Learning useful data representations without requiring labels is a cornerstone of modern deep learning. Self-supervised learning methods, particularly contrastive learning (CL), have proven successful by leveraging data augmentations to define positive pairs. This success has prompted a number of theoretical studies to better understand CL and investigate theoretical bounds for downstream linear probing tasks. This work is concerned with the temporal contrastive learning (TCL) setting where the sequential structure of the data is used instead to define positive pairs, which is more commonly used in RL and robotics contexts. In this paper, we adapt recent work on Spectral CL to formulate Spectral Temporal Contrastive Learning (STCL). We discuss a population loss based on a state graph derived from a time-homogeneous reversible Markov chain with uniform stationary distribution. The STCL loss enables to connect the linear probing performance to the spectral properties of the graph, and can be estimated by considering previously observed data sequences as an ensemble of MCMC chains.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Boosting Generative Adversarial Transferability with Self-supervised Vision Transformer Features
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
Rethinking Contrastive Learning in Session-based Recommendation
Spatio-Temporal Joint Density Driven Learning for Skeleton-Based Action Recognition
Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning
CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.