<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Stochastic gradient descent with gradient estimator for categorical features · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2209.03771/</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/2209.03771/feed.xml" rel="self" type="application/rss+xml" /><item><title>Stochastic gradient descent with gradient estimator for categorical features — mentioned by victorNicollet</title><link>https://news.ycombinator.com/item?id=35067001</link><guid isPermaLink="false">urn:hackerpapers:mention:2209.03771:35067001</guid><pubDate>Wed, 08 Mar 2023 09:36:44 GMT</pubDate><description>&lt;p&gt;We&amp;#x27;ve been doing this type of gradient descent in production for a couple of years now, and we&amp;#x27;ve been very happy with it. A few insights from my experience: One of the main benefits of doing differentiable programming over a relational database is that you can use joins to traverse the normalized data schema, and this acts as a very effective prior for your model. For example, you can learn parameters associated to shirt colors by having a parameter in the color table, and joining it with the shirt sales table (through the shirts table). And knowledge of the table structure also lets you…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2209.03771/"&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>
