Stop Regressing: Training Value Functions via Classification for Scalable Deep RL
Value functions are a central component of deep reinforcement learning (RL). These functions, parameterized by neural networks, are trained using a mean squared error regression objective to match bootstrapped target values. However, scaling value-based RL methods that use regression to large networks, such as high-capacity Transformers, has proven challenging. This difficulty is in stark contrast to supervised learning: by leveraging a cross-entropy classification loss, supervised methods have scaled reliably to massive networks. Observing this discrepancy, in this paper, we investigate whether the scalability of deep RL can also be improved simply by using classification in place of regression for training value functions. We demonstrate that value functions trained with categorical cross-entropy significantly improves performance and scalability in a variety of domains. These include: single-task RL on Atari 2600 games with SoftMoEs, multi-task RL on Atari with large-scale ResNets, robotic manipulation with Q-transformers, playing Chess without search, and a language-agent Wordle task with high-capacity Transformers, achieving state-of-the-art results on these domains. Through careful analysis, we show that the benefits of categorical cross-entropy primarily stem from its ability to mitigate issues inherent to value-based RL, such as noisy targets and non-stationarity. Overall, we argue that a simple shift to training value functions with categorical cross-entropy can yield substantial improvements in the scalability of deep RL at little-to-no cost.
Code (0)
등록된 구현이 없습니다.
Tasks
Atari GamesDeep Reinforcement LearningregressionReinforcement Learning (RL)Similar Papers 제목 키워드 기반
Graph2Graph Learning with Conditional Autoregressive Models
We present a graph neural network model for solving graph-to-graph learning problems. Most deep learning on graphs considers ``simple'' problems such as graph classification or regressing real-valued graph properties. Fo…
Graph ClassificationGraph LearningGraph Neural NetworkAutomatic Inference for Value-Added Regressions
It is common to use shrinkage methods such as empirical Bayes to improve estimates of teacher value-added. However, when the goal is to perform inference on coefficients in the regression of long-term outcomes on value-a…
regressionReWE: Regressing Word Embeddings for Regularization of Neural Machine Translation Systems
Regularization of neural machine translation is still a significant problem, especially in low-resource settings. To mollify this problem, we propose regressing word embeddings (ReWE) as a new regularization technique in…
Machine TranslationTranslationWord EmbeddingsControl-stopping Games for Market Microstructure and Beyond
In this paper, we present a family of a control-stopping games which arise naturally in equilibrium-based models of market microstructure, as well as in other models with strategic buyers and sellers. A distinctive featu…
On an Optimal Stopping Problem with a Discontinuous Reward
We study an optimal stopping problem with an unbounded, time-dependent and discontinuous reward function.This problem is motivated by the pricing of a variable annuity contract with guaranteed minimum maturity benefit, u…