![]() |
#1
|
|||
|
|||
![]()
Considering the bin case as described in the book and the lectures, we could write the probability of
![]() ![]() ![]() can be written excatly since ![]() ![]() ![]() ![]() ![]() ![]() ![]() Now if we plug that in the expression we get the bound with same properties as Hoeffding's (valid for all ![]() ![]() ![]() Now, my view is that that bound is the tightest possible, tighter than the Hoeffding's. Am I correct? It could be (perhaps?) used in futher analysis, but the major donwside is that is is not so nice nor elegant to work with. Other opinions? Thanks! |
#2
|
||||
|
||||
![]() Quote:
__________________
Where everyone thinks alike, no one thinks very much |
![]() |
Thread Tools | |
Display Modes | |
|
|