活動新聞

【演講公告】歡迎參加107.12.17(一) 「An Online Learning Approach to Network Application Optimization with Guarantee」講座

最後更新時間: 2018-12-03 15:39:13

| |

您好:

很榮幸邀請到Prof. John C.S. Lui 前來交通大學資工系演講,演講題目與摘要如下所示,歡迎教授報名前往聆聽與交流,感謝大家的參與!

此次活動特別邀請到Choh-Ming Li Chair Professor in the CSE Department at The Chinese University of Hong Kong的John C.S. Lui前來為我們演說「An Online Learning Approach to Network Application Optimization with Guarantee」議題,歡迎有興趣的老師與同學免費報名參加! 

An Online Learning Approach to Network Application Optimization with Guarantee 

一、報到時間:2018/12/17 (一) 16:20 - 16:40

        演講時間:2018/12/17 (一) 16:40 - 18:00

二、演講地點:工程三館122教室 

三、講    者:John C.S. Lui, Choh-Ming Li Chair Professor in the CSE Department at The Chinese University of Hong Kong

四、報名方式:免費報名(本次演講為英文演講)

        限額100名,16:20開放預約報名者入場,未預約報名者採現場候位

五、報名網址:https://goo.gl/forms/PyJeiRd6wi8s3AKo2

       報名截止:2018/12/14 (五)12:00 (若報名額滿將提早結束,恕不另行通知)

六、演講摘要:

Network application optimization is essential for improving the performance of the application as well as its user experience. The network application parameters are crucial in making proper decisions for network application optimizations. However, many existing works are impractical by assuming a priori knowledge of the parameters which are usually unknown and need to be estimated. There have been studies that consider optimizing network application in an online learning context using multi-armed bandit models. However, existing frameworks are problematic as they only consider to find the optimal decisions to minimize the regret, but neglect the constraints (or guarantee) requirements which may be excessively violated. In this work, we first propose a novel online learning framework for network application optimizations with guarantee. To the best of our knowledge, we are the first to formulate the stochastic constrained multi-armed bandit model with time-varying “multi- level rewards” by taking both “regret” and “violation” into consideration. We are also the first to design a constrained bandit policy, Learning with Minimum Guarantee (LMG), with provable sub-linear regret and violation bounds. We illustrate how our framework can be applied to several emerging network application optimizations, namely, (1) opportunistic multichannel selection, (2) data-guaranteed crowdsensing, and (3) stability-guaranteed crowdsourced transcoding. To show the effectiveness of LMG in optimizing these applications with different minimum requirements, we also conduct extensive simulations by comparing LMG with existing state-of-the-art policies.

七、講者簡歷:

John C.S. Lui is currently the Choh-Ming Li Chair Professor in the CSE Department at The Chinese University of Hong Kong (CUHK) and the Associate Dean of Research at the College of Engineering at CUHK. He received his Ph.D. in Computer Science from UCLA. His current research interests are in network sciences with large data implications, machine learning on large data analytics, network/system/mobile security, network economics, large scale distributed systems and performance evaluation theory. Currently, John is the senior editor in the IEEE/ACM Transactions on Networking, and has been serving in the editorial board of IEEE Transactions on Mobile Computing, ACM Transactions on Modeling and Performance Evaluation of Computing Systems, IEEE Transactions on Computers, IEEE Transactions on Parallel and Distributed Systems, Journal of Performance Evaluation, Journal of Network Science and International Journal of Network Security.  He is a member of the review panel in the IEEE Koji Kobayashi Computers and Communications Award committee, and has served at the IEEE Fellow Review Committee. He received various departmental teaching awards and the CUHK Vice-Chancellor's Exemplary Teaching Award, as well as the CUHK Faculty of Engineering Research Excellence Award. He is an elected member of the IFIP WG 7.3, Fellow of ACM, Fellow of IEEE, Senior Research Fellow of the Croucher Foundation and was the past chair of the ACM SIGMETRICS (2011-2015). His personal interests include films and general reading. 

※聯絡方式:

資工系馮小姐 電話:03-5712121#54832

E-mail:ruby@cs.nctu.edu.tw