Title: LEARNING TO PLAY IN A DAY: FASTER DEEP REIN-FORCEMENT LEARNING BY OPTIMALITY TIGHTENING

Abstract: We propose a novel training algorithm for reinforcement learning which combines the strength of deep Q-learning with a constrained optimization approach to tighten optimality and encourage faster reward propagation. Our novel technique makes deep reinforcement learning more practical by drastically reducing the training time. We evaluate the performance of our approach on the 49 games of the challenging Arcade Learning Environment, and report significant improvements in both training time and accuracy.

1. INTRODUCTION:

The recent advances of supervised deep learning techniques (LeCun et al., 2015) in computer vision, speech recognition and natural language processing have tremendously improved the performance on challenging tasks, including image processing (Krizhevsky et al., 2012) , speech-based translation (Sutskever et al., 2014) and language modeling (Hinton et al., 2012) . The core idea of deep learning is to use artificial neural networks to model complex hierarchical or compositional data abstractions and representations from raw input data (Bengio et al., 2013) . However, we are still far from building intelligent solutions for many real-world challenges, such as autonomous driving, human-computer interaction and automated decision making, in which software agents need to consider interactions with a dynamic environment and take actions towards goals. Reinforcement learning (Bertsekas & Tsitsiklis, 1996; Powell, 2011; Sutton & Barto, 1998; Kaelbling et al., 1996) studies these problems and algorithms which learn policies to make decisions so as to maximize a reward signal from the environment. One of the promising algorithms is Q-learning (Watkins, 1989; Watkins & Dayan, 1992) . Deep reinforcement learning with neural function approximation (Tsitsiklis & Roy, 1997; Riedmiller, 2005; Mnih et al., 2013; 2015) , possibly a first attempt to combine deep learning and reinforcement learning, has been proved to be effective on a few problems which classical AI approaches were unable to solve. Notable examples of deep reinforcement learning include human-level game playing (Mnih et al., 2015) and AlphaGo (Silver et al., 2016) . Despite these successes, its high demand of computational resources makes deep reinforcement learning not yet applicable to many real-world problems. For example, even for an Atari game, the deep Q-learning algorithm (also called deep Q-networks, abbreviated as DQN) needs to play up to hundreds of millions of game frames to achieve a reasonable performance (van Hasselt et al., 2015) . AlphaGo trained its model using a database of game records of advanced players and, in addition, about 30 million self-played game moves (Silver et al., 2016) . The sheer amount of required computational resources of current deep reinforcement learning algorithms is a major bottleneck for its applicability to real-world tasks. Moreover, in many tasks, the reward signal is sparse and delayed, thus making the convergence of learning even slower.

Here we propose optimality tightening, a new technique to accelerate deep Q-learning by fast reward propagation. While current deep Q-learning algorithms rely on a set of experience replays, they only consider a single forward step for the Bellman optimality error minimization, which becomes highly inefficient when the reward signal is sparse and delayed. To better exploit long-term high-reward strategies from past experience, we design a new algorithm to capture rewards from both forward and backward steps of the replays via a constrained optimization approach. This encourages faster reward propagation which reduces the training time of deep Q-learning.

We evaluate our proposed approach using the Arcade learning environment (Bellemare et al., 2013) and show that our new strategy outperforms competing techniques in both accuracy and training time on 30 out of 49 games despite being trained with significantly fewer data frames.

2. RELATED WORK:

There have been a number of approaches improving the stability, convergence and runtime of deep reinforcement learning since deep Q-learning, also known as deep Q-network (DQN), was first proposed (Mnih et al., 2013; 2015) . DQN combined techniques such as deep learning, reinforcement learning and experience replays (Lin, 1992; Wawrzynski, 2009) .

Nonetheless, the original DQN algorithm required millions of training steps to achieve humanlevel performance on Atari games. To improve the stability, recently, double Q-learning was combined with deep neural networks, with the goal to alleviate the overestimation issue observed in Q-learning (Thrun & Schwartz, 1993; van Hasselt, 2010; van Hasselt et al., 2015) . The key idea is to use two Q-networks for the action selection and Q-function value calculation, respectively. The greedy action of the target is first chosen using the current Q-network parameters, then the target value is computed using a set of parameters from a previous iteration. Another notable advance is "prioritized experience replay" (Schaul et al., 2016) or "prioritized sweeping" for deep Q-learning. The idea is to increase the replay probability of experience tuples that have a high expected learning progress measured by temporal difference errors.

