ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Динамично оптимиране×Дълбоко обучение с подкрепление×
ОбластОптимизацияДълбоко обучение
СемействоProcess / pipelineMachine learning
Година на възникване19572015
СъздателRichard BellmanMnih, V. et al. (DQN)
ТипExact combinatorial optimization via recursive decompositionSequential decision-making (agent–environment interaction)
Основополагащ източникBellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6Mnih, V. et al. (2015). Human-Level Control through Deep Reinforcement Learning. Nature, 518, 529–533. DOI ↗
Други названияDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik ProgramlamaDerin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRL
Свързани34
РезюмеDynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.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.
ScholarGateНабор от данни
  1. v1
  2. 1 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Dynamic Programming · Deep Reinforcement Learning. Извлечено на 2026-06-15 от https://scholargate.app/bg/compare