Pith. sign in

REVIEW 2 cited by

Extending Memory for Language Modelling

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 2305.11462 v1 pith:5M6TCL23 submitted 2023-05-19 cs.CL

Extending Memory for Language Modelling

classification cs.CL
keywords languagememorylongdatasetlearningnaturalnetworksterm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Breakthroughs in deep learning and memory networks have made major advances in natural language understanding. Language is sequential and information carried through the sequence can be captured through memory networks. Learning the sequence is one of the key aspects in learning the language. However, memory networks are not capable of holding infinitely long sequences in their memories and are limited by various constraints such as the vanishing or exploding gradient problem. Therefore, natural language understanding models are affected when presented with long sequential text. We introduce Long Term Memory network (LTM) to learn from infinitely long sequences. LTM gives priority to the current inputs to allow it to have a high impact. Language modeling is an important factor in natural language understanding. LTM was tested in language modeling, which requires long term memory. LTM is tested on Penn Tree bank dataset, Google Billion Word dataset and WikiText-2 dataset. We compare LTM with other language models which require long term memory.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. The nonlocal attraction-repulsion transport equation with power kernels

    math.AP 2026-07 conditional novelty 7.0

    A proof of global well-posedness, uniform support confinement, a fractional-Laplacian free-boundary characterization of stationary states, and explicit stationary profiles for nonlocal attraction-repulsion continuity ...

  2. The nonlocal attraction-repulsion transport equation with power kernels

    math.AP 2026-07 accept novelty 6.5

    Global Lagrangian well-posedness, uniform support bounds under attraction dominance, free-boundary characterization of zero-flux stationary states, and subsequential convergence are established for the power-kernel at...