<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Demystifying Prompts in Language Models via Perplexity Estimation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2212.04037/</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/2212.04037/feed.xml" rel="self" type="application/rss+xml" /><item><title>Demystifying Prompts in Language Models via Perplexity Estimation — mentioned by mm321</title><link>https://news.ycombinator.com/item?id=35926083</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.04037:35926083</guid><pubDate>Sat, 13 May 2023 06:15:10 GMT</pubDate><description>&lt;p&gt;I don&amp;#x27;t understand this whole business of page long prompts, the following article says that this kind of short LLM prompts work the best - and they actually measured the performance of the different kinds of prompts! https://arxiv.org/pdf/2212.04037.pdf &amp;quot;we devise the following straightforward procedure: 1. Obtain a small set of manually created prompts for the task. 2. Expand the set of prompts with automatic paraphrasing using a LM (e.g., GPT3) and backtranslation (see Section 3). 3. Rank the list of prompts by perplexity (aver- aged on a representative sample of task inputs, e.g. 1,000).…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.04037/"&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>Demystifying Prompts in Language Models via Perplexity Estimation — HN submission</title><link>https://news.ycombinator.com/item?id=35925471</link><guid isPermaLink="false">urn:hackerpapers:submission:2212.04037:35925471</guid><pubDate>Sat, 13 May 2023 04:19:53 GMT</pubDate><description>&lt;p&gt;Do the simplest LLM prompts work best?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2212.04037/"&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>
