Proximal Policy Optimization Algorithms

Proximal Policy Optimization Algorithms. Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. August, 2017. arXiv:1707.06347 [cs]

Paper abstract bibtex

We propose a new family of policy gradient methods for reinforcement learning, which alternate between sampling data through interaction with the environment, and optimizing a “surrogate” objective function using stochastic gradient ascent. Whereas standard policy gradient methods perform one gradient update per data sample, we propose a novel objective function that enables multiple epochs of minibatch updates. The new methods, which we call proximal policy optimization (PPO), have some of the beneﬁts of trust region policy optimization (TRPO), but they are much simpler to implement, more general, and have better sample complexity (empirically). Our experiments test PPO on a collection of benchmark tasks, including simulated robotic locomotion and Atari game playing, and we show that PPO outperforms other online policy gradient methods, and overall strikes a favorable balance between sample complexity, simplicity, and wall-time.

@misc{schulman_proximal_2017,
	title = {Proximal {Policy} {Optimization} {Algorithms}},
	url = {http://arxiv.org/abs/1707.06347},
	abstract = {We propose a new family of policy gradient methods for reinforcement learning, which alternate between sampling data through interaction with the environment, and optimizing a “surrogate” objective function using stochastic gradient ascent. Whereas standard policy gradient methods perform one gradient update per data sample, we propose a novel objective function that enables multiple epochs of minibatch updates. The new methods, which we call proximal policy optimization (PPO), have some of the beneﬁts of trust region policy optimization (TRPO), but they are much simpler to implement, more general, and have better sample complexity (empirically). Our experiments test PPO on a collection of benchmark tasks, including simulated robotic locomotion and Atari game playing, and we show that PPO outperforms other online policy gradient methods, and overall strikes a favorable balance between sample complexity, simplicity, and wall-time.},
	language = {en},
	urldate = {2022-12-17},
	publisher = {arXiv},
	author = {Schulman, John and Wolski, Filip and Dhariwal, Prafulla and Radford, Alec and Klimov, Oleg},
	month = aug,
	year = {2017},
	note = {arXiv:1707.06347 [cs]},
	keywords = {ChatGPT, Computer Science - Machine Learning},
}

Downloads: 0

{"_id":"hFbHXtfJMuhyhvZTS","bibbaseid":"schulman-wolski-dhariwal-radford-klimov-proximalpolicyoptimizationalgorithms-2017","author_short":["Schulman, J.","Wolski, F.","Dhariwal, P.","Radford, A.","Klimov, O."],"bibdata":{"bibtype":"misc","type":"misc","title":"Proximal Policy Optimization Algorithms","url":"http://arxiv.org/abs/1707.06347","abstract":"We propose a new family of policy gradient methods for reinforcement learning, which alternate between sampling data through interaction with the environment, and optimizing a “surrogate” objective function using stochastic gradient ascent. Whereas standard policy gradient methods perform one gradient update per data sample, we propose a novel objective function that enables multiple epochs of minibatch updates. The new methods, which we call proximal policy optimization (PPO), have some of the beneﬁts of trust region policy optimization (TRPO), but they are much simpler to implement, more general, and have better sample complexity (empirically). Our experiments test PPO on a collection of benchmark tasks, including simulated robotic locomotion and Atari game playing, and we show that PPO outperforms other online policy gradient methods, and overall strikes a favorable balance between sample complexity, simplicity, and wall-time.","language":"en","urldate":"2022-12-17","publisher":"arXiv","author":[{"propositions":[],"lastnames":["Schulman"],"firstnames":["John"],"suffixes":[]},{"propositions":[],"lastnames":["Wolski"],"firstnames":["Filip"],"suffixes":[]},{"propositions":[],"lastnames":["Dhariwal"],"firstnames":["Prafulla"],"suffixes":[]},{"propositions":[],"lastnames":["Radford"],"firstnames":["Alec"],"suffixes":[]},{"propositions":[],"lastnames":["Klimov"],"firstnames":["Oleg"],"suffixes":[]}],"month":"August","year":"2017","note":"arXiv:1707.06347 [cs]","keywords":"ChatGPT, Computer Science - Machine Learning","bibtex":"@misc{schulman_proximal_2017,\n\ttitle = {Proximal {Policy} {Optimization} {Algorithms}},\n\turl = {http://arxiv.org/abs/1707.06347},\n\tabstract = {We propose a new family of policy gradient methods for reinforcement learning, which alternate between sampling data through interaction with the environment, and optimizing a “surrogate” objective function using stochastic gradient ascent. Whereas standard policy gradient methods perform one gradient update per data sample, we propose a novel objective function that enables multiple epochs of minibatch updates. The new methods, which we call proximal policy optimization (PPO), have some of the beneﬁts of trust region policy optimization (TRPO), but they are much simpler to implement, more general, and have better sample complexity (empirically). Our experiments test PPO on a collection of benchmark tasks, including simulated robotic locomotion and Atari game playing, and we show that PPO outperforms other online policy gradient methods, and overall strikes a favorable balance between sample complexity, simplicity, and wall-time.},\n\tlanguage = {en},\n\turldate = {2022-12-17},\n\tpublisher = {arXiv},\n\tauthor = {Schulman, John and Wolski, Filip and Dhariwal, Prafulla and Radford, Alec and Klimov, Oleg},\n\tmonth = aug,\n\tyear = {2017},\n\tnote = {arXiv:1707.06347 [cs]},\n\tkeywords = {ChatGPT, Computer Science - Machine Learning},\n}\n\n","author_short":["Schulman, J.","Wolski, F.","Dhariwal, P.","Radford, A.","Klimov, O."],"key":"schulman_proximal_2017","id":"schulman_proximal_2017","bibbaseid":"schulman-wolski-dhariwal-radford-klimov-proximalpolicyoptimizationalgorithms-2017","role":"author","urls":{"Paper":"http://arxiv.org/abs/1707.06347"},"keyword":["ChatGPT","Computer Science - Machine Learning"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"misc","biburl":"https://bibbase.org/zotero/ifromm","dataSources":["aXmRAq63YsH7a3ufx","N4kJAiLiJ7kxfNsoh"],"keywords":["chatgpt","computer science - machine learning"],"search_terms":["proximal","policy","optimization","algorithms","schulman","wolski","dhariwal","radford","klimov"],"title":"Proximal Policy Optimization Algorithms","year":2017}