The Research on deep reinforcement learning to estimate Q-value by deep learning has been active in recent years. In deep reinforcement learning, it is important to efficiently learn the experiences that a agent has collected by exploring the environment. In this research, we propose NEC2DQN that improves learning speed of a algorithm with poor sample efficiency by using a algorithm with good one at the beginning of learning, and we demonstrate it in experiments.
We can perform two kinds of operations for DND, @math and @math . In @math , when @math featured by CNN and corresponding action @math are entered, we lookup the top @math -nearest neighbors for @math in @math using kd-trees @cite_1 . We weight the value @math corresponding to @math keys and we set it as @math .
@cite_1
2115854352
The @math k -d tree was one of the first spatial data structures proposed for nearest neighbor search. Its efficacy is diminished in high-dimensional spaces, but several variants, with randomization and overlapping cells, have proved to be successful in practice. We analyze three such schemes. We show that the probability that they fail to find the nearest neighbor, for any data set and any query point, is directly related to a simple potential function that captures the difficulty of the point configuration. We then bound this potential function in several situations of interest: when the data are drawn from a doubling measure; when the data and query distributions are identical and are supported on a set of bounded doubling dimension; and when the data are documents from a topic model.