There are many empirical studies which show for feature hashing, a few collisions don't have a sig impact on perf (https://youtu.be/ARjNMdCzN-Q?t=599).
However, for some archs, the impact is catastrophic. Eg matrix factorization. Any collision leads to an incorrect item. Zero Collision Hashing addresses the problem of mapping collisions. One technique is to introduce state into the hashing fn using the current id assignments.
real time publishing protocol:
* minute-level weight syncing
* delta pushes only
* ignore machine failures and rely on (possibly stale) full snapshot loading to bootstrap the new hosts
There are many empirical studies which show for feature hashing, a few collisions don't have a sig impact on perf (https://youtu.be/ARjNMdCzN-Q?t=599).
However, for some archs, the impact is catastrophic. Eg matrix factorization. Any collision leads to an incorrect item. Zero Collision Hashing addresses the problem of mapping collisions. One technique is to introduce state into the hashing fn using the current id assignments.
real time publishing protocol:
* minute-level weight syncing * delta pushes only * ignore machine failures and rely on (possibly stale) full snapshot loading to bootstrap the new hosts