Skip to content
Open access

AutoPRL: Automated Path Representation Learning via Learnable View Generator

Oct 2026 · IEEE Transactions on Knowledge and Data Engineering · pp. 1-16 · 0 citations · 43 references
Computer Science

TL;DR

This work proposes AutoPRL, an effective and efficient self-supervised PRL framework that integrates three key components that improves training efficiency by disentangling the optimization of positive and negative pairs across node- and path-level views, enabling more stable contrastive learning.

Abstract

Self-supervised learning has emerged as a powerful paradigm for Path Representation Learning (PRL) in road networks. PRL aims to learn informative representations of paths traversed by moving objects, such as vehicles, where each path consists of a sequence of connected road segments. These representations are essential for various downstream tasks, including travel-time estimation and path ranking. However, existing methods often suffer from ineffective view generation and inefficient training procedures due to their reliance on heuristic augmentations and computationally intensive contrastive learning. To address these issues, we propose AutoPRL, an effective and efficient self-supervised PRL framework that integrates three key components. The Automatic Data Augmentation (AutoDA) module employs variational autoencoders to generate semantically meaningful and diverse feature-level path views by modeling each topology-aware node embedding with a Gaussian latent distribution, thereby mitigating information loss and enhancing representation quality. Second, the Cross-View Decoupled Contrastive (CVDC) learning mechanism improves training efficiency by disentangling the optimization of positive and negative pairs across node- and path-level views, enabling more stable contrastive learning. Third, an Adaptive Co-Training (ACT) module dynamically adjusts uncertainty-based loss weights to balance multiple objectives, ensuring efficient and scalable training. Extensive experiments on three real-world datasets demonstrate that AutoPRL achieves strong and consistent performance in both effectiveness and efficiency across multiple downstream tasks.

Read PDF

Similar papers

#machine learning Preprint Oct 2026

Optimization Encoders: Rethinking Second-Order Meta-Learning for Neural Fields

Conditional neural fields represent signals continuously, but their effectiveness depends on how the conditional latent representations are inferred from observed data. In meta-learning, this encoding occurs through gradient updates induced by the decoder, tying representation learning directly to decoder design. We fo...

R. L. M. van Herten, Soufiane Ben Haddou, Rachit Saluja et al. · 0 citations
Preprint Oct 2026

MoETok: Sparse Expert Routing for 1D Visual Tokenizers

Modern visual tokenizers aim to preserve fine-grained visual details while learning high-level semantic representations for downstream generation and understanding. Query-based 1D visual tokenizers encode images into flexible latent sequences, yet how individual learnable queries gather and encode image information rem...

Jia-Hao Guo, Bao Tang, Hao-Xiang Cao et al. · 0 citations

Data Unlearning via Inverse Distillation

Multi-step matching models, including flow and diffusion models, produce high-quality outputs but incur substantial inference costs and may reproduce unwanted components of their training datasets. We introduce Inverse Distillation Unlearning (IDU), a unified framework that simultaneously distills a teacher multi-step...

Aleksei Leonov, N. Kornilov, Zhen-He Zhang et al. · 0 citations
Preprint Oct 2026

CoVA: Composing VAE Representations for Generative Learning

CoVA is introduced, a lightweight framework that composes VAE features online into stage-wise guidance for flow-matching training, and uncovers a hidden confound in soft label conditioning: averaging class embeddings attenuates their magnitude, coupling semantic interpolation with conditioning strength.

Zhao-Wei Chen, Yi-Kai Ge, Lin-Ze Li et al. · 0 citations
Preprint Oct 2026

Implicit Feature Reweighting for Label-Free Graph Generalization

Graph-level out-of-distribution (OOD) generalization is critical for deploying graph neural networks in real-world applications where distribution shifts are inevitable. Existing approaches typically require class labels during representation learning to decide which substructures are predictive, limiting their applica...

Tian-Jun Yao, Cheng-Hu Xi, Xin-Yang Li et al. · 0 citations
Book Open access Nov 2026

ID2GL: Incremental Node Representation Learning on Large-Scale Dynamic Directed Graphs

Node representation learning on dynamic graphs is a fundamental task for numerous real-world applications. However, existing dynamic Graph Neural Networks (GNNs) face two critical challenges: (1) the inability to effectively model crucial directional information inherent in many real-world interactions, and (2) suffer...

Ze-Ning Li, Rong-Hua Li, Yi-Chun Yang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.