![]() |
Error measure and Hoeffding inequality
In the 1st chapter when Hoeffding is used, the error measure is simple mismatch -- there is no penalty associated with the different flavors of mismatch as in error measures. Is there a version of Hoeffding which we could use with error measure as well? If so how does it look? I imagine the red balls would now have weights of some sort -- two types of red balls for the two kinds of errors in a binary classifier.
|
Re: Error measure and Hoeffding inequality
Yes, putting in the weights is certainly possible. This lecture
https://www.csie.ntu.edu.tw/~htlin/m...08_handout.pdf contains some discussions. It was taught in Mandarin (on Youtube) though. Hope this helps. |
All times are GMT -7. The time now is 04:19 PM. |
Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.