Pith. sign in

REVIEW 1 cited by

Temporal Domain Generalization with Drift-Aware Dynamic Neural Networks

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 2205.10664 v3 pith:BHRHLDWM submitted 2022-05-21 cs.LG

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

Temporal domain generalization is a promising yet extremely challenging area where the goal is to learn models under temporally changing data distributions and generalize to unseen data distributions following the trends of the change. The advancement of this area is challenged by: 1) characterizing data distribution drift and its impacts on models, 2) expressiveness in tracking the model dynamics, and 3) theoretical guarantee on the performance. To address them, we propose a Temporal Domain Generalization with Drift-Aware Dynamic Neural Network (DRAIN) framework. Specifically, we formulate the problem into a Bayesian framework that jointly models the relation between data and model dynamics. We then build a recurrent graph generation scenario to characterize the dynamic graph-structured neural networks learned across different time points. It captures the temporal drift of model parameters and data distributions and can predict models in the future without the presence of future data. In addition, we explore theoretical guarantees of the model performance under the challenging temporal DG setting and provide theoretical analysis, including uncertainty and generalization error. Finally, extensive experiments on several real-world benchmarks with temporal drift demonstrate the effectiveness and efficiency of the proposed method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. A Generalizable Anomaly Detection Method in Dynamic Graphs

    cs.LG 2024-12 reject novelty 4.0 of 10

    GeneralDyG combines ego-graph sampling, an alternating node/edge GNN, and a transformer to detect anomalies in dynamic graphs, reporting strong results on four benchmarks, though the claimed generalizability is not ac...

Pith tools