<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TpuGraphs: A Performance Prediction Dataset on Large Tensor Computational Graphs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2308.13490/</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/2308.13490/feed.xml" rel="self" type="application/rss+xml" /><item><title>TpuGraphs: A Performance Prediction Dataset on Large Tensor Computational Graphs — mentioned by aconz2</title><link>https://news.ycombinator.com/item?id=38665659</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.13490:38665659</guid><pubDate>Sat, 16 Dec 2023 16:51:38 GMT</pubDate><description>&lt;p&gt;summary: improve prediction of run-time performance of a computation graph using GNN, they use an embedding dictionary for each node&amp;#x27;s opcode along with some other node features (eg shape, bits, window size, see [1]), they released a big dataset of these graphs in [2] with varying XLA compilation configurations and their resulting perf on TPUs, they did some stuff to improve prediction on bigger graphs than before in [3] by partitioning the graph (METIS graph partition, new to me) and other training things This is only about predicting performance of a given graph and not about…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.13490/"&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>
