Fast algorithms for solving Stackelberg prediction game with least squares loss(12月7日)
报告人:郦旭东   日期:2022年12月05日 20:21  

题   目:Fast algorithms for solving Stackelberg prediction game with least squares loss

报告人:郦旭东 研究员

单   位:复旦大学

时   间:2022年12月7日 10:00

地   点:腾讯会议150-190-907


 要: The Stackelberg prediction game (SPG) is popular in characterizing strategic interactions between a learner and an attacker. As an important special case, the SPG with least squares loss (SPG-LS) has recently received much research attention. In this talk, we will discuss several efficient algorithms for solving SPG-LS.


报告人简介:郦旭东,复旦大学大数据学院青年研究员。他关注数据驱动大规模优化问题理论、算法及应用。他于2019年获得Mathematical Optimization Society 青年学者奖,于2022年获得ICML 杰出论文奖,现为Mathematical Programming Computation副主编