5 ms·

Thanks, I was surprised when the article just ended without going into further detail how the dynamic programming recursion looks like or how you define a good

by Asdfbla 10y ago

Thanks, I was surprised when the article just ended without going into further detail how the dynamic programming recursion looks like or how you define a good fit for a bin. Is there a downside to using adaptive bin-sizes (other than complexity or making them possibly harder to interpret)?

contravariant 10y ago
If I understand the theory correctly the adaptive bin-sizes give a better fit than a fixed step-size (since you're choosing the optimal partition, and the adaptive partitions include all possible fixed step partitions). You can of course use the same criterion to choose an optimal step-size, this is fairly easy to do with just brute force.