Before revision:  The algorithm is also proven robust as it remains to outperform beam search significantly even with corrupted attention distributions  .
After revision:  The algorithm is also proven robust as it remains to outperform beam search significantly even with corrupted attention distributions . The codes and a comprehensive set of examples are available .