We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
你好! 首先表示感谢,代码非常清晰易懂,唯一有点疑惑的是bptt的实现方式。 代码中是从前向后遍历T,用的是用t时刻的diff去算t-1 ~ 0 的梯度,是否使用t时刻diff由t+1时刻的梯度决定的方式会比较好一些,这样从后向前遍历T,一个循环就足够了。不过这样的话无法控制梯度传递的时间长度。
The text was updated successfully, but these errors were encountered:
No branches or pull requests
你好!
首先表示感谢,代码非常清晰易懂,唯一有点疑惑的是bptt的实现方式。
代码中是从前向后遍历T,用的是用t时刻的diff去算t-1 ~ 0 的梯度,是否使用t时刻diff由t+1时刻的梯度决定的方式会比较好一些,这样从后向前遍历T,一个循环就足够了。不过这样的话无法控制梯度传递的时间长度。
The text was updated successfully, but these errors were encountered: