By default, random subspaces were considered each batch. A more optimal algorithm considers the least sampled combinations each bach, overall increasing the efficiency of sampling (|F| / k (|F|=num features, k = num batches) samples are required to cover all features. The guarantee for uniform sampling is much worse, can be derived from harmonic series actually ->
By default, random subspaces were considered each batch. A more optimal algorithm considers the least sampled combinations each bach, overall increasing the efficiency of sampling (|F| / k (|F|=num features, k = num batches) samples are required to cover all features. The guarantee for uniform sampling is much worse, can be derived from harmonic series actually ->
with