A quantum-inspired classical algorithm for recommendation systems · HackerPapers discussions

A quantum-inspired classical algorithm for recommendation systems — mentioned by chrispeel

Fri, 01 Nov 2019 15:03:54 GMT

From the article > So far there has been a lot of excitement but also a lot of crushed dreams and backtracking, when solutions giving a quantum boost were later again beaten by classical computers, e.g. Ewin Tang showed this in some cases last summer (check his paper or story in Quanta). Minor: Ewin is a woman. The paper referred to is at https://arxiv.org/pdf/1807.04271.pdf

Paper and discussion history. A mention is not an endorsement.

A quantum-inspired classical algorithm for recommendation systems — mentioned by noname120

Sun, 29 Sep 2019 12:58:38 GMT

I'd like to take the opportunity to clear a misunderstanding that I've seen in several threads related to quantum computing. ————————————————————————————————————————————————————————— The classes of complexity of interest here are P, NP, BPP, and BQP. — P corresponds to the problems that can be solved by a classical computer (deterministic Turing machine) in polynomial time. For example finding a shortest path between nodes in a graph is in this complexity class. — NP corresponds to the problems where “verifying a solution” is in P. In other words, it's “easy” to check if a solution is…

Paper and discussion history. A mention is not an endorsement.

A quantum-inspired classical algorithm for recommendation systems — mentioned by joe_the_user

Tue, 31 Jul 2018 18:37:28 GMT

Looking at the paper, I think the fact that this is a recommendation algorithm is fairly important. The big thing is that broadly "the recommendation algorithm" is not some single problem in combinatorics. Rather, it a initially ill-posed problem that yields concrete problems based on simplifying assumptions. IE, sure, the FINAL, SOLVED problem is as Aaronson put it but because different researchers make different simplifying assumptions, that final problem actually hadn't studied that much - half the achievement of the paper is finding simplifying assumptions that are real world-plausible…

Paper and discussion history. A mention is not an endorsement.

A quantum-inspired classical algorithm for recommendation systems — mentioned by tsucres

Tue, 31 Jul 2018 17:54:13 GMT

The paper [1] states: > There is a classical algorithm whose output distribution is O(ε)-close in total variation distance to the distribution given by l2-norm sampling from the ith row of a low- rank approximation D of A in query and time complexity [O(poly-func)] where δ is the probability of failure. So the classical algorithm would give a "sufficiently close" approximation of what the QML would output? The article doesn't mention this at all. Is it fair to compare a quantum algorithm with an equivalent classical approximation algorithm? From the quanta magazine article: > Computer…

Paper and discussion history. A mention is not an endorsement.

A quantum-inspired classical algorithm for recommendation systems — mentioned by denzil_correa

Tue, 31 Jul 2018 17:50:42 GMT

The preprint has no mention of Scott Aaronson as an author though. https://arxiv.org/abs/1807.04271

Paper and discussion history. A mention is not an endorsement.

A quantum-inspired classical algorithm for recommendation systems — mentioned by gonehome

Tue, 31 Jul 2018 17:46:45 GMT

It's worth noting that the title of the paper does emphasize this: A quantum-inspired classical algorithm for recommendation systems. The abstract does too: https://arxiv.org/abs/1807.04271

Paper and discussion history. A mention is not an endorsement.

A quantum-inspired classical algorithm for recommendation systems — HN submission

Sat, 14 Jul 2018 18:44:31 GMT

A quantum-inspired classical algorithm for recommendation systems

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.