Landmark learning: An illustration of associative search

By Andrew Barto, Richard S. Sutton. 1981

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Thomas Unterthiner
2. Michael Widrich
3. José Antonio Arjona-Medina
4. J. Urgen Schmidhuber
5. Wojciech Samek
6. Michael Gillhofer
7. Yoshua Bengio
8. Sepp Hochreiter

Citations in the corpus

• RUDDER: Return Decomposition for Delayed Rewards (2018, background): “g), A a0(:) = P a0ˇ(a 0js t+1)(:) (expected SARSA), A a0(:) sample a0from ˇ(a0js t+1) (SARSA). The next theorem states that TD has an exponential decay for Q-value updates even for eligibility traces [56,6,106,99]. Theorem 2. For initialization q0(s t;a t) = 0 and delayed reward with r t = 0 for t 6”