<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: Devilstro</title><link>https://news.ycombinator.com/user?id=Devilstro</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 08 May 2026 14:23:45 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Devilstro" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by Devilstro in "A polynomial autoencoder beats PCA on transformer embeddings"]]></title><description><![CDATA[
<p>In the article, you mention this approach requires no search over hyper-parameter, because the method comprises a closed-form solution with "simple" linear algebra. I agree with this, but do you not in think need to tune the L2-regularization strength? That would for me be a hyper-parameter you would need to do a CV over (or similarly).</p>
]]></description><pubDate>Fri, 08 May 2026 08:05:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=48060114</link><dc:creator>Devilstro</dc:creator><comments>https://news.ycombinator.com/item?id=48060114</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48060114</guid></item></channel></rss>