<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the Difficulty of Evaluating Baselines: A Study on Recommender Systems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1905.01395/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1905.01395/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the Difficulty of Evaluating Baselines: A Study on Recommender Systems — mentioned by samplenoise</title><link>https://news.ycombinator.com/item?id=27758918</link><guid isPermaLink="false">urn:hackerpapers:mention:1905.01395:27758918</guid><pubDate>Wed, 07 Jul 2021 08:58:19 GMT</pubDate><description>&lt;p&gt;The author is still underselling the significance of the progress made during the first years IMO. The simple idea that is still behind most practical recommender systems (using gradient descent to do SVD to complete the rating matrix) was first described in 2006 by Simon Funk [1]. Koren, who ended up taking home a big part of the prize, recently wrote another paper about how that basic idea still outperforms most “AI” (deep neural) recommenders today [2]. [1] https://sifter.org/~simon/journal/20061211.html [2] https://arxiv.org/abs/1905.01395&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1905.01395/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IR</category></item></channel></rss>
