You are provided with the abstract of a scientific paper and the abstracts of the papers it references. Your task is to write a Related Work section for the main paper. This section should concisely summarize and integrate the key points from the cited abstracts, reflecting how they relate to the main paper's contributions and context. In your summary, use numerical citation markers like [1], [2], etc., to refer to the corresponding papers.

Main Abstract:
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.

Cited Abstract(s):
[1]: This paper develops the multidimensional binary search tree (or k -d tree, where k is the dimensionality of the search space) as a data structure for storage of information to be retrieved by associative searches. The k -d tree is defined and examples are given. It is shown to be quite efficient in its storage requirements. A significant advantage of this structure is that a single data structure can handle many types of queries very efficiently. Various utility algorithms are developed; their proven average running times in an n record file are: insertion, O (log n ); deletion of the root, O ( n ( k -1) k ); deletion of a random node, O (log n ); and optimization (guarantees logarithmic performance of searches), O ( n log n ). Search algorithms are given for partial match queries with t keys specified [proven maximum running time of O ( n ( k - t ) k )] and for nearest neighbor queries [empirically observed average running time of O (log n ).] These performances far surpass the best currently known algorithms for these tasks. An algorithm is presented to handle any general intersection query. The main focus of this paper is theoretical. It is felt, however, that k -d trees could be quite useful in many applications, and examples of potential uses are given.
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 [1] . We weight the value @math corresponding to @math keys and we set it as @math .