李彥寰教授(國立臺灣大學 資訊工程學系)

演講時間：112年5月12日上午11點
演講地點：A813

講題：From data compression to learning quantum states

摘要：Consider three problems: universal data compression, online
portfolio selection, and learning quantum states. Despite their very
different application scenarios, the three problems share similar
mathematical structures. Among them, online portfolio selection has been
a famous open problem in online learning for more than 30 years;
learning quantum states is a generalization of it and hence even more
challenging. Recently, there have been interesting breakthroughs. In
this talk, I will give an overview of the problems and recent
breakthroughs.