ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

深度强化学习×动态规划×策略梯度方法×
领域深度学习优化机器学习
方法族Machine learningProcess / pipelineMachine learning
起源年份201519571992
提出者Mnih, V. et al. (DQN)Richard BellmanRonald Williams (REINFORCE); Sutton et al. (policy gradient theorem)
类型Sequential decision-making (agent–environment interaction)Exact combinatorial optimization via recursive decompositionPolicy-based reinforcement learning
开创性文献Mnih, V. et al. (2015). Human-Level Control through Deep Reinforcement Learning. Nature, 518, 529–533. DOI ↗Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8(3–4), 229–256. DOI ↗
别名Derin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRLDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik ProgramlamaREINFORCE, actor-critic, policy optimization, politika gradyanı
相关434
摘要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.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.Policy gradient methods are reinforcement-learning algorithms that optimize a parameterized policy directly by gradient ascent on the expected return, rather than learning action-values and acting greedily. Founded on Ronald Williams' 1992 REINFORCE algorithm and the policy gradient theorem of Sutton and colleagues (2000), they naturally handle stochastic and continuous action spaces and underpin modern actor-critic and deep-RL algorithms.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Deep Reinforcement Learning · Dynamic Programming · Policy Gradient. 于 2026-06-17 检索自 https://scholargate.app/zh/compare