论文标题
解释了KASS算法实施的性能不佳
Explaining the poor performance of the KASS algorithm implementation
论文作者
论文摘要
通过研究“使用计算机游戏探索量子速度限制”中使用的KASS算法实现的代码[1，Arxiv：1506.09091]，由Sørensen等人。 （由作者提供），我们描述了[1]中报道的KASS算法的差的性能较差是完全由衍生化计算中简单的符号误差引起的。在KASS实现中仅更改这个符号，我们表明该算法提供的结果可与问题[2,7]所考虑的所有其他算法相媲美，并且比[1]的所有播放器解决方案的性能更好。此外，我们表明，在将播放器解决方案与KASS算法的结果进行比较之前，用不同的算法进行了优化。 [1]的作者都承认了这两个发现。最后，我们表明，与[1]中的主张相反，玩家没有探索两种不同的策略。实际上，所有玩家都遵循相同的策略。
By investigating the code for the KASS algorithm implementation used in the paper "Exploring the quantum speed limit with computer games" [1, arXiv:1506.09091] by Sørensen et al. (provided by the authors), we describe how the poor performance of the KASS algorithm reported in [1] is entirely caused by a simple sign error in a derivative calculation. Changing only this one sign in the KASS implementation, we show that the algorithm provides results comparable to all other algorithms considered for the problem [2,7], and performs better than all player solutions of [1]. Furthermore, we show that the player solutions were optimized with a different algorithm before being compared to the results from the KASS algorithm. The authors of [1] have acknowledged both findings. Finally, we show that in contrast to the claims in [1], the players did not explore two different strategies. In fact, all the players followed the same strategy.
