Pith. sign in

REVIEW 2 cited by

KITS: Inductive Spatio-Temporal Kriging with Increment Training Strategy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.02565 v2 pith:B2Y6EDSH submitted 2023-11-05 cs.LG cs.AI

classification cs.LGcs.AI
keywords nodesgraphkrigingtrainingvirtualobservedsensorsincrement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sensors are commonly deployed to perceive the environment. However, due to the high cost, sensors are usually sparsely deployed. Kriging is the tailored task to infer the unobserved nodes (without sensors) using the observed source nodes (with sensors). The essence of kriging task is transferability. Recently, several inductive spatio-temporal kriging methods have been proposed based on graph neural networks, being trained based on a graph built on top of observed nodes via pretext tasks such as masking nodes out and reconstructing them. However, the graph in training is inevitably much sparser than the graph in inference that includes all the observed and unobserved nodes. The learned pattern cannot be well generalized for inference, denoted as graph gap. To address this issue, we first present a novel Increment training strategy: instead of masking nodes (and reconstructing them), we add virtual nodes into the training graph so as to mitigate the graph gap issue naturally. Nevertheless, the empty-shell virtual nodes without labels could have bad-learned features and lack supervision signals. To solve these issues, we pair each virtual node with its most similar observed node and fuse their features together; to enhance the supervision signal, we construct reliable pseudo labels for virtual nodes. As a result, the learned pattern of virtual nodes could be safely transferred to real unobserved nodes for reliable kriging. We name our new Kriging model with Increment Training Strategy as KITS. Extensive experiments demonstrate that KITS consistently outperforms existing kriging methods by large margins, e.g., the improvement over MAE score could be as high as 18.33%.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Network-wide Freeway Traffic Estimation Using Sparse Sensor Data: A Dirichlet Graph Auto-Encoder Approach

    cs.LG 2025-03 unverdicted novelty 6.0 of 10

    DGAE is a new inductive graph model using directed DEFP, latent encoding, and physics-guided pattern-specific propagation to outperform prior methods on sparse-sensor freeway traffic estimation.

  2. AdaKernel: Learning Adaptive Kernel Parameters for Spatiotemporal Graph Neural Networks

    cs.LG 2026-05 unverdicted novelty 5.0 of 10

    AdaKernel learns adaptive kernel scale parameters inside GNNs for spatiotemporal data while preserving geometric structure, with experiments showing gains on kriging, imputation and forecasting tasks.

Pith tools