<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ai-Systems on Saurav Panigrahi</title><link>https://sauravpanigrahi.com/tags/ai-systems/</link><description>Recent content in Ai-Systems on Saurav Panigrahi</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 01 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sauravpanigrahi.com/tags/ai-systems/feed.xml" rel="self" type="application/rss+xml"/><item><title>Adaptive Sampling Networks</title><link>https://sauravpanigrahi.com/work/adaptive-sampling-networks/</link><pubDate>Fri, 01 May 2026 00:00:00 +0000</pubDate><guid>https://sauravpanigrahi.com/work/adaptive-sampling-networks/</guid><description>&lt;p&gt;Co-authored with Navneel Singhal.&lt;/p&gt;
&lt;p&gt;Adaptive Sampling Networks explore a simple question: can the decoding strategy of a language model be learned, instead of fixed by hand-tuned heuristics like temperature, top-k, or nucleus sampling?&lt;/p&gt;
&lt;h2 id="problem"&gt;Problem&lt;/h2&gt;
&lt;p&gt;Most LLM deployments treat decoding as a hyperparameter choice. The same sampling rule is applied across prompts, uncertainty regimes, and output distributions.&lt;/p&gt;
&lt;p&gt;That is useful, but rigid. A sampler should be able to respond to the shape of the probability distribution it receives.&lt;/p&gt;</description></item></channel></rss>