{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/e45c4312-4984-48ab-9fca-932d430c0ae2\" width=\"1280\" height=\"720\" title=\"Fast and Efficient Asynchronous Gossip Algorithm for Robust and Non-Smooth Convex Decentralized Learning — 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://m.montaan.com/","thumbnail_url":"https://m.montaan.com/media/episodes/e45c4312-4984-48ab-9fca-932d430c0ae2/episode.poster.webp","title":"Fast and Efficient Asynchronous Gossip Algorithm for Robust and Non-Smooth Convex Decentralized Learning","type":"video","version":"1.0","width":1280}