In addition to the aforementioned variants of Q-learning, other network architectures have been proposed. The dueling network architecture applies an extra network structure to learn the importance of states and uses advantage functions (Wang et al., 2015) . A distributed version of the deep actor-critic algorithm without experience replay was introduced very recently (Mnih et al., 2016) . It deploys multiple threads learning directly from current transitions. The approach is applicable to both value-based and policy-based methods, off-policy as well as on-policy methods, and in discrete as well as in continuous domains. The model-free episodic control approach evaluates state-action pairs based on episodic memory using k-nearest neighbors with hashing functions (Blundell et al., 2016) . Bootstrapped deep Q-learning carries out temporally-extended (or deep) exploration, thus leading to much faster learning (Osband et al., 2016) .

Our fast reward propagation differs from all of the aforementioned approaches. The key idea of our method is to propagate delayed and sparse rewards during Q-network training, and thus greatly improve the efficiency and performance. We formulate this propagation step via a constrained program. Note that our program is also different from earlier work on off-policy Q * (λ) algorithms with eligibility traces and n-step Q learning (Munos et al., 2016; Watkins, 1989; Mnih et al., 2016) , which have been recently shown to perform poorly when used for training deep Q-networks on Atari games.

3. BACKGROUND:

Reinforcement learning considers agents which are able to take a sequence of actions in an environment. By taking actions and experiencing at most one scalar reward per action, their task is to learn a policy which allows them to act such that a high cumulative reward is obtained over time.

More precisely, consider an agent operating over time t ∈ {1, . . . , T }. At time t the agent is in an environment state s t and reacts upon it by choosing action a t ∈ A. The agent will then observe a new state s t+1 and receive a numerical reward r t ∈ R. Throughout, we assume the set of possible actions, i.e., the set A, to be discrete.

A well established technique to address the aforementioned reinforcement learning task is Qlearning (Watkins, 1989; Watkins & Dayan, 1992) . Generally, Q-learning algorithms maintain an action-value function, often also referred to as Q-function, Q(s, a). Given a state s, the action-value function provides a 'value' for each action a ∈ A which estimates the expected future reward if action a ∈ A is taken. The estimated future reward is computed based on the current state s or a series of past states s t if available.

The core idea of Q-learning is the use of the Bellman equation as a characterization of the optimal future reward function Q * via a state-action-value function

Q * (s t , a) = E[r t + γ max a Q * (s t+1 , a )].

(1)

Hereby the expectation is taken w.r. (Riedmiller, 2005; Lange & Riedmiller, 2010; Mnih et al., 2013; 2015) . This change has been shown to be very effective for many applications of reinforcement learning. However, automatic mining of intermediate representations comes at a price: larger quantities of data and more computational resources are required. Even though it is sometimes straightforward to extract large amounts of data, e.g., when training on video games, for successful optimization, it is crucial that the algorithms operate on un-correlated samples from a dataset D for stability. A technique called "experience replay" (Lin, 1992; Wawrzynski, 2009) encourages this property and quickly emerged as a standard step in the well-known deep Q-learning framework (Mnih et al., 2013; 2015) . Experience replays are stored as a dataset D = {(s j , a j , r j , s j+1 )} which contains state-action-reward-future state-tuples (s j , a j , r j , s j+1 ), including past observations from previous plays.

The characterization of optimality given in Eq. ( 1) combined with an "experience replay" dataset D results in the following iterative algorithmic procedure (Mnih et al., 2013; 2015) : start an episode in the initial state s 0 ; sample a mini-batch of tuples B = {(s j , a j , r j , s j+1 )} ⊆ D; compute and fix the targets y j = r j + γ max a Q θ -(s j+1 , a) for each tuple using a recent estimate Q θ -(the maximization is only considered if s j is not a terminal state); update the Q-function by optimizing the following program w.r.t. the parameters θ typically via stochastic gradient descent:

min θ (sj ,aj ,rj ,sj+1)∈B (Q θ (s j , a j ) -y j ) 2 .

(2)

After having updated the parameters of the Q-function we perform an action simulation either choosing an action at random with a small probability , or by following the strategy arg max a Q θ (s t , a) which is currently estimated. This strategy is also called the -greedy policy. We then obtain the actual reward r t . Subsequently we augment the replay memory with the new tuple (s t , a t , r t , s t+1 ) and continue the simulation until this episode terminates or reaches an upper limit of steps, and we restart a new episode. When optimizing w.r.t. the parameter θ, a recent Q-network is used to compute the target

y j = r j + γ max a Q θ -(s j+1 , a)

