<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Communication-Optimal Convolutional Neural Nets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1802.06905/</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/1802.06905/feed.xml" rel="self" type="application/rss+xml" /><item><title>Communication-Optimal Convolutional Neural Nets — mentioned by _ks3e</title><link>https://news.ycombinator.com/item?id=20483340</link><guid isPermaLink="false">urn:hackerpapers:mention:1802.06905:20483340</guid><pubDate>Fri, 19 Jul 2019 23:50:44 GMT</pubDate><description>&lt;p&gt;In terms of trying to break free of dependence on hand optimized kernels: a few people, myself included, have been working on some theoretical approaches to generating cache-efficient rearrangements for neutral net like problems. We&amp;#x27;ve worked it out for convolution like problems [1] and have some upcoming results generalizing these techniques to other problems. Please feel free to email if you&amp;#x27;d like to talk. [1] https://arxiv.org/abs/1802.06905&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1802.06905/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
