演講公告

新聞標題：　( 2019-11-04 )

• 演講主題：Towards efficient and rigorous learning with the logarithmic loss

• 主講人：李彥寰教授 (國立臺灣大學資訊工程學系)

• 演講日期：2019 年11月12日 (星期二) 14:00 –15:00

• 演講地點：(光復校區) 科學一館223室

• 茶會時間：2019 年11月12日 13:30 (科學一館205室)

• 摘要內容：
  

  Abstract
  
  Minimizing the logarithmic loss is an essential task to many applications, such as positron emission tomography, optimal portfolio selection, and quantum state tomography. The optimization problems are indeed convex. However, the logarithmic loss violates standard smoothness assumptions in optimization literature, so most existing optimization algorithms and/or their convergence guarantees do not directly apply. In this talk, I will introduce some of our recent developments in addressing the logarithmic loss.
  

• 相關檔案：Talk_1081112.pdf

go back