<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Matryoshka Representation Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2205.13147/</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/2205.13147/feed.xml" rel="self" type="application/rss+xml" /><item><title>Matryoshka Representation Learning — mentioned by jsrozner</title><link>https://news.ycombinator.com/item?id=49233606</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.13147:49233606</guid><pubDate>Sun, 09 Aug 2026 17:44:20 GMT</pubDate><description>&lt;p&gt;The original MRL paper (https://arxiv.org/pdf/2205.13147) reported an SVD baseline, which showed comparable performance (Table 1, top-1 accuracy) at d&amp;gt;=256, but much degraded performance at lower dims (d \in {8,32,64}). (Though Table 2, nearest-neighbor accuracy, doesn&amp;#x27;t show degradation until d &amp;lt;= 16.) In your conclusion, you report that PCA won on most dimensions. Did you investigate why you found that PCA outperforms MRL when the original paper found that their SVD baseline did not?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.13147/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Matryoshka Representation Learning — HN submission</title><link>https://news.ycombinator.com/item?id=44743068</link><guid isPermaLink="false">urn:hackerpapers:submission:2205.13147:44743068</guid><pubDate>Thu, 31 Jul 2025 06:50:35 GMT</pubDate><description>&lt;p&gt;Matryoshka Representation Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;6 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2205.13147/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Matryoshka Representation Learning — mentioned by idontknowmuch</title><link>https://news.ycombinator.com/item?id=41176616</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.13147:41176616</guid><pubDate>Tue, 06 Aug 2024 23:29:38 GMT</pubDate><description>&lt;p&gt;Ahh that&amp;#x27;s an interesting paper I must of missed that one - thanks for the link. I think another paper that recently got a lot of hype has been the Matroyshka representation learning paper -- essentially training models with different parameters and output embedding sizes at the same time, basically distillation during training rather than post-training (https://arxiv.org/abs/2205.13147).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.13147/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Matryoshka Representation Learning — HN submission</title><link>https://news.ycombinator.com/item?id=39212905</link><guid isPermaLink="false">urn:hackerpapers:submission:2205.13147:39212905</guid><pubDate>Thu, 01 Feb 2024 05:12:32 GMT</pubDate><description>&lt;p&gt;Matryoshka Representation Learning&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;83 points; 11 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2205.13147/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
