Pith. sign in

REVIEW 1 cited by

Learning with Memory Embeddings

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 1511.07972 v9 pith:A6T5ZNPJ submitted 2015-11-25 cs.AI cs.CLcs.LG

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

Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models using latent representations of generalized entities. Latent variable models are well suited to deal with the high dimensionality and sparsity of typical knowledge graphs. In recent publications the embedding models were extended to also consider time evolutions, time patterns and subsymbolic representations. In this paper we map embedding models, which were developed purely as solutions to technical problems for modelling temporal knowledge graphs, to various cognitive memory functions, in particular to semantic and concept memory, episodic memory, sensory memory, short-term memory, and working memory. We discuss learning, query answering, the path from sensory input to semantic decoding, and the relationship between episodic memory and semantic memory. We introduce a number of hypotheses on human memory that can be derived from the developed mathematical models.

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. RECIPE-TKG: From Sparse History to Structured Reasoning for LLM-based Temporal Knowledge Graph Completion

    cs.LG 2025-05 conditional novelty 6.0 of 10

    RECIPE-TKG combines rule-based multi-hop history sampling, contrastive LoRA fine-tuning, and test-time semantic filtering to improve LLM temporal knowledge graph completion, with Hits@10 gains up to 30.6% over prior L...

Pith tools