mlsanityData to 7 Oct 2026

Non-Neighbors Also Matter to Kriging: A New Contrastive-Prototypical Learning

arXiv 2401.12681 ↗First posted 23 Jan 2024cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Kriging aims at estimating the attributes of unsampled geo-locations from observations in the spatial vicinity or physical connections, which helps mitigate skewed monitoring caused by under-deployed sensors. Existing works assume that neighbors' information offers the basis for estimating the attributes of the unobserved target while ignoring non-neighbors. However, non-neighbors could also offer constructive information, and neighbors could also be misleading. To this end, we propose ``Contrastive-Prototypical'' self-supervised learning for Kriging (KCP) to refine valuable information from neighbors and recycle the one from non-neighbors. As a pre-trained paradigm, we conduct the Kriging task from a new perspective of representation: we aim to first learn robust and general representations and then recover attributes from representations. A neighboring contrastive module is designed that coarsely learns the representations by narrowing the representation distance between the target and its neighbors while pushing away the non-neighbors. In parallel, a prototypical module is introduced to identify similar representations via exchanged prediction, thus refining the misleading neighbors and recycling the useful non-neighbors from the neighboring contrast component. As a result, not all the neighbors and some of the non-neighbors will be used to infer the target. To encourage the two modules above to learn general and robust representations, we design an adaptive augmentation module that incorporates data-driven attribute augmentation and centrality-based topology augmentation over the spatiotemporal Kriging graph data. Extensive experiments on real-world datasets demonstrate the superior performance of KCP compared to its peers with 6% improvements and exceptional transferability and robustness. The code is available at https://github.com/bonaldli/KCP

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 36 of its 74 references that are in the map. First posted on arXiv 23 Jan 2024.

Builds on

36 of 74 references.

References · 36

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Inductive Representation Learning on Large Graphscited by 6,284
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  4. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  5. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  7. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  8. 2017Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecastingcited by 1,125
  9. 2019Graph WaveNet for Deep Spatial-Temporal Graph Modelingcited by 820
  10. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  11. 2020Adaptive Graph Convolutional Recurrent Network for Traffic Forecastingcited by 525
  12. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
24 more
  1. 2021Graph Self-Supervised Learning: A Surveycited by 289
  2. 2021Unsupervised Representation Learning for Time Series with Temporal Neighborhood Codingcited by 223
  3. 2017Positive-Unlabeled Learning with Non-Negative Risk Estimatorcited by 217
  4. 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
  5. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
  6. 2020When Does Self-Supervision Help Graph Convolutional Networks?cited by 121
  7. 2020Inductive Graph Neural Networks for Spatiotemporal Krigingcited by 90
  8. 2022Multivariate Time Series Forecasting with Dynamic Graph Neural ODEscited by 72
  9. 2020Self-PU: Self Boosted and Calibrated Positive-Unlabeled Trainingcited by 47
  10. 2022Jointly Contrastive Representation Learning on Road Network and Trajectorycited by 34
  11. 2014Provable Tensor Factorization with Missing Datacited by 31
  12. 2019Tensor Completion for Weakly-dependent Data on Graph for Metro Passenger Flow Predictioncited by 30
  13. 2023Kriging Convolutional Networkscited by 30
  14. 2021Spatial Aggregation and Temporal Convolution Networks for Real-time Krigingcited by 27
  15. 2023INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Krigingcited by 27
  16. 2021Positional Encoder Graph Neural Networks for Geographic Datacited by 20
  17. 2022DR.VIC: Decomposition and Reasoning for Video Individual Countingcited by 18
  18. 2022Fast-MoCo: Boost Momentum-based Contrastive Learning with Combinatorial Patchescited by 16
  19. 2021Self-supervised Consensus Representation Learning for Attributed Graphcited by 15
  20. 2023Dynamic Causal Graph Convolutional Network for Traffic Predictioncited by 12
  21. 2019Scalable Probabilistic Matrix Factorization with Graph-Based Priorscited by 8
  22. 2021Short-term Renewable Energy Forecasting in Greece using Prophet Decomposition and Tree-based Ensemblescited by 4
  23. 2022Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inferencecited by 4
  24. 2022Graph Neural Networks with Precomputed Node Featurescited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 0; 2026: 1.

5 papers.