. This technique is referred to as 'semi-gradient descent,' i.e., the dependence of the target on the parameter θ is ignored.

4. FAST REWARD PROPAGATION VIA OPTIMALITY TIGHTENING:

Investigating the cost function given in Eq. ( 2) more carefully, we observe that it operates on a set of short one-step sequences, each characterized by the tuple (s j , a j , r j , s j+1 ). Intuitively, each step encourages an update of the parameters θ, such that the action-value function for the chosen action a j , i.e., Q θ (s j , a j ), is closer to the obtained reward plus the best achievable future value, i.e., y j = r j + γ max a Q(s j+1 , a). As we expect from the Bellman optimality equation, it is instructive to interpret this algorithm as propagating reward information from time j + 1 backwards to time j.

To understand the shortcomings of this procedure consider a situation where the agent only receives a sparse and delayed reward once reaching a target in a maze. Further let |P | characterize the shortest path from the agents initial position to the target. For a long time, no real reward is available and the aforementioned algorithm propagates randomly initialized future rewards. Once the target is reached, real reward information is available. Due to the cost function and its property of propagating reward time-step by time-step, it is immediately apparent that it takes at least an additional O(|P |) iterations until the observed reward impacts the initial state.

In the following we propose a technique which increases the speed of propagation and achieves improved convergence for deep Q-learning. We achieve this improvement by taking advantage of longer state-action-reward-sequences which are readily available in the "experience replay memory."

Not only do we propagate information from time instances in the future to our current state, but also will we pass information from states several steps in the past. Even though we expect to see substantial improvements on sequences where rewards are sparse or only available at terminal states, we also demonstrate significant speedups for situations where rewards are obtained frequently. This is intuitive as the Q-function represents an estimate for any reward encountered in the future. Faster propagation of future and past rewards to a particular state is therefore desirable.

Subsequently we discuss our technique for fast reward propagation, a new deep Q-learning algorithm that exploits longer state-transitions in experience replays by tightening the optimization via constraints. For notational simplicity, we assume that the environmental dynamics is deterministic, i.e., the new state and the reward are solely determined by the current state and action. It is possible to show that mathematically our proposed approach also approximately works in stochastic environments. Please see details in the appendix. From the Bellman optimality equation we know that the following series of equalities hold for the optimal Q-function Q * :

Q * (sj, aj) = rj + γ max a Q * (sj+1, a) = rj + γ max a rj+1 + γ max a rj+2 + γ max ã Q * (sj+3, ã) .

Evaluating such a sequence exactly is not possible in a reinforcement learning setting since the enumeration of intermediate states s j+i requires exponential time complexity O(|A| i ). It is however possible to take advantage of the episodes available in the replay memory D by noting that the following sequence of inequalities holds for the optimal action-value function Q * (with the greedy policy), irrespective of whether a policy π generating the sequence of actions a j , a j+1 , etc., which results in rewards r j , r j+1 , etc. is optimal or not:

Q * (s j , a j ) = r j + γ max a Q * (s j+1 , a)] ≥ . . . ≥ k i=0 γ i r j+i + γ k+1 max a Q * (s j+k+1 , a) = L * j,k .

Note the definition of the lower bounds L * j,k for sample j and time horizon k in the aforementioned series of inequalities.

We can also use this series of inequalities to define upper bounds. To see this note that

Q * (s j-k-1 , a j-k-1 ) - k i=0 γ i r j-k-1+i -γ k+1 Q * (s j , a j ) ≥ 0,

which follows from the definition of the lower bound by dropping the maximization over the actions, and a change of indices from j → j -k -1. Reformulating the inequality yields an upper bound U * j,k for sample j and time horizon k by fixing state s j and action a j as follows:

U * j,k = γ -k-1 Q * (s j-k-1 , a j-k-1 ) - k i=0 γ i-k-1 r j-k-1+i ≥ Q * (s j , a j ).

In contrast to classical techniques which optimize the Bellman criterion given in Eq. ( 2), we propose to optimize the Bellman equation subject to constraints Q θ (s j , a j ) ≥ L max j = max k∈{1,...,K} L j,k , which defines the largest lower bound, and Q θ (s j , a j ) ≤ U min j = min k∈{1,...,K} U j,k , which specifies the smallest upper bound. Hereby, L j,k and U j,k are computed using the Q-function Q θ -with a recent estimated parameter θ -rather than the unknown optimal Q-function Q * , and the integer K specifies the number of future and past time steps which are considered. Also note that the target used in the Bellman equation is obtained from y j = L j,0 = r j + γ max a Q θ -(s j+1 , a). In this way, we ignore the dependence of the bounds and the target on the parameter θ to stabilize the training. Taking all the aforementioned definitions into account, we propose the following program for 

