{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/55d47cb2-e4f1-456c-a1c1-7a688009e1f1\" width=\"1280\" height=\"480\" title=\"The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization — 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/55d47cb2-e4f1-456c-a1c1-7a688009e1f1/episode.poster.webp","title":"The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization","type":"rich","version":"1.0","width":1280}