<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Prompt · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.11186/</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/2305.11186/feed.xml" rel="self" type="application/rss+xml" /><item><title>Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Prompt — mentioned by austegard</title><link>https://news.ycombinator.com/item?id=36053009</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.11186:36053009</guid><pubDate>Wed, 24 May 2023 01:38:36 GMT</pubDate><description>&lt;p&gt;This falls in the category of circumstantial, possibly just coincidental evidence of Chat being a &amp;quot;compressed&amp;quot; model (quantized, pruned, or distilled): the hard prompt from this paper: Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Prompt - https://arxiv.org/abs/2305.11186, coupled with the latest SoTA CoT prompt makes Turbo solve a math problem it stubbornly won&amp;#x27;t without the combined prompt: https://mastodon.social/@austegard/110419399521303416 The combined prompt that does the trick is: Instructions: Please carefully examine the weight…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.11186/"&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>