EQUATION

This program differs from the classical approach given in Eq. ( 2) via the constraints, which is crucial. Intuitively, the constraints encourage faster reward propagation as we show next, and result in tremendously better results as we will demonstrate empirically in Sec. 5.

Before doing so we describe our optimization procedure for the constrained program in Eq. ( 3) more carefully. The cost function is generally non-convex in the parameters θ, and so are the constraints. We therefore make use of a quadratic penalty method to reformulate the program into min θ (sj ,aj ,rj ,sj+1)∈B

EQUATION

)

where λ is a penalty coefficient and (x) + = max(0, x) is the rectifier function. Augmenting the cost function with λ(L max j -Q θ (s j , a j )) 2 + and/or λ(Q θ (s j , a j ) -U min j ) 2 + results in a penalty whenever any optimality bounding constraint gets violated. The quadratic penalty function is chosen for simplicity. The penalty coefficient λ can be set as a large positive value or adjusted in an annealing scheme during training. In this work, we fix its value, due to time constraints. We optimize this cost function with stochastic (sub-)gradient descent using an experience replay memory from which we randomly draw samples, as well as their successors and predecessors. We emphasize that the derivatives correcting the prediction of Q(s j , a j ) not only depend on the Q-function from the immediately successive time step Q(s j+1 , a) stored in the experience replay memory, but also on more distant time instances if constraints are violated. Our proposed formulation and the resulting optimization technique hence encourage faster reward propagation, and the number of time steps depends on the constant K and the quality of the current Q-function. We summarize the proposed method in Algorithm 1.

The computational complexity of the proposed approach increases with the number of considered time steps K, since additional forward passes are required to compute the bounds L max j and U min j . However, we can increase the memory size on the GPU to compute both the bounds and targets in a single forward pass if K is not too large. If at all a problem, we can further alleviate this increase by randomly sampling a subset of the constraints rather than exhaustively using all of them. More informed strategies regarding the choice of constraints are possible as well since we may expect lower bounds in the more distant future to have a larger impact early in the training. In contrast once the algorithm is almost converged we may expect lower bounds close to the considered time-step to have bigger impact.

To efficiently compute the discounted reward over multiple time steps we add a new element to the experience replay structure. Specifically, in addition to state, action, reward and next state for 2015), using the metric given in Eq. ( 5). time-step j, we also store the real discounted return R j which is the discounted cumulative return achieved by the agent in its game episode. R j is computed via R j = T τ =j γ τ -j r τ , where T is the end of the episode and γ is the discount factor. R j is then inserted in the replay memory after the termination of the current episode or after reaching the limit of steps. All in all, the structure of our experience replay memory consists of tuples of the form (s j , a j , r j , R j , s j+1 ). In practice, we also found that incorporating R j in the lower bound calculation can further improve the stability of the training.

We leave the questions regarding a good choice of penalty function and a good choice of the penalty coefficients to future work. At the moment we use a quadratic penalty function and a constant penalty coefficient λ identical for both bounds. More complex penalty functions and sophisticated optimization approaches may yield even better results than the ones we report in the following.

5. EXPERIMENTS:

We evaluate the proposed algorithm on a set of 49 games from the Arcade Learning Environment (Bellemare et al., 2013) as suggested by Mnih et al. (2015) . This environment is considered to be one of the most challenging reinforcement learning task because of its high dimensional output. Moreover, the intrinsic mechanism varies tremendously for each game, making it extremely demanding to find a single, general and robust algorithm and a corresponding single hyperparameter setting which works well across all 49 games. Following existing work (Mnih et al., 2015) , our agent predicts an action based on only raw image pixels and reward information received from the environment. A deep neural network is used as the function approximator for the Q-function. The game image is resized to an 84 × 84 grayscale image s t . The first layer is a convolutional layer with 32 filters of size 8 × 8 and a stride of 4; the second layer is a convolutional layer with 64 filters of size 4 × 4 and stride of 2; the third layer is a convolutional layer with 64 filters of size 3 × 3 and a stride of 1; the next fully connected layer transforms the input to 512 units which are then transformed by another fully connected layer to an output size equal to the number of actions in each game. The rectified linear unit (ReLU) is used as the activation function for each layer. We used the hyperparameters provided by Mnih et al. (2015) for annealing -greedy exploration and also applied RMSProp for gradient descent. As in previous work we combine four frames into a single step for processing. We chose the hyperparamenter K = 4, for GPU memory efficiency when dealing with mini-batches. In addition, we also include the discounted return R j = L j,∞ in the lower bound calculation to further stabilize the training. We use the penalty coefficient λ = 4 which was obtained by coarsely tuning performance on the games 'Alien,' 'Amidar,' 'Assault,' and 'Asterix.' Gradients are also rescaled so that their magnitudes are comparable with or without penalty. All experiments are performed on an NVIDIA GTX Titan-X 12GB graphics card.

