{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":720,"html":"<iframe src=\"https://montaan.com/embed/video/f5512987-4fd3-41b1-bc6b-b46ae0f4a355\" width=\"1280\" height=\"720\" title=\"AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints — 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/f5512987-4fd3-41b1-bc6b-b46ae0f4a355/episode.poster.webp","title":"AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints","type":"video","version":"1.0","width":1280}