timestep scheduling with np.linspace#8622
Conversation
…face Signed-off-by: ytl0623 <david89062388@gmail.com>
for more information, see https://pre-commit.ci Signed-off-by: ytl0623 <david89062388@gmail.com>
…o fix-issue-8600
Signed-off-by: ytl0623 <david89062388@gmail.com>
|
Caution Review failedThe pull request is closed. WalkthroughThis PR refactors three loss classes in Estimated code review effort🎯 4 (Complex) | ⏱️ ~60 minutes
Areas requiring extra attention:
✨ Finishing touches
🧪 Generate unit tests (beta)
📜 Recent review detailsConfiguration used: Path: .coderabbit.yaml Review profile: CHILL Plan: Pro Cache: Disabled due to data retention organization setting Knowledge base: Disabled due to 📒 Files selected for processing (3)
Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. Comment |
Fixes #8600 .
Description
This
np.linspaceapproach generates a descending array that starts exactly at 999 and ends exactly at 0 (after rounding), ensuring the scheduler samples the entire intended trajectory.Types of changes
./runtests.sh -f -u --net --coverage../runtests.sh --quick --unittests --disttests.make htmlcommand in thedocs/folder.