Figure 2 : Improvements of our method trained on 10M frames compared to results of 10M frame DQN training, using the metric given in Eq. ( 5).

5.1. EVALUATION:

In previous work (Mnih et al., 2015; van Hasselt et al., 2015; Schaul et al., 2016; Wang et al., 2015) , the Q-function is trained on each game using 200 million (200M) frames or 50M training steps. We compare to those baseline results obtained after 200M frames using our proposed algorithm which ran for only 10M frames or 2.5M steps, i.e., 20 times fewer data, due to time constraints. Instead of training more than 10 days we manage to finish training in less than one day. Furthermore, for a fair comparison, we replicate the DQN results and compare the performance of the proposed algorithm after 10M frames to those obtained when training DQN on only 10M frames.

We strictly follow the evaluation procedure in (Mnih et al., 2015) which is often referred to as '30 no-op evaluation.' During both training and testing, at the start of the episode, the agent always performs a random number of at most 30 no-op actions. During evaluation, our agent plays each game 30 times for up to 5 minutes, and the obtained score is averaged over these 30 runs. Angreedy policy with = 0.05 is used. Specifically, for each run, the game episode starts with at most 30 no-op steps, and ends with 'death' or after a maximum of 5 minute game-play, which corresponds to 18000 frames.

Our training consists of M = 40 epochs, each containing 250000 frames, thus 10M frames in total. For each game, we evaluate our agent at the end of every epoch, and, following common practice (van Hasselt et al., 2015; Mnih et al., 2015) , we select the best agent's evaluation as the result of the game. So almost all hyperparameters are selected identical to Mnih et al. (2015) and Nair et al. (2015) .

To compare the performance of our algorithm to the DQN baseline, we follow the approach of Wang et al. (2015) and measure the improvement in percent using Score Agent -Score Baseline max{Score Human , Score Baseline } -Score Random .

(5)

We select this approach because the denominator choice of either human or baseline score prevents insignificant changes or negative scores from being interpreted as large improvements.

Fig. 1 shows the improvement of our algorithm over the DQN baseline proposed by Mnih et al. (2015) and trained for 200M frames, i.e., 50M steps. Even though our agent is only trained for 10M frames, we observe that our technique outperforms the baseline significantly. 2015) and trained with 200M frames while our method is trained with 10M frames. Note that our approach can be combined with the D-DQN method. to summarize the performance of our algorithm in a single number. We normalize the scores of our algorithm, the baseline reported by Mnih et al. (2015) , and double DQN (D-DQN) (van Hasselt et al., 2015) , and report the training time, mean and median in Table 1 . We observe our technique with 10M frames to achieve comparable scores to the D-DQN method trained on 200M frames (van Hasselt et al., 2015) , while it outperforms the DQN method (Mnih et al., 2015) by a large margin. We believe that our method can be readily combined with other techniques developed for DQN, such as D- DQN (van Hasselt et al., 2015) , prioritized experience replay (Schaul et al., 2016) , dueling networks (Wang et al., 2015) , and asynchronous methods (Mnih et al., 2016) to further improve the accuracy and training speed.

In Fig. 3 we illustrate the evolution of the score for our algorithm and the DQN approach. In addition we demonstrate two additional techniques: 'DQN+return' and 'DQN(λ).' 'DQN+return' uses only the discounted future return as a bound, but does not take advantage of the additional constraints we propose. 'DQN(λ)' combines TD-λ with the DQN algorithm. We illustrate the performance of those four algorithms on the six games 'Frostbite,' 'Atlantis,' 'Zaxxon,' 'H.E.R.O,' 'Q*Bert,' and 'Chopper Command.' We observe our method to achieve higher scores than the three baselines on the majority of the games. We refer the reader to the supplementary material for additional results.

6. CONCLUSION:

