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.
Surprisal-Driven Feedback in Recurrent Networks
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.