William Rae Thompson was an American mathematician and statistician best known for inventing Thompson sampling, a foundational heuristic in machine learning and
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
William Rae Thompson | |
|---|---|
| Born | July 29, 1896 |
| Died | May 30, 1993 (aged 96) |
Resting place | Cortland Rural Cemetery, Cortland, New York |
| Education | Columbia University Yale University |
| Known for | Thompson sampling |
| Spouse | Mary E. Dalton Thompson (1903–1992) |
| Scientific career | |
| Institutions | Yale Department of Pathology New York State Department of Health |
William Rae Thompson was an American mathematician and statistician best known for inventing Thompson sampling, a foundational heuristic in machine learning and reinforcement learning for the multi-armed bandit problem. First published in 1933, his algorithm saw a significant resurgence in the 21st century and has since become a standard technique in artificial intelligence and online decision-making.[1][2] Beyond his work in pure mathematics, Thompson spent decades applying statistical analysis to the medical sciences, with extensive contributions to pathology and immunology.
Thompson earned his Bachelor of Arts from Columbia University in 1923[3]. He then attended Yale University, where he received his Ph.D. in mathematics in 1930.[4] His doctoral dissertation was titled On The Possible Forms Of Discriminants Of Algebraic Fields.[5]
Thompson was affiliated with Yale University from 1924 to 1936. Following his graduate studies, he applied his mathematical background to the medical sciences. He worked in the Yale Department of Pathology under Dr. Milton Winternitz, serving as a Research Assistant with the rank of Instructor from 1928 to 1934, and subsequently with the rank of Assistant Professor from 1934 to 1936.[6]
During this time, he contributed to multiple scientific articles published by the Department of Pathology.[7] He later moved to the Division of Laboratories and Research at the New York State Department of Health in Albany, where he continued to publish statistical analyses related to medical testing and immunology through the 1940s and 1950s.[8][9]
In 1953, Thompson was elected as a Fellow of the American Statistical Association in recognition of his contributions to the field of biostatistics.[10]
In 1933, while at Yale, Thompson published the scientific paper "On the likelihood that one unknown probability exceeds another in view of the evidence of two samples" in the journal Biometrika.[11]
The paper introduced what is now known as Thompson sampling. The algorithm proposes a Bayesian approach to the exploration-exploitation dilemma: it allocates a proportion of trials to an action matching the posterior probability that the action is optimal. Thompson originally framed this problem in the context of clinical trials, aiming to minimize patient exposure to inferior treatments.[11]
For several decades after its publication, Thompson's 1933 algorithm was largely overlooked by the broader statistical and computer science communities. As researchers later noted, the algorithm "was largely ignored in the academic literature until recently, although it was independently rediscovered several times in the interim as an effective heuristic."[2] However, in the early 2010s, empirical studies demonstrated its state-of-the-art performance in complex, multi-armed bandit scenarios. As researchers at the time observed, the "Thompson Sampling algorithm has experimentally been shown to be close to optimal,"[12] sparking rapid adoption in online advertising and reinforcement learning.[13]
Today, his 1933 paper has garnered over 5,000 academic citations. The algorithm he invented is recognized as a foundational concept in the field of artificial intelligence, with modern scholars noting that it "addresses a broad range of problems in a computationally efficient manner and is therefore enjoying wide use."[2] It has also been the subject of dedicated modern textbooks and extensive theoretical analysis proving its optimal regret bounds.[1][12]
Because of their similar names and overlapping active periods, the algorithm has frequently been misattributed to the Canadian entomologist William Robin Thompson. Archival records from Yale University definitively separate the mathematician from his contemporary, confirming William Rae Thompson as the true inventor.[14]
Historical records for the Department of Pathology, compiled beginning in 1933, listing multiple articles authored and co-authored by Thompson.
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.