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
Currently, the CPU is bottlenecked, and it is unclear which augmentations will give the biggest speedup.
=> We need code for the benchmark and a page in the docs that shows the speed of each transform.
Some algorithms' performance depends on input types and parameters. For example, some algorithms have fast / approximate and exact implementations.
fast
approximate
exact
This could also be taken into account.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Currently, the CPU is bottlenecked, and it is unclear which augmentations will give the biggest speedup.
=> We need code for the benchmark and a page in the docs that shows the speed of each transform.
Some algorithms' performance depends on input types and parameters. For example, some algorithms have
fast
/approximate
andexact
implementations.This could also be taken into account.
The text was updated successfully, but these errors were encountered: