<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1709.05135/</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/1709.05135/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity — mentioned by Tananon</title><link>https://news.ycombinator.com/item?id=45641785</link><guid isPermaLink="false">urn:hackerpapers:mention:1709.05135:45641785</guid><pubDate>Mon, 20 Oct 2025 09:24:25 GMT</pubDate><description>&lt;p&gt;That&amp;#x27;s indeed something I plan to add in the near future. I&amp;#x27;ll probably add a tutorial as well to showcase how you can use this with e.g. sentence transformers. There&amp;#x27;s some pretty good benchmarks in the paper that I used as inspiration for some of these algorithms: https://arxiv.org/pdf/1709.05135, I&amp;#x27;ll most likely try to reproduce some of these.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1709.05135/"&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>