In this paper we proposed a novel program for deep Q-learning which propagates promising rewards to achieve significantly faster convergence than the classical DQN. Our method significantly outperforms competing approaches even when trained on a small fraction of the data on the Atari 2600 domain. In the future, we plan to investigate the impact of penalty functions, advanced constrained optimization techniques and explore potential synergy with other techniques.

A SUPPLEMENTARY MATERIAL OPTIMALITY TIGHTENING FOR STOCHASTIC ENVIRONMENTS:

Similar to the inequalities we obtained for deterministic environments, we can also derive the following sequence of inequalities holds for the optimal action-value function Q * (with the greedy policy), under the expectation of the environmental dynamics:

Q * (s j , a j ) = E[r j + γ max a Q * (s j+1 , a)] ≥ . . . ≥ E[ k i=0 γ i r j+i + γ k+1 max a Q * (s j+k+1 , a)]

So we have the following expectation constraint, on trajectories from state s j and action a j .

E[Q * (s j , a j ) -( k i=0 γ i r j+i + γ k+1 max a Q * (s j+k+1 , a))] ≥ 0 E[Q * (s j , a j ) -L j,k ] ≥ 0

We can also use this series of inequalities to define upper bounds, on trajectories to state s j and action a j .

E[Q * (s j , a j ) -(γ -k-1 Q * (s j-k-1 , a j-k-1 ) - k i=0 γ i-k-1 r j-k-1+i )] ≤ 0 E[Q * (s j , a j ) -U j,k ] ≤ 0

With these expectation constraints, we can formulate a constrained optimization problem as follows:

min θ (sj ,aj ,sj+1,rj )∈B (Q θ (s j , a j ) -y j ) 2 s.t. min k E[Q θ (s j , a j ) -L j,k ] ≥ 0 ∀ (s j , a j ) ∈ B max k E[Q θ (s j , a j ) -U j,k ] ≤ 0 ∀ (s j , a j ) ∈ B .

Applying the quadratic penalty function method, we obtain the objective:

(sj ,aj ,rj ,sj+1)∈B

(Q θ (s j , a j ) -y j ) 2 + λ(max k E[L j,k -Q θ (s j , a j )] 2 + + max k E[(Q θ (s j , a j ) -U j,k )] 2 + )

By applying the Jensen's inequality, we are able to obtain an upper bound by first exchanging the expectation with the max and then exchanging the expectation with the rectifier function, because both the max function and the rectifier function are convex.

(sj ,aj ,rj ,sj+1)∈B

(Q θ (s j , a j ) -y j ) 2 + E[λ(max k L j,k -Q θ (s j , a j ) 2 + ] + E[λ(Q θ (s j , a j ) -max k U j,k ) 2 + )]

It is easy to see that, since we have trajectory samples in the replay memory which were drawn under the environmental dynamics, we can perform stochastic optimization using these trajectories.

In this way, a sample of this upper bound is identical to that in the deterministic setting in Eq. ( 4). As a result, our proposed algorithm can be used to optimize an upper bound of the above constrained optimization in stochastic environments.

Please note that here we provide a mathematical derivation of our approach for stochastic environments. We expect that it would work in practice, but due to time constraints and the lack of good stochastic simulators, we cannot provide any empirical results here.

B ADDITIONAL RESULTS:

We present our quantitative results in Table S1 and Table S2 . We also illustrate the normalized score provided in Eq. ( 6) over the number of episodes in Fig. S1 . 

Game:



:



Figures and Tables:

Figure 1: Improvements of our method trained on 10M frames compared to results of 200M frame DQN training presented by Mnih et al. (2015), using the metric given in Eq. (5).

Figure 3: Game scores for our algorithm (blue), DQN (black), DQN+return (red) and DQN(λ) (yellow) using 10M training frames. 30 no-op evaluation is used and moving average over 4 points is applied.In order to further illustrate the effectiveness of our method, we compare our results with our implementation of DQN trained on 10M frames. The results are illustrated in Fig.2. We observe a better performance on 46 out of 49 games, demonstrating in a fair way the potential of our technique. As suggested by van Hasselt et al. (2015), we use the following score Score Normalized = Score Agent -Score Random |Score Human -Score Random | (6)

t. the distribution of state s t+1 and reward r t obtained after taking action a, and γ is a discount factor. Intuitively, reward for taking action a plus best future reward should equal the best total return from the current state.

Table content: <table><tr><td>The choice of Q-function is crucial for the success of Q-learning algorithms. While classical meth-</td></tr><tr><td>ods use linear Q-functions based on a set of hand-crafted features of the state, more recent ap-</td></tr><tr><td>proaches use nonlinear deep neural networks to automatically mine intermediate features from the</td></tr><tr><td>state</td></tr></table>

