paper-with-me

Papers

Sparse Attentive Backtracking: Temporal CreditAssignment Through Reminding

2018-09-11 · Nan Rosemary Ke, Anirudh Goyal, Olexa Bilaniuk, Jonathan Binas, Michael C. Mozer, Chris Pal, Yoshua Bengio

Learning long-term dependencies in extended temporal sequences requires credit assignment to events far back in the past. The most common method for training recurrent neural networks, back-propagation through time (BPTT), requires credit information to be propagated backwards through every single step of the forward computation, potentially over thousands or millions of time steps. This becomes computationally expensive or even infeasible when used with long sequences. Importantly, biological brains are unlikely to perform such detailed reverse replay over very long sequences of internal states (consider days, months, or years.) However, humans are often reminded of past memories or mental states which are associated with the current mental state. We consider the hypothesis that such memory associations between past and present could be used for credit assignment through arbitrarily long sequences, propagating the credit assigned to the current state to the associated past state. Based on this principle, we study a novel algorithm which only back-propagates through a few of these temporal skip connections, realized by a learned attention mechanism that associates current states with relevant past states. We demonstrate in experiments that our method matches or outperforms regular BPTT and truncated BPTT in tasks involving particularly long-term dependencies, but without requiring the biologically implausible backward replay through the whole history of states. Additionally, we demonstrate that the proposed method transfers to longer sequences significantly better than LSTMs trained with BPTT and LSTMs trained with full self-attention.

📄 PDF Abstract BibTeX arXiv:1809.03702

Code (0)

등록된 구현이 없습니다.

Tasks

Temporal Sequences

Similar Papers 제목 키워드 기반

Sparse Attentive Backtracking: Long-Range Credit Assignment in Recurrent Networks

2017-11-07 · ICLR 2018 1 · Nan Rosemary Ke, Anirudh Goyal, Olexa Bilaniuk, Jonathan Binas 외

A major drawback of backpropagation through time (BPTT) is the difficulty of learning long-term dependencies, coming from having to propagate credit information backwards through every single step of the forward computat…

Sparse Attentive Backtracking: Temporal Credit Assignment Through Reminding

2018-12-01 · NeurIPS 2018 12 · Nan Rosemary Ke, Anirudh Goyal Alias Parth Goyal, Olexa Bilaniuk, Jonathan Binas 외

Learning long-term dependencies in extended temporal sequences requires credit assignment to events far back in the past. The most common method for training recurrent neural networks, back-propagation through time (BPTT…

Temporal Sequences

Multi-axis Attentive Prediction for Sparse EventData: An Application to Crime Prediction

2021-10-05 · Yi Sui, Ga Wu, Scott Sanner

Spatiotemporal prediction of event data is a challenging task with a long history of research. While recent work in spatiotemporal prediction has leveraged deep sequential models that substantially improve over classical…

Contrastive LearningCrime PredictionPrediction

An Empirical Analysis of Recurrent Learning Algorithms In Neural Lossy Image Compression Systems

2022-01-27 · Ankur Mali, Alexander Ororbia, Daniel Kifer, Lee Giles

Recent advances in deep learning have resulted in image compression algorithms that outperform JPEG and JPEG 2000 on the standard Kodak benchmark. However, they are slow to train (due to backprop-through-time) and, to th…

DecoderImage Compression

Online Attentive Kernel-Based Temporal Difference Learning

2022-01-22 · Guang Yang, Xingguo Chen, Shangdong Yang, Huihui Wang 외

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers fr…

AcrobotReinforcement Learning (RL)