If n is the number of feature we’re trying to discover and m is the number of features in each batch, then I’m thinking the naive approach is O(n^2) while the batch approach would be O(m^2 + mn). Still quadratic in m, but we would have m<<n
Isn’t that just one batch?
My bad! Yes since that’s just one batch it does indeed come out as quadratic overall. I’ll have a think about more efficient methods
If n is the number of feature we’re trying to discover and m is the number of features in each batch, then I’m thinking the naive approach is O(n^2) while the batch approach would be O(m^2 + mn). Still quadratic in m, but we would have m<<n
Isn’t that just one batch?
My bad! Yes since that’s just one batch it does indeed come out as quadratic overall. I’ll have a think about more efficient methods