<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>HiPPO: Recurrent Memory with Optimal Polynomial Projections · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2008.07669/</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/2008.07669/feed.xml" rel="self" type="application/rss+xml" /><item><title>HiPPO: Recurrent Memory with Optimal Polynomial Projections — mentioned by ondrysak</title><link>https://news.ycombinator.com/item?id=26981531</link><guid isPermaLink="false">urn:hackerpapers:mention:2008.07669:26981531</guid><pubDate>Thu, 29 Apr 2021 14:22:48 GMT</pubDate><description>&lt;p&gt;Given the fact that fourier basis, can be seen as polynomials on unit circle, this may be intresting for some of you. https://arxiv.org/abs/2008.07669&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2008.07669/"&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>
