I am trying to delve a little bit deeper into the implications of the No Free Lunch (NFL) theorem for supervised learning. The basic form of NFL is that averaged all data generating distributions all ML algorithms perform equally well.
The title basically summarizes my question:
If we fix the data generating distribution and the number of training samples to $N_\text{train}$, do all ML algorithms have the same performance if we average over all possible data sets of size $N_\text{train}$?
I find this resource that discusses the implications of the no free lunch theorem but I can't understand what is conditioned on during averaging:
All algorithms are equivalent, on average, by any of the following measures of risk:
E(C|d), E(C|m), E(C|f,d), or E(C|f,m).
where:
- d = training set
- m = number of elements in training set
- f = target input-output relationships
- h = hypothesis (the algorithm's guess for f made in response to d)
- C = off-training-set loss associated with f and h (generalization error)