optax
optax copied to clipboard
Add an assignment problem solver
Feature request: Add a GPU/TPU-friendly solver for the assignment problem. For context, see:
- scipy.optimize.linear_sum_assignment
- https://github.com/google/jax/issues/10403
- https://github.com/google/jax/pull/16974
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
Potentially relevant literature:
- A distributed auction algorithm for the assignment problem (2008)
- Bipartite Graph Matching Computation on GPU (2009)
- An anytime assignment algorithm: From local task swapping to global optimality (2013)
- On implementing 2D rectangular assignment algorithms (2016)
- GPU-accelerated Hungarian algorithms for the Linear Assignment Problem (2016)
- Fast block distributed CUDA implementation of the Hungarian algorithm (2019)
- Development of an Accelerating Hungarian Method for Assignment Problems (2021)
- Algorithm 1015: A Fast Scalable Solver for the Dense Linear (Sum) Assignment Problem (2021)
- New auction algorithms for the assignment problem and extensions (2024)