Output : Parameters θ of a Q-function Initialize: θ randomly, set θ -= θ for episode ← 1 to M do initialize s 1 ; for t ← 1 to T do Choose action a t according to -greedy strategy; Observe reward r t and next state s t+1 ; Store the tuple (s t , a t , r t , •, s t+1 ) in replay memory D; Sample a minibatch of tuples B = {(s j , a j , r j , R j , s j+1 }) from replay memory D; Update θ with one gradient step of cost function given in Eq. (4); Reset θ -= θ every C steps; end for t ← T to 1 do Compute R t = r t + γR t+1 ; Insert R t into the corresponding tuple in replay memory D; end end Algorithm 1: Our algorithm for fast reward propagation in reinforcement learning tasks.

Table content: <table/>

In 30 out of 49 games, our algorithm exceeds the baseline using only 5% of the baseline's training frames, sometimes drastically, e.g., in games such as 'Atlantis,' 'Double Dunk,' and 'Krull.' The remaining 19 games, often require a long training time. Nonetheless, our algorithm still reaches a satisfactory level of performance. Mean and median human-normalized scores. DQN baseline and D-DQN results are from Mnih et al. (2015); van Hasselt et al. (

Table content: <table><tr><td colspan="2">Published as a conference paper at ICLR 2017</td><td/></tr><tr><td/><td>Training Time</td><td>Mean</td><td>Median</td></tr><tr><td>Ours (10M)</td><td>less than 1 day (1 GPU)</td><td colspan="2">345.70% 105.74%</td></tr><tr><td>DQN (200M)</td><td colspan="2">more than 10 days (1 GPU) 241.06%</td><td>93.52%</td></tr><tr><td colspan="2">D-DQN (200M) more than 10 days (1 GPU)</td><td>330.3%</td><td>114.7%</td></tr></table>

Raw Scores across 49 games, using 30 no-op start evaluation (5 minutes emulator time, 18000 frames, = 0.05). Results of DQN is taken fromMnih et al. (2015)

