Ugly duckling theorem

The ugly duckling theorem is an argument showing that classification is not really possible without some sort of bias. More particularly, it assumes finitely many properties combinable by logical connectives, and finitely many objects; it asserts that any two different objects share the same number of (extensional) properties. The theorem is named after Hans Christian Andersen's 1843 story "The Ugly Duckling", because it shows that a duckling is just as similar to a swan as two swans are to each other. It was derived by Satosi Watanabe in 1969.Template:Rp

Mathematical formula

Watanabe's example, using objects A, B, C, and properties F ("first"), W ("white"). "0", "1", "¬", "∧", "∨", and "⊕" denote "false", "true", "not", "and", "or", and "exclusive or", respectively. Since F happens to imply W, each predicate that can be formed from F and W coincides with another one, hence there are only 8 extensionally distinct possible predicates, each shown on an own line. The white ducklings A and B agree on 4 of them (line 2, 3, 4, 8), but so do A and C, too (line 3, 5, 7, 8), and so do B and C (line 1, 3, 6, 8).Template:Rp

Suppose there are n things in the universe, and one wants to put them into classes or categories. One has no preconceived ideas or biases about what sorts of categories are "natural" or "normal" and what are not. So one has to consider all the possible classes that could be, all the possible ways of making a set out of the n objects. There are $2^n$ such ways, the size of the power set of n objects. One can use that to measure the similarity between two objects, and one would see how many sets they have in common. However, one cannot. Any two objects have exactly the same number of classes in common if we can form any possible class, namely $2^{n-1}$ (half the total number of classes there are). To see this is so, one may imagine each class is represented by an n-bit string (or binary encoded integer), with a zero for each element not in the class and a one for each element in the class. As one finds, there are $2^n$ such strings.

As all possible choices of zeros and ones are there, any two bit-positions will agree exactly half the time. One may pick two elements and reorder the bits so they are the first two, and imagine the numbers sorted lexicographically. The first $2^n/2$ numbers will have bit #1 set to zero, and the second $2^n/2$ will have it set to one. Within each of those blocks, the top $2^n/4$ will have bit #2 set to zero and the other $2^n/4$ will have it as one, so they agree on two blocks of $2^n/4$ or on half of all the cases, no matter which two elements one picks. So if we have no preconceived bias about which categories are better, everything is then equally similar (or equally dissimilar). The number of predicates simultaneously satisfied by two non-identical elements is constant over all such pairs. Thus, some kind of inductiveTemplate:Citation needed bias is needed to make judgements to prefer certain categories over others.

Boolean functions

Let $x_1,x_2,\dots ,x_n$ be a set of vectors of $k$ booleans each. The ugly duckling is the vector which is least like the others. Given the booleans, this can be computed using Hamming distance.

However, the choice of boolean features to consider could have been somewhat arbitrary. Perhaps there were features derivable from the original features that were important for identifying the ugly duckling. The set of booleans in the vector can be extended with new features computed as boolean functions of the $k$ original features. The only canonical way to do this is to extend it with all possible Boolean functions. The resulting completed vectors have $2^k$ features. The ugly duckling theorem states that there is no ugly duckling because any two completed vectors will either be equal or differ in exactly half of the features.

Proof. Let x and y be two vectors. If they are the same, then their completed vectors must also be the same because any Boolean function of x will agree with the same Boolean function of y. If x and y are different, then there exists a coordinate $i$ where the $i$-th coordinate of $x$ differs from the $i$-th coordinate of $y$. Now the completed features contain every Boolean function on $k$ Boolean variables, with each one exactly once. Viewing these Boolean functions as polynomials in $k$ variables over GF(2), segregate the functions into pairs $(f,g)$ where $f$ contains the $i$-th coordinate as a linear term and $g$ is $f$ without that linear term. Now, for every such pair $(f,g)$, $x$ and $y$ will agree on exactly one of the two functions. If they agree on one, they must disagree on the other and vice versa. (This proof is believed to be due to Watanabe.)

Discussion

A possible way around the ugly duckling theorem would be to introduce a constraint on how similarity is measured by limiting the properties involved in classification, for instance, between A and B. However Medin et al. (1993) point out that this does not actually resolve the arbitrariness or bias problem since in what respects A is similar to B: "varies with the stimulus context and task, so that there is no unique answer, to the question of how similar is one object to another". For example, "a barberpole and a zebra would be more similar than a horse and a zebra if the feature striped had sufficient weight. Of course, if these feature weights were fixed, then these similarity relations would be constrained". Yet the property "striped" as a weight 'fix' or constraint is arbitrary itself, meaning: "unless one can specify such criteria, then the claim that categorization is based on attribute matching is almost entirely vacuous".

Stamos (2003) remarked that some judgments of overall similarity are non-arbitrary in the sense they are useful:

Unless some properties are considered more salient, or 'weighted' more important than others, everything will appear equally similar, hence Watanabe (1986) wrote: "any objects, in so far as they are distinguishable, are equally similar".

In a weaker setting that assumes infinitely many properties, Murphy and Medin (1985) give an example of two putative classified things, plums and lawnmowers:

According to Woodward, the ugly duckling theorem is related to Schaffer's Conservation Law for Generalization Performance, which states that all algorithms for learning of boolean functions from input/output examples have the same overall generalization performance as random guessing. The latter result is generalized by Woodward to functions on countably infinite domains.

See also

• No free lunch in search and optimization
• No free lunch theorem
• Identity of indiscernibles – Classification (discernibility) is possible (with or without a bias), but there cannot be separate objects or entities that have all their properties in common.
• New riddle of induction