When did MCMC become commonplace?Normalizing constant irrelevant in Bayes theorem?Bayesian model averaging for variable selection in RHow do ABC and MCMC differ in their applications?Should MCMC posterior be used as my new prior?MCMC convergenceVariational inference versus MCMC: when to choose one over the other?
What does the British parliament hope to achieve by requesting a third Brexit extension?
I am often given, occasionally stolen, rarely sold, and never borrowed
Why is technology bad for children?
Why exactly is the answer 50 ohms?
Is it possible to unmount a partition table?
What is "demographic engineering" and how does it differ from ethnic cleansing?
3-prong to 4-prong conversion - EXTRA MISLABELLED WIRES - Dryer cable upgrade and installation
Front hydraulic disk brake is too powerful on MTB — solutions?
Advisor asked for my entire slide presentation so she could give the presentation at an international conference
What could possibly power an Alcubierre drive?
Neither Raman nor IR Active vibrational modes
Slaad Chaos Phage: Weak Combat Ability?
How to create a vimrc macro using :sort?
Can you upgrade armour from breastplate to halfplate?
Is there a historical explanation as to why the USA people are so litigious compared to France?
How do I reset the TSA-unlocked indicator on my lock?
Should I avoid "big words" when writing to a younger audience?
XDSL Internet Connection Over Optical Fibre Telephone Line?
What power does the UK parliament hold over a Prime Minister whom they refuse to remove from power?
What does this text mean with capitalized letters?
Does an excessive table violate normalization rules?
How to prove that invoices are really UNPAID?
Do you say "good game" after a game in which your opponent played poorly?
Are there 99 percentiles, or 100 percentiles? And are they groups of numbers, or dividers or pointers to individual numbers?
When did MCMC become commonplace?
Normalizing constant irrelevant in Bayes theorem?Bayesian model averaging for variable selection in RHow do ABC and MCMC differ in their applications?Should MCMC posterior be used as my new prior?MCMC convergenceVariational inference versus MCMC: when to choose one over the other?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty
margin-bottom:0;
$begingroup$
Does anyone know around what year MCMC became commonplace (i.e., a popular method for Bayesian inference)? A link to the number of published MCMC (journal) articles over time would be especially helpful.
bayesian mcmc history
$endgroup$
add a comment
|
$begingroup$
Does anyone know around what year MCMC became commonplace (i.e., a popular method for Bayesian inference)? A link to the number of published MCMC (journal) articles over time would be especially helpful.
bayesian mcmc history
$endgroup$
2
$begingroup$
I doubt that anyone could provide a single year. It's more reasonable to consider the diffusion of MCMC over time. It originated in the 50s with the Metropolis-Hastings algorithm but did not see wide adoption and use until the advent of relatively inexpensive computational power beginning in the 80s. To the best of my knowledge the first uses were in Bayesian facial recognition technologies of that time. Secondarily, beginning in the 90s, MCMC use spread to other fields such as economics & marketing with the Chicago school. Check out Gilks & Spiegelhalter's 1996 Practical MCMC.
$endgroup$
– user332577
8 hours ago
$begingroup$
This question is vague and calls for opinion (there's no accepted definition of commonplace or popular). It admits any number of arguably correct answers.
$endgroup$
– Glen_b♦
3 hours ago
add a comment
|
$begingroup$
Does anyone know around what year MCMC became commonplace (i.e., a popular method for Bayesian inference)? A link to the number of published MCMC (journal) articles over time would be especially helpful.
bayesian mcmc history
$endgroup$
Does anyone know around what year MCMC became commonplace (i.e., a popular method for Bayesian inference)? A link to the number of published MCMC (journal) articles over time would be especially helpful.
bayesian mcmc history
bayesian mcmc history
asked 8 hours ago
Ethan ArensonEthan Arenson
464 bronze badges
464 bronze badges
2
$begingroup$
I doubt that anyone could provide a single year. It's more reasonable to consider the diffusion of MCMC over time. It originated in the 50s with the Metropolis-Hastings algorithm but did not see wide adoption and use until the advent of relatively inexpensive computational power beginning in the 80s. To the best of my knowledge the first uses were in Bayesian facial recognition technologies of that time. Secondarily, beginning in the 90s, MCMC use spread to other fields such as economics & marketing with the Chicago school. Check out Gilks & Spiegelhalter's 1996 Practical MCMC.
$endgroup$
– user332577
8 hours ago
$begingroup$
This question is vague and calls for opinion (there's no accepted definition of commonplace or popular). It admits any number of arguably correct answers.
$endgroup$
– Glen_b♦
3 hours ago
add a comment
|
2
$begingroup$
I doubt that anyone could provide a single year. It's more reasonable to consider the diffusion of MCMC over time. It originated in the 50s with the Metropolis-Hastings algorithm but did not see wide adoption and use until the advent of relatively inexpensive computational power beginning in the 80s. To the best of my knowledge the first uses were in Bayesian facial recognition technologies of that time. Secondarily, beginning in the 90s, MCMC use spread to other fields such as economics & marketing with the Chicago school. Check out Gilks & Spiegelhalter's 1996 Practical MCMC.
$endgroup$
– user332577
8 hours ago
$begingroup$
This question is vague and calls for opinion (there's no accepted definition of commonplace or popular). It admits any number of arguably correct answers.
$endgroup$
– Glen_b♦
3 hours ago
2
2
$begingroup$
I doubt that anyone could provide a single year. It's more reasonable to consider the diffusion of MCMC over time. It originated in the 50s with the Metropolis-Hastings algorithm but did not see wide adoption and use until the advent of relatively inexpensive computational power beginning in the 80s. To the best of my knowledge the first uses were in Bayesian facial recognition technologies of that time. Secondarily, beginning in the 90s, MCMC use spread to other fields such as economics & marketing with the Chicago school. Check out Gilks & Spiegelhalter's 1996 Practical MCMC.
$endgroup$
– user332577
8 hours ago
$begingroup$
I doubt that anyone could provide a single year. It's more reasonable to consider the diffusion of MCMC over time. It originated in the 50s with the Metropolis-Hastings algorithm but did not see wide adoption and use until the advent of relatively inexpensive computational power beginning in the 80s. To the best of my knowledge the first uses were in Bayesian facial recognition technologies of that time. Secondarily, beginning in the 90s, MCMC use spread to other fields such as economics & marketing with the Chicago school. Check out Gilks & Spiegelhalter's 1996 Practical MCMC.
$endgroup$
– user332577
8 hours ago
$begingroup$
This question is vague and calls for opinion (there's no accepted definition of commonplace or popular). It admits any number of arguably correct answers.
$endgroup$
– Glen_b♦
3 hours ago
$begingroup$
This question is vague and calls for opinion (there's no accepted definition of commonplace or popular). It admits any number of arguably correct answers.
$endgroup$
– Glen_b♦
3 hours ago
add a comment
|
2 Answers
2
active
oldest
votes
$begingroup$
This paper by Christian (Xi'an) Robert and George Casella provides a nice summary of the history of MCMC. From the paper (emphasis is mine).
What can be reasonably seen as the first MCMC algorithm is what we now call the Metropolis algorithm, published by Metropolis et al. (1953). It emanates from the same group of scientists who produced the Monte Carlo method, namely, the research scientists of Los Alamos, mostly physicists working on mathematical physics and the atomic bomb.
The Metropolis algorithm was later generalized by Hastings (1970) and his student Peskun (1973,1981)
Although somewhat removed from statistical inference in the classical sense and based on earlier techniques used in Statistical Physics, the landmark paper by Geman and Geman (1984) brought Gibbs sampling into the arena of statistical application. This paper is also responsible for the name Gibbs sampling
In particular, Geman and Geman (1984) influenced Gelfand and Smith (1990) to write a paper that is the genuine starting point for an intensive use of MCMC methods by the main-stream statistical community. It sparked new inter-est in Bayesian methods, statistical computing, algorithms and stochastic processes through the use of computing algorithms such as the Gibbs sampler and the Metropolis–Hastings algorithm.
Interestingly, the earlier paper by Tanner and Wong (1987) had essentially the same ingredients as Gelfand and Smith (1990), namely, the fact that simulating from the conditional distributions is sufficient to asymptotically simulate from the joint.This paper was considered important enough to be a discussion paper in the Journal of the American Statistical Association, but its impact was somehow limited, compared with Gelfand and Smith (1990).
I couldn't find the number of journal articles published over time, but here is a Google Ngram plot for the number of mentions over time. It more or less agrees with the notion that MCMC became commonplace after the 1990 paper of Gelfand and Smith.
$endgroup$
add a comment
|
$begingroup$
The excellent answer by knrumsey gives some history on the progression of important academic work in MCMC. One other aspect worth examining is the development of software to facilitate MCMC by the ordinary user. Statistical methods are often used mostly by specialists until they are implemented in software that allows the ordinary user to implement them without programming. For example, the software BUGS had its first release in 1997. That does not appear to have changed the growth trajectory in the N-Grams plot, but it may have been an influence in bringing the method into common usage among those users who found it intimidating to program their own routines.
$endgroup$
add a comment
|
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "65"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/4.0/"u003ecc by-sa 4.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f430382%2fwhen-did-mcmc-become-commonplace%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This paper by Christian (Xi'an) Robert and George Casella provides a nice summary of the history of MCMC. From the paper (emphasis is mine).
What can be reasonably seen as the first MCMC algorithm is what we now call the Metropolis algorithm, published by Metropolis et al. (1953). It emanates from the same group of scientists who produced the Monte Carlo method, namely, the research scientists of Los Alamos, mostly physicists working on mathematical physics and the atomic bomb.
The Metropolis algorithm was later generalized by Hastings (1970) and his student Peskun (1973,1981)
Although somewhat removed from statistical inference in the classical sense and based on earlier techniques used in Statistical Physics, the landmark paper by Geman and Geman (1984) brought Gibbs sampling into the arena of statistical application. This paper is also responsible for the name Gibbs sampling
In particular, Geman and Geman (1984) influenced Gelfand and Smith (1990) to write a paper that is the genuine starting point for an intensive use of MCMC methods by the main-stream statistical community. It sparked new inter-est in Bayesian methods, statistical computing, algorithms and stochastic processes through the use of computing algorithms such as the Gibbs sampler and the Metropolis–Hastings algorithm.
Interestingly, the earlier paper by Tanner and Wong (1987) had essentially the same ingredients as Gelfand and Smith (1990), namely, the fact that simulating from the conditional distributions is sufficient to asymptotically simulate from the joint.This paper was considered important enough to be a discussion paper in the Journal of the American Statistical Association, but its impact was somehow limited, compared with Gelfand and Smith (1990).
I couldn't find the number of journal articles published over time, but here is a Google Ngram plot for the number of mentions over time. It more or less agrees with the notion that MCMC became commonplace after the 1990 paper of Gelfand and Smith.
$endgroup$
add a comment
|
$begingroup$
This paper by Christian (Xi'an) Robert and George Casella provides a nice summary of the history of MCMC. From the paper (emphasis is mine).
What can be reasonably seen as the first MCMC algorithm is what we now call the Metropolis algorithm, published by Metropolis et al. (1953). It emanates from the same group of scientists who produced the Monte Carlo method, namely, the research scientists of Los Alamos, mostly physicists working on mathematical physics and the atomic bomb.
The Metropolis algorithm was later generalized by Hastings (1970) and his student Peskun (1973,1981)
Although somewhat removed from statistical inference in the classical sense and based on earlier techniques used in Statistical Physics, the landmark paper by Geman and Geman (1984) brought Gibbs sampling into the arena of statistical application. This paper is also responsible for the name Gibbs sampling
In particular, Geman and Geman (1984) influenced Gelfand and Smith (1990) to write a paper that is the genuine starting point for an intensive use of MCMC methods by the main-stream statistical community. It sparked new inter-est in Bayesian methods, statistical computing, algorithms and stochastic processes through the use of computing algorithms such as the Gibbs sampler and the Metropolis–Hastings algorithm.
Interestingly, the earlier paper by Tanner and Wong (1987) had essentially the same ingredients as Gelfand and Smith (1990), namely, the fact that simulating from the conditional distributions is sufficient to asymptotically simulate from the joint.This paper was considered important enough to be a discussion paper in the Journal of the American Statistical Association, but its impact was somehow limited, compared with Gelfand and Smith (1990).
I couldn't find the number of journal articles published over time, but here is a Google Ngram plot for the number of mentions over time. It more or less agrees with the notion that MCMC became commonplace after the 1990 paper of Gelfand and Smith.
$endgroup$
add a comment
|
$begingroup$
This paper by Christian (Xi'an) Robert and George Casella provides a nice summary of the history of MCMC. From the paper (emphasis is mine).
What can be reasonably seen as the first MCMC algorithm is what we now call the Metropolis algorithm, published by Metropolis et al. (1953). It emanates from the same group of scientists who produced the Monte Carlo method, namely, the research scientists of Los Alamos, mostly physicists working on mathematical physics and the atomic bomb.
The Metropolis algorithm was later generalized by Hastings (1970) and his student Peskun (1973,1981)
Although somewhat removed from statistical inference in the classical sense and based on earlier techniques used in Statistical Physics, the landmark paper by Geman and Geman (1984) brought Gibbs sampling into the arena of statistical application. This paper is also responsible for the name Gibbs sampling
In particular, Geman and Geman (1984) influenced Gelfand and Smith (1990) to write a paper that is the genuine starting point for an intensive use of MCMC methods by the main-stream statistical community. It sparked new inter-est in Bayesian methods, statistical computing, algorithms and stochastic processes through the use of computing algorithms such as the Gibbs sampler and the Metropolis–Hastings algorithm.
Interestingly, the earlier paper by Tanner and Wong (1987) had essentially the same ingredients as Gelfand and Smith (1990), namely, the fact that simulating from the conditional distributions is sufficient to asymptotically simulate from the joint.This paper was considered important enough to be a discussion paper in the Journal of the American Statistical Association, but its impact was somehow limited, compared with Gelfand and Smith (1990).
I couldn't find the number of journal articles published over time, but here is a Google Ngram plot for the number of mentions over time. It more or less agrees with the notion that MCMC became commonplace after the 1990 paper of Gelfand and Smith.
$endgroup$
This paper by Christian (Xi'an) Robert and George Casella provides a nice summary of the history of MCMC. From the paper (emphasis is mine).
What can be reasonably seen as the first MCMC algorithm is what we now call the Metropolis algorithm, published by Metropolis et al. (1953). It emanates from the same group of scientists who produced the Monte Carlo method, namely, the research scientists of Los Alamos, mostly physicists working on mathematical physics and the atomic bomb.
The Metropolis algorithm was later generalized by Hastings (1970) and his student Peskun (1973,1981)
Although somewhat removed from statistical inference in the classical sense and based on earlier techniques used in Statistical Physics, the landmark paper by Geman and Geman (1984) brought Gibbs sampling into the arena of statistical application. This paper is also responsible for the name Gibbs sampling
In particular, Geman and Geman (1984) influenced Gelfand and Smith (1990) to write a paper that is the genuine starting point for an intensive use of MCMC methods by the main-stream statistical community. It sparked new inter-est in Bayesian methods, statistical computing, algorithms and stochastic processes through the use of computing algorithms such as the Gibbs sampler and the Metropolis–Hastings algorithm.
Interestingly, the earlier paper by Tanner and Wong (1987) had essentially the same ingredients as Gelfand and Smith (1990), namely, the fact that simulating from the conditional distributions is sufficient to asymptotically simulate from the joint.This paper was considered important enough to be a discussion paper in the Journal of the American Statistical Association, but its impact was somehow limited, compared with Gelfand and Smith (1990).
I couldn't find the number of journal articles published over time, but here is a Google Ngram plot for the number of mentions over time. It more or less agrees with the notion that MCMC became commonplace after the 1990 paper of Gelfand and Smith.
edited 5 hours ago
answered 8 hours ago
knrumseyknrumsey
2,3656 silver badges18 bronze badges
2,3656 silver badges18 bronze badges
add a comment
|
add a comment
|
$begingroup$
The excellent answer by knrumsey gives some history on the progression of important academic work in MCMC. One other aspect worth examining is the development of software to facilitate MCMC by the ordinary user. Statistical methods are often used mostly by specialists until they are implemented in software that allows the ordinary user to implement them without programming. For example, the software BUGS had its first release in 1997. That does not appear to have changed the growth trajectory in the N-Grams plot, but it may have been an influence in bringing the method into common usage among those users who found it intimidating to program their own routines.
$endgroup$
add a comment
|
$begingroup$
The excellent answer by knrumsey gives some history on the progression of important academic work in MCMC. One other aspect worth examining is the development of software to facilitate MCMC by the ordinary user. Statistical methods are often used mostly by specialists until they are implemented in software that allows the ordinary user to implement them without programming. For example, the software BUGS had its first release in 1997. That does not appear to have changed the growth trajectory in the N-Grams plot, but it may have been an influence in bringing the method into common usage among those users who found it intimidating to program their own routines.
$endgroup$
add a comment
|
$begingroup$
The excellent answer by knrumsey gives some history on the progression of important academic work in MCMC. One other aspect worth examining is the development of software to facilitate MCMC by the ordinary user. Statistical methods are often used mostly by specialists until they are implemented in software that allows the ordinary user to implement them without programming. For example, the software BUGS had its first release in 1997. That does not appear to have changed the growth trajectory in the N-Grams plot, but it may have been an influence in bringing the method into common usage among those users who found it intimidating to program their own routines.
$endgroup$
The excellent answer by knrumsey gives some history on the progression of important academic work in MCMC. One other aspect worth examining is the development of software to facilitate MCMC by the ordinary user. Statistical methods are often used mostly by specialists until they are implemented in software that allows the ordinary user to implement them without programming. For example, the software BUGS had its first release in 1997. That does not appear to have changed the growth trajectory in the N-Grams plot, but it may have been an influence in bringing the method into common usage among those users who found it intimidating to program their own routines.
answered 4 hours ago
BenBen
38.6k2 gold badges51 silver badges168 bronze badges
38.6k2 gold badges51 silver badges168 bronze badges
add a comment
|
add a comment
|
Thanks for contributing an answer to Cross Validated!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstats.stackexchange.com%2fquestions%2f430382%2fwhen-did-mcmc-become-commonplace%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
I doubt that anyone could provide a single year. It's more reasonable to consider the diffusion of MCMC over time. It originated in the 50s with the Metropolis-Hastings algorithm but did not see wide adoption and use until the advent of relatively inexpensive computational power beginning in the 80s. To the best of my knowledge the first uses were in Bayesian facial recognition technologies of that time. Secondarily, beginning in the 90s, MCMC use spread to other fields such as economics & marketing with the Chicago school. Check out Gilks & Spiegelhalter's 1996 Practical MCMC.
$endgroup$
– user332577
8 hours ago
$begingroup$
This question is vague and calls for opinion (there's no accepted definition of commonplace or popular). It admits any number of arguably correct answers.
$endgroup$
– Glen_b♦
3 hours ago