The linear optimizer cannot do standardized mean difference, but there is a good approximation it can use, namely:
SMD = (mean(pool) - mean(target))/ (sqrt(var(pool) + var(target))
\approx (mean(pool) - mean(target))/ (sqrt(2 var(target))= (absolute mean difference) / (sqrt(2 var(target))
When distance(pool, target) >> 1, this is a poor approximation, but the approximation becomes increasingly good as pool --> target, which is anyway what the optimizer is doing.
Implement this as an option to ConstraintSatisfactionMatcher
The linear optimizer cannot do standardized mean difference, but there is a good approximation it can use, namely:
SMD = (mean(pool) - mean(target))/ (sqrt(var(pool) + var(target))
\approx (mean(pool) - mean(target))/ (sqrt(2 var(target))= (absolute mean difference) / (sqrt(2 var(target))
When distance(pool, target) >> 1, this is a poor approximation, but the approximation becomes increasingly good as pool --> target, which is anyway what the optimizer is doing.
Implement this as an option to ConstraintSatisfactionMatcher