<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Text Embeddings Reveal (Almost) As Much As Text · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2310.06816/</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/2310.06816/feed.xml" rel="self" type="application/rss+xml" /><item><title>Text Embeddings Reveal (Almost) As Much As Text — mentioned by hallh</title><link>https://news.ycombinator.com/item?id=42744302</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.06816:42744302</guid><pubDate>Fri, 17 Jan 2025 23:24:18 GMT</pubDate><description>&lt;p&gt;No, the original text can largely be recovered from embeddings[0] if you know which embedding model was used. [0] https://arxiv.org/abs/2310.06816&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Text Embeddings Reveal (Almost) As Much As Text — mentioned by visarga</title><link>https://news.ycombinator.com/item?id=40943758</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.06816:40943758</guid><pubDate>Fri, 12 Jul 2024 08:41:37 GMT</pubDate><description>&lt;p&gt;I remembered about a paper that sheds light on this issue. An embedding can store/recover exactly a short sentence: &amp;gt; a multi step method that iteratively corrects and re embeds text is able to recover 92% of 32-token text inputs exactly https://arxiv.org/abs/2310.06816 So it&amp;#x27;s probably 1 sentence == 1 embedding&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Text Embeddings Reveal (Almost) As Much As Text — mentioned by tripplyons</title><link>https://news.ycombinator.com/item?id=40694161</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.06816:40694161</guid><pubDate>Sun, 16 Jun 2024 02:04:30 GMT</pubDate><description>&lt;p&gt;Text embeddings should not be used as a form of encryption. They are optimized to contain as much information as possible from the text they represent and can often be decoded into their input: https://arxiv.org/abs/2310.06816&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Text Embeddings Reveal (Almost) As Much As Text — mentioned by jncraton</title><link>https://news.ycombinator.com/item?id=39608312</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.06816:39608312</guid><pubDate>Tue, 05 Mar 2024 19:43:39 GMT</pubDate><description>&lt;p&gt;You might be interested in &amp;quot;Text Embeddings Reveal (Almost) As Much As Text&amp;quot;: &amp;gt; We train our model to decode text embeddings from two state-of-the-art embedding models, and also show that our model can recover important personal information (full names) from a dataset of clinical notes. https://arxiv.org/pdf/2310.06816.pdf There&amp;#x27;s certainly information loss, but there is also a lot of information still present.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Text Embeddings Reveal (Almost) As Much As Text — mentioned by wint3rmute</title><link>https://news.ycombinator.com/item?id=38659306</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.06816:38659306</guid><pubDate>Fri, 15 Dec 2023 21:56:40 GMT</pubDate><description>&lt;p&gt;A recent paper [1] shows that what you&amp;#x27;re describing is possible to some degree - you can reproduce text from its embeddings. The paper provides the code implementing the reversal process, so you could quickly hack together a prototype :) I also recommend a video by Yannic Kilcher [2], explaining the paper. [1] https://arxiv.org/abs/2310.06816 [2] https://www.youtube.com/watch?v=FY5j3P9tCeA&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Text Embeddings Reveal (Almost) As Much As Text — mentioned by visarga</title><link>https://news.ycombinator.com/item?id=38095010</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.06816:38095010</guid><pubDate>Wed, 01 Nov 2023 05:49:36 GMT</pubDate><description>&lt;p&gt;Phrase embeddings could bring a 32x reduction in sequence length because: &amp;gt; Text Embeddings Reveal (Almost) As Much As Text. ... We find that although a naïve model conditioned on the embedding performs poorly, a multi step method that iteratively corrects and re embeds text is able to recover 92% of 32-token text inputs exactly. We train our model to decode text embeddings from two state of the art embedding models, and also show that our model can recover important personal information (full names) from a dataset of clinical notes. https://arxiv.org/abs/2310.06816&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Text Embeddings Reveal (Almost) As Much As Text — HN submission</title><link>https://news.ycombinator.com/item?id=37867635</link><guid isPermaLink="false">urn:hackerpapers:submission:2310.06816:37867635</guid><pubDate>Fri, 13 Oct 2023 07:03:47 GMT</pubDate><description>&lt;p&gt;Text embeddings reveal almost as much as text&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;165 points; 42 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2310.06816/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
