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
Feature request: Add a GPU/TPU-friendly solver for the assignment problem. For context, see:
scipy.optimize.linear_sum_assignment
The last page contains the following comment:
There is a TPU-friendly implementation of the Hungarian algorithm here: https://github.com/google-research/scenic/blob/main/scenic/model_lib/matchers/hungarian_cover.py
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Feature request: Add a GPU/TPU-friendly solver for the assignment problem. For context, see:
scipy.optimize.linear_sum_assignment
google/jax#10403The last page contains the following comment:
The text was updated successfully, but these errors were encountered: