mlsanityData to 14 Oct 2026

Blurred Encoding for Trajectory Representation Learning

arXiv 2511.13741 ↗First posted 12 Nov 2025cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Trajectory representation learning (TRL) maps trajectories to vector embeddings and facilitates tasks such as trajectory classification and similarity search. State-of-the-art (SOTA) TRL methods transform raw GPS trajectories to grid or road trajectories to capture high-level travel semantics, i.e., regions and roads. However, they lose fine-grained spatial-temporal details as multiple GPS points are grouped into a single grid cell or road segment. To tackle this problem, we propose the BLUrred Encoding method, dubbed BLUE, which gradually reduces the precision of GPS coordinates to create hierarchical patches with multiple levels. The low-level patches are small and preserve fine-grained spatial-temporal details, while the high-level patches are large and capture overall travel patterns. To complement different patch levels with each other, our BLUE is an encoder-decoder model with a pyramid structure. At each patch level, a Transformer is used to learn the trajectory embedding at the current level, while pooling prepares inputs for the higher level in the encoder, and up-resolution provides guidance for the lower level in the decoder. BLUE is trained using the trajectory reconstruction task with the MSE loss. We compare BLUE with 8 SOTA TRL methods for 3 downstream tasks, the results show that BLUE consistently achieves higher accuracy than all baselines, outperforming the best-performing baselines by an average of 30.90%. Our code is available at https://github.com/slzhou-xy/BLUE.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 24 of its 48 references that are in the map. First posted on arXiv 12 Nov 2025.

Builds on

24 of 48 references.

References · 24

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  5. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  6. 2016Layer Normalizationcited by 5,669
  7. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  8. 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
  9. 2013Visualizing and Understanding Convolutional Networkscited by 2,290
  10. 2022A Time Series is Worth 64 Words: Long-term Forecasting with Transformerscited by 2,039
  11. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  12. 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 506
12 more
  1. 2016A guide to convolution arithmetic for deep learningcited by 185
  2. 2022Self-supervised Trajectory Representation Learning with Temporal Regularities and Travel Semanticscited by 58
  3. 2021MobTCast: Leveraging Auxiliary Trajectory Forecasting for Human Mobility Predictioncited by 48
  4. 2022Contrastive Trajectory Similarity Learning with Dual-Feature Attentioncited by 44
  5. 2021Unsupervised Path Representation Learning with Curriculum Negative Samplingcited by 42
  6. 2022Jointly Contrastive Representation Learning on Road Network and Trajectorycited by 34
  7. 2023LightPath: Lightweight and Scalable Path Representation Learningcited by 32
  8. 2022Pre-training General Trajectory Embeddings with Maximum Multi-view Entropy Codingcited by 25
  9. 2024Trajectory Data Management and Mining: A Survey from Deep Learning to the LLM Eracited by 23
  10. 2024More Than Routing: Joint GPS and Route Modeling for Refine Trajectory Representation Learningcited by 20
  11. 2019A Survey on Map-Matching Algorithmscited by 13
  12. 2024UniTE: A Survey and Unified Pipeline for Pre-training Spatiotemporal Trajectory Embeddingscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 7.

8 papers.