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.
What does this PR do?
This PR speeds up the FFD packing implementation by using the
pyarrow.compute
API instead ofnumpy
and a segment tree structure for efficient bin size querying (the time complexity goes down fromO(batch_size * seq_length)
toO(batch_size * log(seq_length))
).These are the benchmark results (≈ 3.5 faster; the benchmark comes from #3521):
Benchmark
main
#3524
this version
Additionally, I ran a benchmark on the tokenized Alpaca dataset, and the speed-up there is even more significant with larger
seq_len
.Before submitting
Pull Request section?
to it if that's the case.
Who can review?
Anyone in the community is free to review the PR once the tests have passed. Feel free to tag
members/contributors who may be interested in your PR.