{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":720,"html":"<iframe src=\"https://montaan.com/embed/video/3fc85920-22c0-404c-a004-c5c614e17e57\" width=\"1280\" height=\"720\" title=\"Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://montaan.com/","thumbnail_url":"https://montaan.com/media/episodes/3fc85920-22c0-404c-a004-c5c614e17e57/episode.poster.webp","title":"Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity","type":"video","version":"1.0","width":1280}