[research] Papers in 2018

[vmarkovtsev]

Papers we will love:

• [x] Efficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures. Wei Dong, Moses Charikar Kai Li
• [ ] BagMinHash – Minwise Hashing Algorithm for Weighted Sets. Otmar Ertl
• [ ] Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. Yu. A. Malkov, D. A. Yashunin
• [x] UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. Leland McInnes, John Healy
• [ ] Graph Attention Networks. Petar Veličković, etc, Yoshua Bengio

Please propose more papers in the comments! I will review them and decide if they should be studied by everybody.

[vmarkovtsev]

DD: https://docs.google.com/document/d/1Mt5tGQnhhqtEeHgZdjp0qaNA1cn6XiyTtlfSZRXAx_w

[zurk]

I want to spend some time with Graph Attention Networks. Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, Yoshua Bengio @EgorBu shared this paper in dev-ml channel

[vmarkovtsev]

@zurk Please append it to the list.

[vmarkovtsev]

February -> April, lol!

[zurk]

I think we should drop this issue. It is meaningless :)

[vmarkovtsev]

Papers are not read so nothing to drop.

[zurk]

Ok, my progress:

• [ ] Efficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures. Wei Dong, Moses Charikar Kai Li
• [x] BagMinHash – Minwise Hashing Algorithm for Weighted Sets. Otmar Ertl
• [ ] Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. Yu. A. Malkov, D. A. Yashunin
• [x] UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. Leland McInnes, John Healy
• [x] Graph Attention Networks. Petar Veličković, etc, Yoshua Bengio

[zurk]

ok, @vmarkovtsev it is a useless issue. let's close it because we have a paper reading club and read papers for it.

[vmarkovtsev]

cc @m09

[m09]

I've looked at those already, thanks for the cc :)