REVIEW 1 cited by
Surprisal-Driven Feedback in Recurrent 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
read the original abstract
Recurrent neural nets are widely used for predicting temporal data. Their inherent deep feedforward structure allows learning complex sequential patterns. It is believed that top-down feedback might be an important missing ingredient which in theory could help disambiguate similar patterns depending on broader context. In this paper we introduce surprisal-driven recurrent networks, which take into account past error information when making new predictions. This is achieved by continuously monitoring the discrepancy between most recent predictions and the actual observations. Furthermore, we show that it outperforms other stochastic and fully deterministic approaches on enwik8 character level prediction task achieving 1.37 BPC on the test portion of the text.
Forward citations
Cited by 1 Pith paper
-
Never Reset Again: A Mathematical Framework for Continual Inference in Recurrent Neural Networks
A dual cross-entropy and KL-divergence loss lets recurrent networks maintain stable accuracy over very long streams without hidden-state resets, matching and sometimes slightly beating periodic reset baselines.
Discussion (0). Continue with ORCID to comment.