<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Enabling tabular deep learning when $d \gg n$ with an auxiliary knowledge graph · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2306.04766/</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/2306.04766/feed.xml" rel="self" type="application/rss+xml" /><item><title>Enabling tabular deep learning when $d \gg n$ with an auxiliary knowledge graph — mentioned by Silamoth</title><link>https://news.ycombinator.com/item?id=36849137</link><guid isPermaLink="false">urn:hackerpapers:mention:2306.04766:36849137</guid><pubDate>Mon, 24 Jul 2023 15:02:11 GMT</pubDate><description>&lt;p&gt;I recently read &amp;quot;Enabling tabular deep learning when d ≫ n with an auxiliary knowledge graph&amp;quot; (https://arxiv.org/pdf/2306.04766.pdf) for one of my graduate classes. Essentially, when there are significantly more data points than features (n &amp;gt;&amp;gt; d), machine learning usually works fine (assuming data quality, an underlying relationship, etc.). But, for sparse datasets where there are fewer data points than features (d &amp;gt;&amp;gt; n), most machine learning methods fail. There&amp;#x27;s just not enough data to learn all the relationships. This paper builds a knowledge graph based on relationships and other…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2306.04766/"&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>
