Overview
Policy Gradient is a machine learning method that learns predictions, labels, embeddings, policies, or model parameters from data. It is useful when its model bias matches the data and the training signal is reliable.
Policy Gradient learns a predictive, clustering, representation, or policy model from data.
Compact metadata for implementation and discovery.
Policy Gradient is a machine learning method that learns predictions, labels, embeddings, policies, or model parameters from data. It is useful when its model bias matches the data and the training signal is reliable.
Quick facts
Runtime and memory behavior at a glance.
Best
O(n d)
Average
O(n d t)
Worst
O(n d t)
Space
O(d)
gradient J(theta) = E[gradient log pi_theta(a|s) * return]Improves actions that produced higher returns.
Show data points, model outputs, and parameter updates during training.
Policy Gradient operates in O(n d t) time and O(d) space within the Machine Learning family. Key governing relation: gradient J(theta) = E[gradient log pi_theta(a|s) * return]. Often compared with Linear Regression and Decision Tree.
What each reference supports for this entry.
Classic policy-gradient reference for likelihood-ratio updates from scalar reinforcement signals.
Open sourceReference for policy-gradient objectives, returns, baselines, and actor-critic extensions.
Open sourceGood next jumps from the relationship graph, ranked for useful discovery.
Policy Gradient and Q-Learning are reinforcement-learning alternatives with policy-based and value-based updates.