Pearlmutter B A, Sanatchandran P
Dept. of Comput. Sci. and Eng., Oregon Graduate Inst. of Sci. and Technol., Beaverton, OR.
IEEE Trans Neural Netw. 1992;3(6):1028-9. doi: 10.1109/72.165609.
The commenter claims that in the above-titled paper (ibid., vol.2, p.465-467, July 1991), which presents an efficient algorithm using dynamic programming to find weights which load a set of examples into a feedforward neural network with minimal error, a contradiction lies buried in the paper's notation. In reply, the author maintains that the comments are due to some misunderstandings about the implementation of dynamic-programming-based algorithms and clarifies the work.
评论者声称，在上述标题的论文（出处同上，第2卷，第465 - 467页，1991年7月）中，该论文提出了一种使用动态规划的高效算法来找到权重，以便将一组示例以最小误差加载到前馈神经网络中，但论文的符号表示中存在一个矛盾之处。作为回应，作者坚称这些评论是由于对基于动态规划的算法实现存在一些误解，并对该工作进行了澄清。
