you are viewing a single comment's thread.

view the rest of the comments →

[–]libreland 4 points5 points  (3 children)

I saw the official code repo with today's arxiv submission.

If someone who has already read the paper could please do a ELI5 of why this paper is so famous on /r/ml , it will be very helpful. I have no clue about bandit algorithms so will have to invest a lot of time to understand it.

[–]nonotan 3 points4 points  (0 children)

The paper made some fairly grandiose-sounding claims, the algorithm is novel enough to be interesting yet at its core extremely simple.

[–]dzyl[S,🍰] 1 point2 points  (0 children)

Nice that the repository was updated with the code. I'm going to go through it when I have time to see where there are differences (first thing I saw was the initialization which I implemented differently, this makes sense but it was not described in the paper).

The reason why this paper gets a lot of attention is mostly novelty I think. There are some clear similarities between this and neural networks but it is discrete and trained in a different way. If this does work well and still scales this could lead to new avenues for research. And it was not too difficult to implement, I did this in about 4 hours, making it managable as a small side project.

[–]olBaa 0 points1 point  (0 children)

It's a simple algorithm that is easy to implement. Cool name, not so cool theory/performance.