mlsanityData to 14 Oct 2026

Robust Tensor Completion via Gradient Tensor Nulclear L1-L2 Norm for Traffic Data Recovery

arXiv 2506.22732 ↗First posted 28 Jun 2025cs.LG eess.SP stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

In real-world scenarios, spatiotemporal traffic data frequently experiences dual degradation from missing values and noise caused by sensor malfunctions and communication failures. Therefore, effective data recovery methods are essential to ensure the reliability of downstream data-driven applications. while classical tensor completion methods have been widely adopted, they are incapable of modeling noise, making them unsuitable for complex scenarios involving simultaneous data missingness and noise interference. Existing Robust Tensor Completion (RTC) approaches offer potential solutions by separately modeling the actual tensor data and noise. However, their effectiveness is often constrained by the over-relaxation of convex rank surrogates and the suboptimal utilization of local consistency, leading to inadequate model accuracy. To address these limitations, we first introduce the tensor L1-L2 norm, a novel non-convex tensor rank surrogate that functions as an effective low-rank representation tool. Leveraging an advanced feature fusion strategy, we further develop the gradient tensor L1-L2 norm by incorporating the tensor L1-L2 norm in the gradient domain. By integrating the gradient tensor nuclear L1-L2 norm into the RTC framework, we propose the Robust Tensor Completion via Gradient Tensor Nuclear L1-L2 Norm (RTC-GTNLN) model, which not only fully exploits both global low-rankness and local consistency without trade-off parameter, but also effectively handles the dual degradation challenges of missing data and noise in traffic data. Extensive experiments conducted on multiple real-world traffic datasets demonstrate that the RTC-GTNLN model consistently outperforms existing state-of-the-art methods in complex recovery scenarios involving simultaneous missing values and noise.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 70 references that are in the map. First posted on arXiv 28 Jun 2025.

Builds on

18 of 70 references.

References · 18

  1. 2016Tensor Ring Decompositioncited by 127
  2. 2015Exact tensor completion using t-SVDcited by 70
  3. 2019Bayesian Temporal Factorization for Multidimensional Time Series Predictioncited by 47
  4. 2023Guaranteed Tensor Recovery Fused Low-rankness and Smoothnesscited by 41
  5. 2021Low-Rank Autoregressive Tensor Completion for Spatiotemporal Traffic Data Imputationcited by 35
  6. 2020A Nonconvex Low-Rank Tensor Completion Model for Spatiotemporal Traffic Data Imputationcited by 27
  7. 2021Low-Rank Hankel Tensor Completion for Traffic Speed Estimationcited by 22
  8. 2022Exact Decomposition of Joint Low Rankness and Local Smoothness Plus Sparse Matricescited by 19
  9. 2022Laplacian Convolutional Representation for Traffic Time Series Imputationcited by 18
  10. 2022Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approachcited by 17
  11. 2016Fast L1-L2 minimization via a proximal operatorcited by 16
  12. 2020Scalable Low-Rank Tensor Learning for Spatiotemporal Traffic Data Imputationcited by 12
6 more
  1. 2022Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patternscited by 11
  2. 2021Spatiotemporal Tensor Completion for Improved Urban Traffic Imputationcited by 9
  3. 2023Traffic State Estimation from Vehicle Trajectories with Anisotropic Gaussian Processescited by 6
  4. 2020An Inexact Accelerated Stochastic ADMM for Separable Convex Optimizationcited by 5
  5. 2018Generalized Symmetric ADMM for Separable Convex Optimizationcited by 3
  6. 2024Generalized Least Squares Kernelized Tensor Factorizationcited by 1

Built on by

Not cited yet.