REFINE: Trajectory Representation Learning via Closed-Loop Transcription -- Extended Version
Not on the map. Why?
Abstract (arXiv)
Trajectory representation learning underpins a wide range of trajectory analytics tasks; however, most existing self-supervised approaches, whether discriminative or generative, adopt an open-loop paradigm, relying on fixed data augmentations or random masking without feedback, which limits their ability to generalize and scale. We propose REFINE, a simple yet effective Representation lEarning Framework vIa closed-loop traNscription rEfinement for trajectory data. Drawing upon feedback control theory, REFINE tightly couples road-network-aware generative reconstruction with feedback-driven contrastive learning, enabling the model to capture fine-grained local movement semantics and global spatio-temporal dependencies without manually designed augmentation views. We further provide a control-theoretic analysis that establishes convergence guarantees for the proposed closed-loop optimization. Extensive experiments on four real-world datasets demonstrate that REFINE consistently outperforms state-of-the-art methods across multiple downstream tasks while remaining computationally efficient and scalable. This paper is an extended version of REFINE: Trajectory Representation Learning via Closed-Loop Transcription, to appear in KDD 2026.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 61 references that are in the map. First posted on arXiv 7 Sep 2026.
Builds on
27 of 61 references.
References · 27
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
- 2016Layer Normalizationcited by 5,669
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2020Understanding the Behaviour of Contrastive Losscited by 398
- 2021Decoupled Contrastive Learningcited by 143
- 2022Self-supervised Trajectory Representation Learning with Temporal Regularities and Travel Semanticscited by 58
- 2022Contrastive Trajectory Similarity Learning with Dual-Feature Attentioncited by 44
- 2021Unsupervised Path Representation Learning with Curriculum Negative Samplingcited by 42
15 more
- 2023LightPath: Lightweight and Scalable Path Representation Learningcited by 32
- 2021Deep Spatially and Temporally Aware Similarity Computation for Road Network Constrained Trajectoriescited by 29
- 2024More Than Routing: Joint GPS and Route Modeling for Refine Trajectory Representation Learningcited by 20
- 2024BIGCity: A Universal Spatiotemporal Model for Unified Trajectory and Traffic State Data Analysiscited by 16
- 2022Weakly-supervised Temporal Path Representation Learning with Contrastive Curriculum Learning -- Extended Versioncited by 15
- 2024MM-Path: Multi-modal, Multi-granularity Path Representation Learning -- Extended Versioncited by 14
- 2025Bridging Traffic State and Trajectory for Dynamic Road Network and Trajectory Representation Learningcited by 14
- 2024RED: Effective Trajectory Representation Learning with Comprehensive Informationcited by 8
- 2025Blurred Encoding for Trajectory Representation Learningcited by 8
- 2024Grid and Road Expressions Are Complementary for Trajectory Representation Learningcited by 7
- 2019PathRank: A Multi-Task Learning Framework to Rank Paths in Spatial Networkscited by 5
- 2023Faster Stochastic Algorithms for Minimax Optimization under Polyak--Lojasiewicz Conditionscited by 5
- 2025RLOMM: An Efficient and Robust Online Map Matching Framework with Reinforcement Learningcited by 3
- 2025Spatio-Temporal Trajectory Foundation Model - Recent Advances and Future Directionscited by 3
- 2026DiffMM: Efficient Method for Accurate Noisy and Sparse Trajectory Map Matching via One Step Diffusioncited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.