<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ProGraML: Graph-based Deep Learning for Program Optimization and Analysis · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2003.10536/</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/2003.10536/feed.xml" rel="self" type="application/rss+xml" /><item><title>ProGraML: Graph-based Deep Learning for Program Optimization and Analysis — mentioned by Zacharias030</title><link>https://news.ycombinator.com/item?id=44430115</link><guid isPermaLink="false">urn:hackerpapers:mention:2003.10536:44430115</guid><pubDate>Tue, 01 Jul 2025 02:48:06 GMT</pubDate><description>&lt;p&gt;This was a hot topic in 2019-2020 and I just thought I‘ve read an article like this back then from NYU and another from the National University of Singapore, because I and many others were at the time independently working on graph problems using Transformers [0,1]. Turns out this article _is_ the one from NYU, just on arxiv now: https://graphdeeplearning.github.io/post/transformers-are-gn... [0] e.g. https://arxiv.org/abs/2003.10536, [1] ProteinMPNN, Dauparas et al.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2003.10536/"&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>
