This repository has been archived by the owner on Nov 17, 2023. It is now read-only.
[WIP] Fix non-determinism in sparse embedding #9846
Closed
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
. UsingSparseEmbedding
andEmbedding
results 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::Unique
instead ofcub::InclusiveSum
to generate lookup table.@ZiyueHuang @sxjscience
Checklist
Essentials
make lint
)Changes
Comments