Adding ScaNN library to do MIPS?
{'login': 'shamanez', 'id': 16892570, 'node_id': 'MDQ6VXNlcjE2ODkyNTcw', 'avatar_url': 'https://avatars.githubusercontent.com/u/16892570?v=4', 'gravatar_id': '', 'url': 'https://api.github.com/users/shamanez', 'html_url': 'https://github.com/shamanez', 'followers_url': 'https://api.github.com/users/shamanez/followers', 'following_url': 'https://api.github.com/users/shamanez/following{/other_user}', 'gists_url': 'https://api.github.com/users/shamanez/gists{/gist_id}', 'starred_url': 'https://api.github.com/users/shamanez/starred{/owner}{/repo}', 'subscriptions_url': 'https://api.github.com/users/shamanez/subscriptions', 'organizations_url': 'https://api.github.com/users/shamanez/orgs', 'repos_url': 'https://api.github.com/users/shamanez/repos', 'events_url': 'https://api.github.com/users/shamanez/events{/privacy}', 'received_events_url': 'https://api.github.com/users/shamanez/received_events', 'type': 'User', 'site_admin': False}
[]
[]
I haven't played with it (yet) but it sounds really cool !

@lhoestq Hi I am thinking of adding this new google library to do the MIPS similar to **add_faiss_idex**. As the paper suggests, it is really fast when it comes to retrieving the nearest neighbors. 

https://github.com/google-research/google-research/tree/master/scann

![image](https://user-images.githubusercontent.com/16892570/112738294-78ec9800-8fc6-11eb-9a5f-3d7ee5818e76.png)

{'url': 'https://api.github.com/repos/huggingface/datasets/issues/2124/reactions', 'total_count': 0, '+1': 0, '-1': 0, 'laugh': 0, 'hooray': 0, 'confused': 0, 'heart': 0, 'rocket': 0, 'eyes': 0}