Table content: <table><tr><td/><td colspan="4">Random Human DQN 200M Ours 10M</td></tr><tr><td>Alien</td><td>227.80</td><td>6875</td><td>3069</td><td>1864</td></tr><tr><td>Amidar</td><td>5.8</td><td>1676</td><td>739.5</td><td>565.67</td></tr><tr><td>Assault</td><td>222.4</td><td>1496</td><td>3359</td><td>5142.37</td></tr><tr><td>Asterix</td><td>210</td><td>8503</td><td>6012</td><td>5408.33</td></tr><tr><td>Asteroids</td><td>719.1</td><td>13157</td><td>1629</td><td>1481.67</td></tr><tr><td>Atlantis</td><td>12850</td><td>29028</td><td>85641</td><td>316766.67</td></tr><tr><td>Bank Heist</td><td>14.2</td><td>734.4</td><td>429.7</td><td>596</td></tr><tr><td>Battle Zone</td><td>2360</td><td>37800</td><td>26300</td><td>30800</td></tr><tr><td>Beam Rider</td><td>363.9</td><td>5775</td><td>6846</td><td>8069</td></tr><tr><td>Bowling</td><td>23.1</td><td>154.8</td><td>42.4</td><td>49.3</td></tr><tr><td>Boxing</td><td>0.1</td><td>4.3</td><td>71.8</td><td>81.17</td></tr><tr><td>Breakout</td><td>1.7</td><td>31.8</td><td>401.2</td><td>229.79</td></tr><tr><td>Centipede</td><td>2091</td><td>11963</td><td>8309</td><td>4470.06</td></tr><tr><td>Chopper Command</td><td>811</td><td>9882</td><td>6687</td><td>6360</td></tr><tr><td>Crazy Climber</td><td>10781</td><td>35411</td><td>114103</td><td>114146</td></tr><tr><td>Demon Attack</td><td>152.1</td><td>3401</td><td>9711</td><td>5738.67</td></tr><tr><td>Double Dunk</td><td>-18.6</td><td>-15.5</td><td>-18.1</td><td>-10.07</td></tr><tr><td>Enduro</td><td>0</td><td>309.6</td><td>301.8</td><td>672.83</td></tr><tr><td>Fishing Derby</td><td>-91.7</td><td>5.5</td><td>-0.8</td><td>5.27</td></tr><tr><td>Freeway</td><td>0</td><td>29.6</td><td>30.3</td><td>31.3</td></tr><tr><td>Frostbite</td><td>65.2</td><td>4335</td><td>328.3</td><td>3974.11</td></tr><tr><td>Gopher</td><td>257.6</td><td>2321</td><td>8520</td><td>4660</td></tr><tr><td>Gravitar</td><td>173</td><td>2672</td><td>306.7</td><td>346.67</td></tr><tr><td>H.E.R.O</td><td>1027</td><td>25763</td><td>19950</td><td>19975</td></tr><tr><td>Ice Hockey</td><td>-11.2</td><td>0.9</td><td>-1.6</td><td>-3.43</td></tr><tr><td>Jamesbond</td><td>29</td><td>406.7</td><td>576.7</td><td>1088.33</td></tr><tr><td>Kangaroo</td><td>52</td><td>3035</td><td>6740</td><td>11716.67</td></tr><tr><td>Krull</td><td>1598</td><td>2395</td><td>3805</td><td>9461.1</td></tr><tr><td>Kung-Fu Master</td><td>258.5</td><td>22736</td><td>23270</td><td>27820</td></tr><tr><td>Montezuma's Revenge</td><td>0</td><td>4376</td><td>0</td><td>23.33</td></tr><tr><td>Ms. Pacman</td><td>307.3</td><td>15693</td><td>2311</td><td>1805</td></tr><tr><td>Name This Game</td><td>2292</td><td>4076</td><td>7257</td><td>7314.67</td></tr><tr><td>Pong</td><td>-20.7</td><td>9.3</td><td>18.9</td><td>19.4</td></tr><tr><td>Private Eye</td><td>24.9</td><td>69571</td><td>1788</td><td>342.37</td></tr><tr><td>Q*Bert</td><td>163.9</td><td>13455</td><td>10596</td><td>12355</td></tr><tr><td>River Raid</td><td>1339</td><td>13513</td><td>8316</td><td>8028.33</td></tr><tr><td>Road Runner</td><td>11.5</td><td>7845</td><td>18257</td><td>29346.67</td></tr><tr><td>Robotank</td><td>2.2</td><td>11.9</td><td>51.6</td><td>34.5</td></tr><tr><td>Seaquest</td><td>68.4</td><td>20182</td><td>5286</td><td>4070</td></tr><tr><td>Space Invaders</td><td>148</td><td>1652</td><td>1976</td><td>995</td></tr><tr><td>Star Gunner</td><td>664</td><td>10250</td><td>57997</td><td>16653.95</td></tr><tr><td>Tennis</td><td>-23.8</td><td>-8.9</td><td>-2.5</td><td>-1</td></tr><tr><td>Time Pilot</td><td>3568</td><td>5925</td><td>5947</td><td>5423.33</td></tr><tr><td>Tutankham</td><td>11.4</td><td>167.6</td><td>186.7</td><td>232</td></tr><tr><td>Up and Down</td><td>533.4</td><td>9082</td><td>8456</td><td>14406</td></tr><tr><td>Venture</td><td>0</td><td>1188</td><td>380</td><td>286.67</td></tr><tr><td>Video Pinball</td><td>16257</td><td>17298</td><td>42684</td><td>74873.2</td></tr><tr><td>Wizard of Wor</td><td>563.5</td><td>4757</td><td>3393</td><td>4716.67</td></tr><tr><td>Zaxxon</td><td>32.5</td><td>9173</td><td>4977</td><td>10598</td></tr></table>

Peer review (iclr2017):
In this paper, the authors proposed a extension to the DQN algorithm by introducing both an upper and lower bound to the optimal Q function. The authors show experimentally that this approach improves the data efficiency quite dramatically such that they can achieve or even supersede the performance of DQN that is trained in 8 days. The idea is novel to the best of my knowledge and the improvement over DQN seems very significant. Recently, Remi et al have introduced the Retrace algorithm which can make use of multi-step returns to estimate Q values. As I suspect, some of the improvements that comes from the bounds is due to the fact that multi-step returns is used effectively. Therefore, I was wondering whether the authors have tried any approach like Retrace or Tree backup by Precup et al. and if so how do these methods stack up against the proposed method. The author have very impressive results and the paper proposes a very promising direction for future research and as a result I would like to make a few suggestions: First, it would be great if the authors could include a discussion about deterministic vs stochastic MDPs. Second, it would be great if the authors could include some kind of theoretically analysis about the approach. Finally, I would like to apologize for the late review.