{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/5f6435be-751e-4bca-8512-8cdbc529a74c\" width=\"1280\" height=\"480\" title=\"Descending Everest, Part I: Oracle Complexity of Convex Optimization under (L 0,L 1) -Smoothness — 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/5f6435be-751e-4bca-8512-8cdbc529a74c/episode.poster.webp","title":"Descending Everest, Part I: Oracle Complexity of Convex Optimization under (L 0,L 1) -Smoothness","type":"rich","version":"1.0","width":1280}