Just a small doubt at (at end of factor graph), when Yann mentioned that the algo is dp and it is in linear time.But the way he explained the algo, it was more like Dijkstras greedy search, which is O(V log E). As far as I remember, Dp based shortest path that work on network exhaust ively, have O(VE) time complexity, like bellman-ford. Please do correct me if I am wrong. I know this isn't of much concern here, but it bugged me a bit, thus wanted to clarify. Thank you.(01:11:30 - 01:48:54)
06L – Latent variable EBMs for structured prediction
Alfredo Canziani
※本サイトに掲載されているチャンネル情報や動画情報はYouTube公式のAPIを使って取得・表示しています。
Timetable
動画タイムテーブル