<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Differentially Private Recurrent Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1710.06963/</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/1710.06963/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Differentially Private Recurrent Language Models — mentioned by CyanTas</title><link>https://news.ycombinator.com/item?id=19945837</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.06963:19945837</guid><pubDate>Sat, 18 May 2019 05:29:09 GMT</pubDate><description>&lt;p&gt;You’re not wrong, but it does say those privacy risks can be mitigated with differential privacy. That McMahan et al. paper (which is also Google) makes the accuracy cost seem low. https://arxiv.org/abs/1710.06963&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.06963/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Learning Differentially Private Recurrent Language Models — mentioned by singhrac</title><link>https://news.ycombinator.com/item?id=16673605</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.06963:16673605</guid><pubDate>Sun, 25 Mar 2018 18:27:16 GMT</pubDate><description>&lt;p&gt;One problem I&amp;#x27;ve found with differential privacy is that no one talks about how to set \epsilon. I&amp;#x27;ve read this book, and it&amp;#x27;s quite well written and complete, but as the title says it focuses on the algorithmic foundations. This paper [1] is much better for practitioners, and actually gives very reasonable values for the privacy guarantee (e.g., (1.2, 1e-9)), and builds on this great paper: [2]. Worth a read if you train neural networks. [1]: https://arxiv.org/pdf/1710.06963.pdf [2]: https://arxiv.org/pdf/1607.00133.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.06963/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
