{"podcast":{"title":"Best AI papers explained","slug":"best-ai-papers-explained-7258006","podcast_index_feed_id":7258006,"rss_url":"https://anchor.fm/s/1026675f8/podcast/rss","website_url":"https://podcasters.spotify.com/pod/show/ehwkang","image_url":"https://d3t3ozftmdmh3i.cloudfront.net/staging/podcast_uploaded_nologo/43252366/43252366-1744500070152-e62b760188d8.jpg","author":"Enoch H. Kang","episode_count":789,"summary":"Cut through the noise. We curate and break down the most important AI papers so you don’t have to.","last_synced_at":"2026-07-19T16:17:08.576018+00:00","page_url":"https://stenobird.com/podcast/best-ai-papers-explained-7258006"},"episode":{"title":"What Does Thompson Sampling Optimize?","slug":"what-does-thompson-sampling-optimize","published_at":"2026-07-15T00:33:57+00:00","page_url":"https://stenobird.com/podcast/best-ai-papers-explained-7258006/what-does-thompson-sampling-optimize","show_page_url":"https://stenobird.com/podcast/best-ai-papers-explained-7258006","url":"https://podcasters.spotify.com/pod/show/ehwkang/episodes/What-Does-Thompson-Sampling-Optimize-e3m3i4n","audio_url":"https://anchor.fm/s/1026675f8/podcast/play/122848855/https%3A%2F%2Fd3ctxlq1ktw2nl.cloudfront.net%2Fstaging%2F2026-6-15%2Fbf0023f1-051f-dddd-ffc6-a14d758473e2.m4a","summary":"This research paper investigates the underlying mechanisms of Thompson Sampling, a popular bandit algorithm, by reframing it as an online optimization process. While traditionally viewed as a simple heuristic, the authors prove that Thompson Sampling actually minimizes instantaneous squared regret regularized by a specific measure of residual uncertainty. By comparing this mechanism to a Bellman-optimal benchmark, the study identifies a performance gap caused by Thompson Sampling's failure to account for the "tension" between exploration and exploitation. To address this, the authors propose a principled fix that adaptively shuts down exploration when the leading arm also provides the most information. Ultimately, this framework provides a theoretical compass for improving randomized algorithms by treating policy design as regularizer engineering.","meta_description":"This research paper investigates the underlying mechanisms of Thompson Sampling, a popular bandit algorithm, by reframing it as an online optimization pro…","key_points":[],"chapters":[],"topics":[],"duration_seconds":1338,"processing_state":"not_requested","actions":[{"name":"request_transcript","method":"POST","url":"https://stenobird.com/v1/public/podcasts/best-ai-papers-explained-7258006/episodes/what-does-thompson-sampling-optimize/transcription-requests","description":"Idempotently request low-priority transcript generation for this episode."},{"name":"read_markdown","method":"GET","url":"https://stenobird.com/podcast/best-ai-papers-explained-7258006/what-does-thompson-sampling-optimize.md","description":"Read the agent-friendly Markdown representation of this episode resource."}]}}