Пример #1
0
 def init_priority_tree(self):
     """Organized here for clean inheritance."""
     self.priority_tree = SumTree(
         T=self.T,
         B=self.B,
         off_backward=self.off_backward,
         off_forward=self.off_forward,
         default_value=self.default_priority**self.alpha,
     )
Пример #2
0
 def init_priority_tree(self):
     self.priority_tree = SumTree(
         T=self.replay_buffer.T,
         B=self.replay_buffer.B,
         off_backward=self.n_step_return,  # NOT from replay_buffer.
         off_forward=0,
         default_value=1,
         enable_input_priorities=True,
         input_priority_shift=self.n_step_return - 1,
     )
Пример #3
0
 def init_priority_tree(self):
     off_backward = math.ceil((1 + self.off_backward + self.batch_T) /
         self.rnn_state_interval)  # +1 in case interval aligned? TODO: check
     self.priority_tree = SumTree(
         T=self.T // self.rnn_state_interval,
         B=self.B,
         off_backward=off_backward,
         off_forward=math.ceil(self.off_forward / self.rnn_state_interval),
         default_value=self.default_priority ** self.alpha,
     )