A Hybrid Inductive-Transductive Network for Traffic Flow Imputation on Unsampled Locations

• URL: http://arxiv.org/abs/2512.17984v1
• Date: Fri, 19 Dec 2025 14:14:40 GMT
• Title: A Hybrid Inductive-Transductive Network for Traffic Flow Imputation on Unsampled Locations
• Abstract summary: HINT is a hybrid INductive-Transductive Network that treats speed as a transductive, network-wide signal.<n>We show that HINT consistently surpasses state-of-the-art inductive baselines across three datasets.
• Score: 0.06511386778499104
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurately imputing traffic flow at unsensed locations is difficult: loop detectors provide precise but sparse measurements, speed from probe vehicles is widely available yet only weakly correlated with flow, and nearby links often exhibit strong heterophily in the scale of traffic flow (e.g., ramps vs. mainline), which breaks standard GNN assumptions. We propose HINT, a Hybrid INductive-Transductive Network, and an INDU-TRANSDUCTIVE training strategy that treats speed as a transductive, network-wide signal while learning flow inductively to generalize to unseen locations. HINT couples (i) an inductive spatial transformer that learns similarity-driven, long-range interactions from node features with (ii) a diffusion GCN conditioned by FiLM on rich static context (OSM-derived attributes and traffic simulation), and (iii) a node-wise calibration layer that corrects scale biases per segment. Training uses masked reconstruction with epoch-wise node sampling, hard-node mining to emphasize difficult sensors, and noise injection on visible flows to prevent identity mapping, while graph structure is built from driving distances. Across three real-world datasets, MOW (Antwerp, Belgium), UTD19-Torino, and UTD19-Essen, HINT consistently surpasses state-of-the-art inductive baselines. Relative to KITS, HINT reduces MAE on MOW by $\approx42$% with basic simulation and $\approx50$% with calibrated simulation; on Torino by $\approx22$%, and on Essen by $\approx12$%. Even without simulation, HINT remains superior on MOW and Torino, while simulation is crucial on Essen. These results show that combining inductive flow imputation with transductive speed, traffic simulations and external geospatial improves accuracy for the task described above.

Related papers

• Fluid-DiT: Graph-Free Diffusion Transformers for Fluid Flow Simulations Learning [50.053186229257555]
  We propose a Graph-Free Diffusion Transformer that replaces graph message passing with attention-based denoising.<n>By leveraging the transformer's global receptive field, Fluid-DiT naturally captures both local flow structures and long-range correlations.<n>It consistently outperforms graph-based diffusion baselines in both sample quality and distributional accuracy.
  arXiv  Detail & Related papers  (2026-08-07T12:28:45Z)
• Graph Neural ODE Digital Twins for Control-Oriented Reactor Thermal-Hydraulic Forecasting Under Partial Observability [6.370970195988317]
  Real-time supervisory control of advanced reactors requires accurate forecasting of plant-wide thermalhydraulic states.<n>We present a physics-informed message-passing Differential Neural Network and a Neural Ordinary Equation (GNN-ODE)<n>The GNN-ODE surrogate achieves satisfactory results for the system dynamics prediction.
  arXiv  Detail & Related papers  (2026-04-08T16:58:14Z)
• Riemannian MeanFlow for One-Step Generation on Manifolds [54.09734511705173]
  Flow Matching enables simulation-free training of generative models.<n>MeanFlow can be extended to manifold-valued generation where velocities lie in location-dependent tangent spaces.<n>Experiments on spheres, tori, and SO(3) demonstrate competitive one-step sampling with improved quality-efficiency trade-offs and substantially reduced sampling cost.
  arXiv  Detail & Related papers  (2026-03-11T12:41:46Z)
