Video: Ozgur Yilmaz, "Near-optimal sample complexity for convex tensor completion"

Video From 18w5162: Intersection of Information Theory and Signal Processing: New Signal Models, their Information Content and Acquisition Complexity

Ozgur Yilmaz, University of British Columbia

Tuesday, October 30, 2018 13:32 - 14:31

Near-optimal sample complexity for convex tensor completion

Ozgur Yilmaz, Video: Near-optimal sample complexity for convex tensor completion

Ozgur Yilmaz, Near-optimal sample complexity for convex tensor completion, Intersection of Information Theory and Signal Processing: New Signal Models, their Information Content and Acquisition Complexity, BIRS, BIRS talk, 18w5162, math, mathematics, video

Banff International Research Station

presentation

mpeg4

173M

http://www.birs.ca/events/2018/5-day-workshops/18w5162/videos

http://www.birs.ca/events/2018/5-day-workshops/18w5162/videos/watch/201810301332-Yilmaz.html

Download this video (173M)