ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

강화학습×정책 경사도 방법×
분야딥러닝머신러닝
계열Machine learningMachine learning
기원 연도1950s–19981992
창시자Sutton, R. S. & Barto, A. G. (formalised); Bellman, R. (foundations)Ronald Williams (REINFORCE); Sutton et al. (policy gradient theorem)
유형Sequential decision-making frameworkPolicy-based reinforcement learning
원전Sutton, R. S. & Barto, A. G. (2018). Reinforcement Learning: An Introduction (2nd ed.). MIT Press. ISBN: 978-0-262-03924-6Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8(3–4), 229–256. DOI ↗
별칭RL, reward-based learning, trial-and-error learning, policy optimizationREINFORCE, actor-critic, policy optimization, politika gradyanı
관련24
요약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.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. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Reinforcement Learning · Policy Gradient. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare