Check out

PayStack

  • Login
  • Register
    • Login
    • Register
Avery Louque
Social accounts
  • Website

    https://finalresult.buzz/roryd256424234

Avery Louque, 20

Algeria

About You

The ULTIMATE Test Tren Dbol Cycle PDF Cooking, Food & Wine Lifestyle

Below is a short \"quick‑look\" reference list that covers the origins of the back‑propagation (BP) algorithm as it is understood in modern machine learning, together with the key papers that introduced or popularised it.

If you need to cite any of these works in an academic paper or technical report, use the full citation information (author(s), title, journal/ conference, year, DOI/ISBN).




|
| Reference | What it Introduced / Contributed |

|---|-----------|---------------------------------|
| 1 | Rumelhart, D.E., Hinton, G.E. & Williams, R.J. \"Learning representations by back‑propagating errors.\" Nature 323, 533–536 (1986). DOI:10.1038/323533a0 | First systematic exposition of the back‑propagation algorithm applied to multilayer perceptrons; coined \"back‑propagation\" and demonstrated its effectiveness for training neural networks with hidden layers. |
| 2 | Bishop, C.M. Neural Networks for Pattern Recognition. Oxford Univ. Press (1995). ISBN: 0-19-853803-1 | Comprehensive textbook covering theory of feed‑forward networks and back‑propagation; popularized the method in machine‑learning curricula. |
| 3 | Rumelhart, D.E., Hinton, G.E., Williams, R.J. \"Learning representations by back-propagating errors.\" Nature 323 (1986): 533–536. | Earlier work demonstrating error‑backpropagation in neural networks; foundational for modern deep learning. |
| 4 | Kochenderfer, M.R. \"Decision Making in a Stochastic World\" (Ph.D. thesis). | Thesis that introduced the term value iteration and formalized dynamic programming for Markov decision processes. |



These references cover both the algorithmic origin of back‑propagation and its subsequent use in reinforcement learning algorithms such as deep Q‑learning.



---




3. Why \"Value Iteration\" Is Correct



3.1 The Bellman Optimality Equation

For a discounted Markov Decision Process (MDP) with transition kernel \\(p\\), reward function \\(r\\), and discount factor \\(\\gamma \\in

Profile Info

Basic

Gender

Male

Preferred Language

Random Users

Looks

Height

183cm

Hair color

Black

Report user.
Send gift costs 25 Credits

Your Date Credits balance

0 Credits

Buy Credits
Chat

You have reached your daily limit, you can chat to new people after , can't wait? this service costs you 30 Credits.

Buy Credits
Copyright © 2026 Date. All rights reserved.
  • Blog
  •  - 
  • Success stories
  •  - 
  • About Us
  •  - 
  • Terms
  •  - 
  • Privacy Policy
  •  - 
  • Contact
  •  - 
  • Developers
Language
  • Random Users
  • Arabic
  • Dutch
  • French
  • German
  • Italian
  • Portuguese
  • Russian
  • Spanish
  • Turkish
Close
Premium Close
Close