Contributing Editor Anirban DasGupta writes:
It might well be an exercise in frivolity, but I see a common thread between Sherlock Holmes and the bootstrap. It’s randomized inference. A standard example in a statistics class is that if a coin is tossed 20 times, the 5% UMP unbiased test concludes that the coin is fair if
Notwithstanding the prestige of the dainty and enduring Neyman–Pearson theory, and that Wald himself considered using post-data randomization in his 1950 book, randomized tests and confidence intervals have been met with polite scorn and a cold shrug. Even the staunchest believer in optimal decisions runs away from post-data randomization (discussions of Basu, 1980, JASA).
There is one celebrated exception, the bootstrap, and to a lesser extent Pitman’s permutation tests. It is not my intention to knock or malign a wildly popular method. But, because bootstrap Monte Carlo is all but essential in estimating a bootstrap distribution, or its functionals, the final bootstrap inference is machine randomized. In different sittings, the machine would produce different answers for the same question and the same data. Sometimes visibly different. But it hasn’t caused the bootstrap a smidgen of a dent in its popularity (Efron and Tibshirani, 1993, CRC Press; Edgington, 1995, CRC Press).
I quote a small part of an example. Take the usual one dimensional iid
is asymptotically
Let me proceed to the Sherlock Holmes example, one of wide notoriety. This is the story of The Final Problem. Holmes is fleeing London to escape the ruthless revenge of his mortal enemy, the certified evil genius and “Napoleon of crime,” Professor Moriarty. I apologize to the world that the Professor was a mathematician, and one of “phenomenal faculty”; Euler must be bowing his head in shame. Holmes boards the train at London, intending to get off at the terminal station Dover, and then to take a ship to the continent. The train has one intermediate stop at Canterbury. As the train leaves Victoria station, Holmes sees Moriarty on the platform, and must assume that Moriarty knows he is on this train. Moriarty can surely arrange express transportation to beat him to Dover. Anticipating this, Holmes may instead get off at Canterbury. But being the wily master mathematician that he is, Moriarty will anticipate what Holmes anticipated, and may himself proceed instead to Canterbury. Now, Holmes of course is mighty astute, and so surely he anticipates that Moriarty anticipates what Holmes first anticipated, and so on, yes, we have two great stalwarts, adversaries in a decision problem: where to alight? Philip Stark kindly pointed out that the Sicilian scene in The Princess Bride is formally equivalent to the Holmes-Moriarty game.
There is excellent literature on this fascinating example. Let me cite only Morgenstern (1935, NYU Press), Clayton (1986, discussion of Diaconis and Freedman, 1986, AoS), Eichberger (1995, GEB), Case (2000, AMM), and Koppl and Rosser (2002, SCE). The Holmes–Moriarty problem may be set up as a decision problem with a loss function. Each of Holmes’s non-randomized actions
The Sherlock Holmes stories are such monuments of first-rate literature, unequalled and transcendent, that I know connoisseurs who do not leave home for long without Holmes in their suitcase. As in a laughing baby, a rose, a Mozart symphony, sunset over the ocean, raindrops on the window, or a beautiful theorem, in Holmes a man can find his solace. Sir Conan Doyle chose his favorite 19 Holmes stories: The Final Problem is on that list; The Dancing Men is categorically statistical. The British TV Sherlock Holmes series, while romancing all that is bizarre, is also marvelous entertainment.
1 comment on “Anirban’s Angle: Randomization, Bootstrap and Sherlock Holmes”