Pith. sign in

REVIEW 1 cited by

Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs

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 1705.05742 v3 pith:T47IKCXY submitted 2017-05-16 cs.AI cs.CLcs.LG

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

The availability of large scale event data with time stamps has given rise to dynamically evolving knowledge graphs that contain temporal information for each edge. Reasoning over time in such dynamic knowledge graphs is not yet well understood. To this end, we present Know-Evolve, a novel deep evolutionary knowledge network that learns non-linearly evolving entity representations over time. The occurrence of a fact (edge) is modeled as a multivariate point process whose intensity function is modulated by the score for that fact computed based on the learned entity embeddings. We demonstrate significantly improved performance over various relational learning approaches on two large scale real-world datasets. Further, our method effectively predicts occurrence or recurrence time of a fact which is novel compared to prior reasoning approaches in multi-relational setting.

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. Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures

    cs.LG 2024-12 accept novelty 6.0 of 10

    Truncated backpropagation through time prevents graph recurrent networks from learning multi-hop temporal dependencies, causing large performance gaps on dynamic graph benchmarks.

Pith tools