<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deep Learning with Differential Privacy · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1607.00133/</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/1607.00133/feed.xml" rel="self" type="application/rss+xml" /><item><title>Deep Learning with Differential Privacy — mentioned by maximeago</title><link>https://news.ycombinator.com/item?id=30708690</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.00133:30708690</guid><pubDate>Thu, 17 Mar 2022 08:02:22 GMT</pubDate><description>&lt;p&gt;If the model training is designed to profile just one user, no, the model won&amp;#x27;t work by design. What you describe is an attack on the privacy of that user and we do want to make sure they fail. The way differential privacy works with machine learning is that it guarantees that one given record cannot have a significant impact on the weights of the models and therefore on its performance. In the particular case of SGD-based models, the guarantee holds for every step of the descent. A good place to start on the topic is Abadi 2016 (https://arxiv.org/pdf/1607.00133.pdf). What is important in the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.00133/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Deep Learning with Differential Privacy — mentioned by singhrac</title><link>https://news.ycombinator.com/item?id=16673605</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.00133: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/1607.00133/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Deep Learning with Differential Privacy — mentioned by chubot</title><link>https://news.ycombinator.com/item?id=12665594</link><guid isPermaLink="false">urn:hackerpapers:mention:1607.00133:12665594</guid><pubDate>Sat, 08 Oct 2016 03:57:15 GMT</pubDate><description>&lt;p&gt;I admit I geeked out and calculated this a couple months ago, after I was credited on my first academic paper (my career is in programming) If you count video games, I have a Bacon number of 3 because I was credited on Tiger Woods 2003-2005 with an artist named Sylvain Doreau, who is credited on Shrek. John Lithgow was in Shrek and in Footloose with Kevin Bacon. My former coworker Li Zhang has an Erdos number of 2 and we worked together on this paper: https://arxiv.org/abs/1607.00133 (with him doing a lot more work than me). So putting that together is an Erdos-Bacon number of 3 + 3 = 6.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1607.00133/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
