So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Quy hoạch động Bayes× | Học tăng cường× | |
|---|---|---|
| Lĩnh vực≠ | Mô phỏng | Học sâu |
| Họ≠ | Process / pipeline | Machine learning |
| Năm ra đời≠ | 1957 (Bellman DP); Bayesian extensions 1990s–2000s | 1950s–1998 |
| Người khởi xướng≠ | Bellman, R.; extended by Bayesian frameworks (Duff, Bertsekas) | Sutton, R. S. & Barto, A. G. (formalised); Bellman, R. (foundations) |
| Loại≠ | Sequential optimization with Bayesian belief updating | Sequential decision-making framework |
| Công trình gốc≠ | Bertsekas, D. P. (1995). Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA. ISBN: 9781886529267 | Sutton, R. S. & Barto, A. G. (2018). Reinforcement Learning: An Introduction (2nd ed.). MIT Press. ISBN: 978-0-262-03924-6 |
| Tên gọi khác | BDP, Bayesian DP, Bayesian sequential optimization, Bayesian stochastic control | RL, reward-based learning, trial-and-error learning, policy optimization |
| Liên quan≠ | 4 | 2 |
| Tóm tắt≠ | Bayesian Dynamic Programming (BDP) combines Bellman's dynamic programming framework with Bayesian inference to optimize sequential decisions when transition probabilities or reward structures are unknown. At each stage, the agent updates beliefs about the environment using observed outcomes, then computes an optimal policy that explicitly accounts for both immediate rewards and the value of information gained through exploration. | Reinforcement Learning (RL) is a framework in which an agent learns to make sequential decisions by interacting with an environment, receiving scalar reward signals, and updating a policy to maximise cumulative future reward. Unlike supervised learning, no labeled examples are provided; the agent discovers optimal behavior entirely through experience and delayed feedback. |
| ScholarGateBộ dữ liệu ↗ |
|
|