ICML-Sample Complexity of Robust Linear Classification on Separated Data

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Sample Complexity of Robust Linear Classification on Separated Data

                Robi Bhattacharjee 1 Somesh Jha 2 Kamalika Chaudhuri 1

             Abstract                 thus aims to find a classifier that maximizes accuracy on
                                  examples that are distance r or more from the decision
   We consider the sample complexity of learning         boundary, where distances are measured according to the
   with adversarial robustness. Most prior theoretical      m ...

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：Complexity separate Complex Linear cation