{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/214c81f7-9eb3-4f4f-9033-4450f90fd71d\" width=\"1280\" height=\"720\" title=\"Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks — 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/214c81f7-9eb3-4f4f-9033-4450f90fd71d/episode.poster.webp","title":"Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks","type":"video","version":"1.0","width":1280}