This repository was archived by the owner on Nov 17, 2023. It is now read-only.
[WIP] Fix non-determinism in sparse embedding#9846
Closed
eric-haibin-lin wants to merge 2 commits intoapache:masterfrom
Closed
[WIP] Fix non-determinism in sparse embedding#9846eric-haibin-lin wants to merge 2 commits intoapache:masterfrom
eric-haibin-lin wants to merge 2 commits intoapache:masterfrom
Conversation
* refactor embed backward kernelcallker * pass unit test * refactor * fix dim bug * add unique impl * remove old op * remove unused kernel
948c5a3 to
9e80d58
Compare
7 tasks
Merged
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Description
The original GPU sparse embedding operator uses atomic add which results non-deterministic gradient due to limited precision of fp32 and non-deterministic execution order. This PR replaces atomic add with sort to guarantee determinism.
Tested with
example/rnn/word_lm/train.py. UsingSparseEmbeddingandEmbeddingresults the same loss with fixed seed.The fixes makes the backward pass ~50% slower compared to the atomic_add implementation, measured by the script at the end. Further optimization can be done using
cub::Uniqueinstead ofcub::InclusiveSumto generate lookup table.@ZiyueHuang @sxjscience
Checklist
Essentials
make lint)Changes
Comments