<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph Attention Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1710.10903/</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.10903/feed.xml" rel="self" type="application/rss+xml" /><item><title>Graph Attention Networks — mentioned by paulmorio</title><link>https://news.ycombinator.com/item?id=34511078</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.10903:34511078</guid><pubDate>Tue, 24 Jan 2023 21:56:11 GMT</pubDate><description>&lt;p&gt;I have done this a few times now. Alone (e.g. https://github.com/paulmorio/geo2dr) and in collaboration with others (e.g. https://github.com/benedekrozemberczki/pytorch_geometric_tem...) primarily as a way to learn about the methods I was interested in from a research perspective whilst improving my skills in software engineering. I am still learning. Starting out I would recommend implementing fundamental building blocks within whatever &amp;#x27;subculture&amp;#x27; of ML you are interested in whether that be DL, kernel methods, probabilistic models, etc. Let&amp;#x27;s say you are interested in deep learning methods…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.10903/"&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>Graph Attention Networks — mentioned by nmca</title><link>https://news.ycombinator.com/item?id=17387981</link><guid isPermaLink="false">urn:hackerpapers:mention:1710.10903:17387981</guid><pubDate>Sun, 24 Jun 2018 19:29:06 GMT</pubDate><description>&lt;p&gt;The latter of those two points is much more valid than the former. You&amp;#x27;re comment about generalisation difficulty is pretty accurate, but as for &amp;quot;sucks at variable length data&amp;quot;, I think neural machine translation [0] and the fact that schemes including RNNs just won M4 [1] indicate that this is incorrect. Your point about remembering the past is true (it&amp;#x27;s hard), but people are actively working on it. Unitary neural nets, and the fast/slow weight paradigm are very different angles that seem promising. As for handling trees + graphs, this actually works very well. Thomas Kipf is pushing this…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1710.10903/"&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>