• Graph Flow Matching: Enhancing Image Generation with Neighbor-Aware Flow Fields [19.09766809443072]
  Flow matching casts sample generation as learning a continuous-time velocity field that transports noise to data.<n>We propose Graph Flow Matching, a lightweight enhancement that decomposes the learned velocity into a reaction term.<n> operating in the latent space of a pretrained variational autoencoder.
  arXiv  Detail & Related papers  (2025-05-30T10:17:50Z)
• A Double-Norm Aggregated Tensor Latent Factorization Model for Temporal-Aware Traffic Speed Imputation [2.2083091880368855]
  In intelligent transportation systems (ITS), traffic management departments rely on sensors, cameras, and GPS devices to collect real-time traffic data.<n>Currently, tensor decomposition based methods are extensively utilized, they mostly rely on the $L$-norm to construct their learning objectives.<n>We propose Temporal-Aware Traffic Speed Imputation (TATSI), which combines the $L$-norm and smooth $SL$ ($SL$)-norm in its loss function.
  arXiv  Detail & Related papers  (2025-04-24T02:00:41Z)
• m4: A Learned Flow-level Network Simulator [14.802940782072122]
  Flow-level simulators abstract traffic as continuous flows with dynamically assigned transmission rates.<n>We present m4, an accurate and scalable flow-level simulator that uses machine learning to learn the dynamics of the network of interest.
  arXiv  Detail & Related papers  (2025-03-03T17:51:08Z)
• Improving Traffic Flow Predictions with SGCN-LSTM: A Hybrid Model for Spatial and Temporal Dependencies [55.2480439325792]
  This paper introduces the Signal-Enhanced Graph Convolutional Network Long Short Term Memory (SGCN-LSTM) model for predicting traffic speeds across road networks. Experiments on the PEMS-BAY road network traffic dataset demonstrate the SGCN-LSTM model's effectiveness.
  arXiv  Detail & Related papers  (2024-11-01T00:37:00Z)
• MTDT: A Multi-Task Deep Learning Digital Twin [8.600701437207725]
  We present a comprehensive traffic flow simulation utilizing a multi-task learning paradigm.<n>Compared to existing deep learning methodologies, the Multi-Task Deep Learning Twin (MTDT) distinguishes itself through its adaptability to local temporal and spatial features.<n>We also show the benefit of multi-task learning in the effectiveness of individual traffic simulation tasks.
  arXiv  Detail & Related papers  (2024-05-02T00:34:10Z)
• GAFlow: Incorporating Gaussian Attention into Optical Flow [62.646389181507764]
  We push Gaussian Attention (GA) into the optical flow models to accentuate local properties during representation learning. We introduce a novel Gaussian-Constrained Layer (GCL) which can be easily plugged into existing Transformer blocks. For reliable motion analysis, we provide a new Gaussian-Guided Attention Module (GGAM)
  arXiv  Detail & Related papers  (2023-09-28T07:46:01Z)
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach [76.45949280328838]
  We propose a Laplacian enhanced low-rank tensor (LETC) framework featuring both lowrankness and multi-temporal correlations for large-scale traffic speed kriging. We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging.
  arXiv  Detail & Related papers  (2022-10-21T07:25:57Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)
• Road Network Guided Fine-Grained Urban Traffic Flow Inference [108.64631590347352]
  Accurate inference of fine-grained traffic flow from coarse-grained one is an emerging yet crucial problem. We propose a novel Road-Aware Traffic Flow Magnifier (RATFM) that exploits the prior knowledge of road networks. Our method can generate high-quality fine-grained traffic flow maps.
  arXiv  Detail & Related papers  (2021-09-29T07:51:49Z)
• Constructing Geographic and Long-term Temporal Graph for Traffic Forecasting [88.5550074808201]
  We propose Geographic and Long term Temporal Graph Convolutional Recurrent Neural Network (GLT-GCRNN) for traffic forecasting. In this work, we propose a novel framework for traffic forecasting that learns the rich interactions between roads sharing similar geographic or longterm temporal patterns.
  arXiv  Detail & Related papers  (2020-04-23T03:50:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.