Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Învățare prin consolidare profundă× | Pădurea Aleatoare (Random Forest)× | |
|---|---|---|
| Domeniu≠ | Învățare profundă | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2015 | 2001 |
| Autorul original≠ | Mnih, V. et al. (DQN) | Breiman, L. |
| Tip≠ | Sequential decision-making (agent–environment interaction) | Ensemble (bagging of decision trees) |
| Sursa seminală≠ | Mnih, V. et al. (2015). Human-Level Control through Deep Reinforcement Learning. Nature, 518, 529–533. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Denumiri alternative≠ | Derin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRL | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Înrudite | 4 | 4 |
| Rezumat≠ | Deep Reinforcement Learning combines neural networks with reinforcement learning so an agent learns by interacting with an environment, popularised by Mnih and colleagues' 2015 Nature work on human-level Atari control. Instead of learning from a fixed labelled dataset, the agent takes actions, observes rewards, and gradually shapes a policy that maximises long-run return. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateSet de date ↗ |
|
|