<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Towards General Text Embeddings with Multi-stage Contrastive Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2308.03281/</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.03281/feed.xml" rel="self" type="application/rss+xml" /><item><title>Towards General Text Embeddings with Multi-stage Contrastive Learning — mentioned by ntonozzi</title><link>https://news.ycombinator.com/item?id=41780316</link><guid isPermaLink="false">urn:hackerpapers:mention:2308.03281:41780316</guid><pubDate>Tue, 08 Oct 2024 18:29:23 GMT</pubDate><description>&lt;p&gt;One important factor this article neglects to mention is that modern text embedding models are trained to maximize distance of dissimilar texts under a specific metric. This means that the embedding vector is not just latent weights plucked from the last layer of a model, but instead specifically trained to be used with a particular distance function, which is the cosine distance for all the models I&amp;#x27;m familiar with. You can learn more about how modern embedding models are trained from papers like Towards General Text Embeddings with Multi-stage Contrastive Learning…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2308.03281/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
