Misplaced Pages

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Set balancing" – news · newspapers · books · scholar · JSTOR (December 2015) (Learn how and when to remove this message)

The set balancing problem in mathematics is the problem of dividing a set to two subsets that have roughly the same characteristics. It arises naturally in design of experiments.

There is a group of subjects. Each subject has several features, which are considered binary. For example: each subject can be either young or old; either black or white; either tall or short; etc. The goal is to divide the subjects to two sub-groups: treatment group (T) and control group (C), such that for each feature, the number of subjects that have this feature in T is roughly equal to the number of subjects that have this feature in C. E.g., both groups should have roughly the same number of young people, the same number of black people, the same number of tall people, etc.

Matrix representation

Formally, the set balancing problem can be described as follows.

${\displaystyle m}$ is the number of subjects in the general population.

${\displaystyle n}$ is the number of potential features.

The subjects are described by ${\displaystyle A}$, an ${\displaystyle n\times m}$ matrix with entries in ${\displaystyle {0,1}}$. Each column represents a subject and each row represents a feature. ${\displaystyle a_{i,j}=1}$ if subject ${\displaystyle j}$ has feature ${\displaystyle i}$, and ${\displaystyle a_{i,j}=0}$ if subject ${\displaystyle j}$ does not have feature ${\displaystyle i}$.

The partition to groups is described by ${\displaystyle b}$, an ${\displaystyle m\times 1}$ vector with entries in ${\displaystyle {-1,1}}$. ${\displaystyle b_{j}=1}$ if subject ${\displaystyle j}$ is in the treatment group T and ${\displaystyle b_{j}=-1}$ is subject ${\displaystyle j}$ is in the control group C.

The balance of features is described by ${\displaystyle c=A\cdot b}$. This is an ${\displaystyle n\times 1}$ vector. The numeric value of ${\displaystyle c_{i}}$ is the imbalance in feature ${\displaystyle i}$: if ${\displaystyle c_{i}>0}$ then there are more subjects with ${\displaystyle i}$ in T and if ${\displaystyle c_{i}<0}$ then there are more subjects with ${\displaystyle i}$ in C.

The imbalance of a given partition is defined as:

${\displaystyle I(b)=||A\cdot b||_{\infty }=\max _{i\in 1\dots ,n}|c_{i}|}$

The set balancing problem is to find a vector ${\displaystyle b}$ which minimizes the imbalance ${\displaystyle I(b)}$.

Randomized algorithm

An approximate solution can be found with the following very simple randomized algorithm:

Send each subject to the treatment group with probability 1/2.

In matrix formulation:

Choose the elements of ${\displaystyle b}$ randomly with probability 1/2 to each value in {1,-1}.

Surprisingly, although this algorithm completely ignores the matrix ${\displaystyle A}$, it achieves a small imbalance with high probability when there are many features. Formally, for a random vector ${\displaystyle b}$:

${\displaystyle Prob\left\leq {\frac {2}{n}}}$

PROOF:

Let ${\displaystyle k_{i}}$ be the total number of subjects that have feature ${\displaystyle i}$ (equivalently, the number of ones in the ${\displaystyle i}$-th of the matrix ${\displaystyle A}$). Consider the following two cases:

Easy case: ${\displaystyle k_{i}\leq {\sqrt {4m\ln n}}}$. Then, with probability 1, the imbalance in feature ${\displaystyle i}$ (that we marked by ${\displaystyle c_{i}}$) is at most ${\displaystyle {\sqrt {4m\ln n}}}$.

Hard case: ${\displaystyle k_{i}>{\sqrt {4m\ln n}}}$. For every ${\displaystyle j}$, let ${\displaystyle X_{j}=a_{i,j}b_{j}}$. Each such ${\displaystyle X_{j}}$ is a random variable that can be either 1 or -1 with probability 1/2. The imbalance in feature ${\displaystyle i}$ is: ${\displaystyle c_{i}=\sum _{j=1}^{m}{X_{j}}}$. Since the ${\displaystyle X_{j}}$ are independent random variables, by the Chernoff bound, for every ${\displaystyle a>0}$:

${\displaystyle Prob\left\leq 2\exp(-a^{2}/2m)}$

Select: ${\displaystyle a={\sqrt {4m\ln n}}}$ and get:

${\displaystyle Prob\left\leq {\frac {2}{n^{2}}}}$

By the union bound,

${\displaystyle Prob\left\leq {\frac {2}{n}}}$.

References

1. Mitzenmacher, Michael & Upfal, Eli (2005). Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press. ISBN 0-521-83540-2.

• Design of experiments
• Randomized algorithms