Academic literature on the topic 'Markov chain Monte Carlo (MCMC)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Markov chain Monte Carlo (MCMC).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Markov chain Monte Carlo (MCMC)"

1

Borkar, Vivek S. "Markov Chain Monte Carlo (MCMC)." Resonance 27, no. 7 (2022): 1107–15. http://dx.doi.org/10.1007/s12045-022-1407-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Roy, Vivekananda. "Convergence Diagnostics for Markov Chain Monte Carlo." Annual Review of Statistics and Its Application 7, no. 1 (2020): 387–412. http://dx.doi.org/10.1146/annurev-statistics-031219-041300.

Full text
Abstract:
Markov chain Monte Carlo (MCMC) is one of the most useful approaches to scientific computing because of its flexible construction, ease of use, and generality. Indeed, MCMC is indispensable for performing Bayesian analysis. Two critical questions that MCMC practitioners need to address are where to start and when to stop the simulation. Although a great amount of research has gone into establishing convergence criteria and stopping rules with sound theoretical foundation, in practice, MCMC users often decide convergence by applying empirical diagnostic tools. This review article discusses the
APA, Harvard, Vancouver, ISO, and other styles
3

Jones, Galin L., and Qian Qin. "Markov Chain Monte Carlo in Practice." Annual Review of Statistics and Its Application 9, no. 1 (2022): 557–78. http://dx.doi.org/10.1146/annurev-statistics-040220-090158.

Full text
Abstract:
Markov chain Monte Carlo (MCMC) is an essential set of tools for estimating features of probability distributions commonly encountered in modern applications. For MCMC simulation to produce reliable outcomes, it needs to generate observations representative of the target distribution, and it must be long enough so that the errors of Monte Carlo estimates are small. We review methods for assessing the reliability of the simulation effort, with an emphasis on those most useful in practically relevant settings. Both strengths and weaknesses of these methods are discussed. The methods are illustra
APA, Harvard, Vancouver, ISO, and other styles
4

Jones, Galin L., and Qian Qin. "Markov Chain Monte Carlo in Practice." Annual Review of Statistics and Its Application 9, no. 1 (2022): 557–78. http://dx.doi.org/10.1146/annurev-statistics-040220-090158.

Full text
Abstract:
Markov chain Monte Carlo (MCMC) is an essential set of tools for estimating features of probability distributions commonly encountered in modern applications. For MCMC simulation to produce reliable outcomes, it needs to generate observations representative of the target distribution, and it must be long enough so that the errors of Monte Carlo estimates are small. We review methods for assessing the reliability of the simulation effort, with an emphasis on those most useful in practically relevant settings. Both strengths and weaknesses of these methods are discussed. The methods are illustra
APA, Harvard, Vancouver, ISO, and other styles
5

Siems, Tobias. "Markov Chain Monte Carlo on finite state spaces." Mathematical Gazette 104, no. 560 (2020): 281–87. http://dx.doi.org/10.1017/mag.2020.51.

Full text
Abstract:
We elaborate the idea behind Markov chain Monte Carlo (MCMC) methods in a mathematically coherent, yet simple and understandable way. To this end, we prove a pivotal convergence theorem for finite Markov chains and a minimal version of the Perron-Frobenius theorem. Subsequently, we briefly discuss two fundamental MCMC methods, the Gibbs and Metropolis-Hastings sampler. Only very basic knowledge about matrices, convergence of real sequences and probability theory is required.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Qiaomu. "Brief Introduction to Markov Chain Monte Carlo and Its Algorithms." Theoretical and Natural Science 92, no. 1 (2025): 108–15. https://doi.org/10.54254/2753-8818/2025.22031.

Full text
Abstract:
The Markov Chain Monte Carlo (MCMC) methods have become indispensable tools in modern statistical computation, enabling researchers to approximate complex probability distributions that are otherwise intractable. This paper focus on MCMC in Statistics and Probability area which is used to draw samples from a probability distribution. In order to introduce this algorithm in a relatively light and straightforward way, this paper breaks the content into two parts: Markov Chain and MCMC, and brings in stochastic process, Markov property, Ordinary Monte Carlo, and Monte Carlo Integration in success
APA, Harvard, Vancouver, ISO, and other styles
7

Chaudhary, A. K. "Bayesian Analysis of Two Parameter Complementary Exponential Power Distribution." NCC Journal 3, no. 1 (2018): 1–23. http://dx.doi.org/10.3126/nccj.v3i1.20244.

Full text
Abstract:
In this paper, the Markov chain Monte Carlo (MCMC) method is used to estimate the parameters of CEP distribution based on a complete sample. A procedure is developed to obtain Bayes estimates of the parameters of the CEP distribution using Markov Chain Monte Carlo (MCMC) simulation method in OpenBUGS, established software for Bayesian analysis using Markov Chain Monte Carlo (MCMC) methods. The MCMC methods have been shown to be easier to implement computationally, the estimates always exist and are statistically consistent, and their probability intervals are convenient to construct. The R fun
APA, Harvard, Vancouver, ISO, and other styles
8

Chaudhary, Arun Kumar, and Vijay Kumar. "A Bayesian Estimation and Predictionof Gompertz Extension Distribution Using the MCMC Method." Nepal Journal of Science and Technology 19, no. 1 (2020): 142–60. http://dx.doi.org/10.3126/njst.v19i1.29795.

Full text
Abstract:
In this paper, the Markov chain Monte Carlo (MCMC) method is used to estimate the parameters of the Gompertz extension distribution based on a complete sample. We have developed a procedure to obtain Bayes estimates of the parameters of the Gompertz extension distribution using Markov Chain Monte Carlo (MCMC) simulation method in OpenBUGS, established software for Bayesian analysis using Markov Chain Monte Carlo (MCMC) methods. We have obtained the Bayes estimates of the parameters, hazard and reliability functions, and their probability intervals are also presented. We have applied the predic
APA, Harvard, Vancouver, ISO, and other styles
9

Chaudhary, A. K. "A Study of Perks-II Distribution via Bayesian Paradigm." Pravaha 24, no. 1 (2018): 1–17. http://dx.doi.org/10.3126/pravaha.v24i1.20221.

Full text
Abstract:
In this paper, the Markov chain Monte Carlo (MCMC) method is used to estimate the parameters of Perks-II distribution based on a complete sample. The procedures are developed to perform full Bayesian analysis of the Perks-II distributions using Markov Chain Monte Carlo (MCMC) simulation method in OpenBUGS, established software for Bayesian analysis using Markov Chain Monte Carlo (MCMC) methods. We have obtained the Bayes estimates of the parameters, hazard and reliability functions, and their probability intervals are also presented. We have also discussed the issue of model compatibility for
APA, Harvard, Vancouver, ISO, and other styles
10

Shadare, A. E., M. N. O. Sadiku, and S. M. Musa. "Markov Chain Monte Carlo Solution of Poisson’s Equation in Axisymmetric Regions." Advanced Electromagnetics 8, no. 5 (2019): 29–36. http://dx.doi.org/10.7716/aem.v8i5.1255.

Full text
Abstract:
The advent of the Monte Carlo methods to the field of EM have seen floating random walk, fixed random walk and Exodus methods deployed to solve Poisson’s equation in rectangular coordinate and axisymmetric solution regions. However, when considering large EM domains, classical Monte Carlo methods could be time-consuming because they calculate potential one point at a time. Thus, Markov Chain Monte Carlo (MCMC) is generally preferred to other Monte Carlo methods when considering whole-field computation. In this paper, MCMC has been applied to solve Poisson’s equation in homogeneous and inhomoge
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Markov chain Monte Carlo (MCMC)"

1

Guha, Subharup. "Benchmark estimation for Markov Chain Monte Carlo samplers." The Ohio State University, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=osu1085594208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Angelino, Elaine Lee. "Accelerating Markov chain Monte Carlo via parallel predictive prefetching." Thesis, Harvard University, 2014. http://nrs.harvard.edu/urn-3:HUL.InstRepos:13070022.

Full text
Abstract:
We present a general framework for accelerating a large class of widely used Markov chain Monte Carlo (MCMC) algorithms. This dissertation demonstrates that MCMC inference can be accelerated in a model of parallel computation that uses speculation to predict and complete computational work ahead of when it is known to be useful. By exploiting fast, iterative approximations to the target density, we can speculatively evaluate many potential future steps of the chain in parallel. In Bayesian inference problems, this approach can accelerate sampling from the target distribution, without compromis
APA, Harvard, Vancouver, ISO, and other styles
3

Browne, William J. "Applying MCMC methods to multi-level models." Thesis, University of Bath, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Durmus, Alain. "High dimensional Markov chain Monte Carlo methods : theory, methods and applications." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLT001/document.

Full text
Abstract:
L'objet de cette thèse est l'analyse fine de méthodes de Monte Carlopar chaînes de Markov (MCMC) et la proposition de méthodologies nouvelles pour échantillonner une mesure de probabilité en grande dimension. Nos travaux s'articulent autour de trois grands sujets.Le premier thème que nous abordons est la convergence de chaînes de Markov en distance de Wasserstein. Nous établissons des bornes explicites de convergence géométrique et sous-géométrique. Nous appliquons ensuite ces résultats à l'étude d'algorithmes MCMC. Nous nous intéressons à une variante de l'algorithme de Metropolis-Langevin aj
APA, Harvard, Vancouver, ISO, and other styles
5

Harkness, Miles Adam. "Parallel simulation, delayed rejection and reversible jump MCMC for object recognition." Thesis, University of Bristol, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324266.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Smith, Corey James. "Exact Markov Chain Monte Carlo with Likelihood Approximations for Functional Linear Models." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531833318013379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Walker, Neil Rawlinson. "A Bayesian approach to the job search model and its application to unemployment durations using MCMC methods." Thesis, University of Newcastle Upon Tyne, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Durmus, Alain. "High dimensional Markov chain Monte Carlo methods : theory, methods and applications." Electronic Thesis or Diss., Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLT001.

Full text
Abstract:
L'objet de cette thèse est l'analyse fine de méthodes de Monte Carlopar chaînes de Markov (MCMC) et la proposition de méthodologies nouvelles pour échantillonner une mesure de probabilité en grande dimension. Nos travaux s'articulent autour de trois grands sujets.Le premier thème que nous abordons est la convergence de chaînes de Markov en distance de Wasserstein. Nous établissons des bornes explicites de convergence géométrique et sous-géométrique. Nous appliquons ensuite ces résultats à l'étude d'algorithmes MCMC. Nous nous intéressons à une variante de l'algorithme de Metropolis-Langevin aj
APA, Harvard, Vancouver, ISO, and other styles
9

Jeon, Juncheol. "Deterioration model for ports in the Republic of Korea using Markov chain Monte Carlo with multiple imputation." Thesis, University of Dundee, 2019. https://discovery.dundee.ac.uk/en/studentTheses/1cc538ea-1468-4d51-bcf8-711f8b9912f9.

Full text
Abstract:
Condition of infrastructure is deteriorated over time as it gets older. It is the deterioration model that predicts how and when facilities will deteriorate over time. In most infrastructure management system, the deterioration model is a crucial element. Using the deterioration model, it is very helpful to estimate when repair will be carried out, how much will be needed for the maintenance of the entire facilities, and what maintenance costs will be required during the life cycle of the facility. However, the study of deterioration model for civil infrastructures of ports is still in its inf
APA, Harvard, Vancouver, ISO, and other styles
10

Fu, Jianlin. "A markov chain monte carlo method for inverse stochastic modeling and uncertainty assessment." Doctoral thesis, Universitat Politècnica de València, 2008. http://hdl.handle.net/10251/1969.

Full text
Abstract:
Unlike the traditional two-stage methods, a conditional and inverse-conditional simulation approach may directly generate independent, identically distributed realizations to honor both static data and state data in one step. The Markov chain Monte Carlo (McMC) method was proved a powerful tool to perform such type of stochastic simulation. One of the main advantages of the McMC over the traditional sensitivity-based optimization methods to inverse problems is its power, flexibility and well-posedness in incorporating observation data from different sources. In this work, an improved version o
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Markov chain Monte Carlo (MCMC)"

1

1947-, Gianola Daniel, ed. Likelihood, Bayesian and MCMC methods in quantitative genetics. Springer-Verlag, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cowles, Mary Kathryn. Possible biases induced by MCMC convergence diagnostics. University of Toronto, Dept. of Statistics, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liang, Faming, Chuanhai Liu, and Raymond J. Carroll. Advanced Markov Chain Monte Carlo Methods. John Wiley & Sons, Ltd, 2010. http://dx.doi.org/10.1002/9780470669723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

R, Gilks W., Richardson S, and Spiegelhalter D. J, eds. Markov chain Monte Carlo in practice. Chapman & Hall, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

R, Gilks W., Richardson S, and Spiegelhalter D. J, eds. Markov chain Monte Carlo in practice. Chapman & Hall, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

S, Kendall W., Liang F. 1970-, and Wang J. S. 1960-, eds. Markov chain Monte Carlo: Innovations and applications. World Scientific, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Joseph, Anosh. Markov Chain Monte Carlo Methods in Quantum Field Theories. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46044-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gamerman, Dani. Markov chain Monte Carlo: Stochastic simulation for Bayesian inference. Chapman & Hall, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Freitas, Lopes Hedibert, ed. Markov chain Monte Carlo: Stochastic simulation for Bayesian inference. 2nd ed. Taylor & Francis, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liang, F. Advanced Markov chain Monte Carlo methods: Learning from past samples. Wiley, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Markov chain Monte Carlo (MCMC)"

1

Robert, Christian P., and Sylvia Richardson. "Markov Chain Monte Carlo Methods." In Discretization and MCMC Convergence Assessment. Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1716-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hanada, Masanori, and So Matsuura. "Applications of Markov Chain Monte Carlo." In MCMC from Scratch. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2715-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hanada, Masanori, and So Matsuura. "General Aspects of Markov Chain Monte Carlo." In MCMC from Scratch. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2715-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Yan. "Markov Chain Monte Carlo (MCMC) Simulations." In Encyclopedia of Systems Biology. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-9863-7_403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

van Oijen, Marcel. "Markov Chain Monte Carlo Sampling (MCMC)." In Bayesian Compendium. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-66085-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bhattacharya, Rabi, Lizhen Lin, and Victor Patrangenaru. "Markov Chain Monte Carlo (MCMC) Simulation and Bayes Theory." In Springer Texts in Statistics. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-4032-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Walgama Wellalage, N. K., Tieling Zhang, Richard Dwight, and Khaled El-Akruti. "Bridge Deterioration Modeling by Markov Chain Monte Carlo (MCMC) Simulation Method." In Lecture Notes in Mechanical Engineering. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09507-3_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lundén, Daniel, Gizem Çaylak, Fredrik Ronquist, and David Broman. "Automatic Alignment in Higher-Order Probabilistic Programming Languages." In Programming Languages and Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_20.

Full text
Abstract:
AbstractProbabilistic Programming Languages (PPLs) allow users to encode statistical inference problems and automatically apply an inference algorithm to solve them. Popular inference algorithms for PPLs, such as sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC), are built around checkpoints—relevant events for the inference algorithm during the execution of a probabilistic program. Deciding the location of checkpoints is, in current PPLs, not done optimally. To solve this problem, we present a static analysis technique that automatically determines checkpoints in programs, reli
APA, Harvard, Vancouver, ISO, and other styles
9

Wüthrich, Mario V., and Michael Merz. "Bayesian Methods, Regularization and Expectation-Maximization." In Springer Actuarial. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12409-9_6.

Full text
Abstract:
AbstractThis chapter summarizes some techniques that use Bayes’ theorem. These are classical Bayesian statistical models using, e.g., the Markov chain Monte Carlo (MCMC) method for model fitting. We discuss regularization of regression models such as ridge and LASSO regularization, which has a Bayesian interpretation, and we consider the Expectation-Maximization (EM) algorithm. The EM algorithm is a general purpose tool that can handle incomplete data settings. We illustrate this for different examples coming from mixture distributions, censored and truncated claims data.
APA, Harvard, Vancouver, ISO, and other styles
10

Lundén, Daniel, Johannes Borgström, and David Broman. "Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_15.

Full text
Abstract:
AbstractProbabilistic programming is an approach to reasoning under uncertainty by encoding inference problems as programs. In order to solve these inference problems, probabilistic programming languages (PPLs) employ different inference algorithms, such as sequential Monte Carlo (SMC), Markov chain Monte Carlo (MCMC), or variational methods. Existing research on such algorithms mainly concerns their implementation and efficiency, rather than the correctness of the algorithms themselves when applied in the context of expressive PPLs. To remedy this, we give a correctness proof for SMC methods
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Markov chain Monte Carlo (MCMC)"

1

Song, Zeyuan, and Zheyu Jiang. "A Physics-based, Data-driven Numerical Framework for Anomalous Diffusion of Water in Soil." In The 35th European Symposium on Computer Aided Process Engineering. PSE Press, 2025. https://doi.org/10.69997/sct.163304.

Full text
Abstract:
Precision modeling and forecasting of soil moisture are essential for implementing smart irrigation systems and mitigating agricultural drought. Most agro-hydrological models are based on the standard Richards equation, a highly nonlinear, degenerate elliptic-parabolic partial differential equation (PDE) with first order time derivative. However, research has shown that standard Richards equation is unable to model preferential flow in soil with fractal structure. In such a scenario, the soil exhibits anomalous non-Boltzmann scaling behavior. Incorporating the anomalous non-Boltzmann scaling b
APA, Harvard, Vancouver, ISO, and other styles
2

Vaiciulyte, Ingrida. "Adaptive Monte-Carlo Markov chain for multivariate statistical estimation." In International Workshop of "Stochastic Programming for Implementation and Advanced Applications". The Association of Lithuanian Serials, 2012. http://dx.doi.org/10.5200/stoprog.2012.21.

Full text
Abstract:
The estimation of the multivariate skew t-distribution by the Monte-Carlo Markov Chain (MCMC) method is considered in the paper. Thus, the MCMC procedure is constructed for recurrent estimation of skew t-distribution, following the maximum likelihood method, where the Monte-Carlo sample size is regulated to ensure the convergence and to decrease the total amount of Monte-Carlo trials, required for estimation. The confidence intervals of Monte-Carlo estimators are introduced because of their asymptotic normality. The termination rule is also implemented by testing statistical hypotheses on an i
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Zhen, Xupeng He, Yiteng Li, Marwa AlSinan, Hyung Kwak, and Hussein Hoteit. "Parameter Inversion in Geothermal Reservoir Using Markov Chain Monte Carlo and Deep Learning." In SPE Reservoir Simulation Conference. SPE, 2023. http://dx.doi.org/10.2118/212185-ms.

Full text
Abstract:
Abstract Traditional history-matching process suffers from non-uniqueness solutions, subsurface uncertainties, and high computational cost. This work proposes a robust history-matching workflow utilizing the Bayesian Markov Chain Monte Carlo (MCMC) and Bidirectional Long-Short Term Memory (BiLSTM) network to perform history matching under uncertainties for geothermal resource development efficiently. There are mainly four steps. Step 1: Identifying uncertainty parameters. Step 2: The BiLSTM is built to map the nonlinear relationship between the key uncertainty parameters (e.g., injection rates
APA, Harvard, Vancouver, ISO, and other styles
4

Auvinen, Harri, Tuomo Raitio, Samuli Siltanen, and Paavo Alku. "Utilizing Markov chain Monte Carlo (MCMC) method for improved glottal inverse filtering." In Interspeech 2012. ISCA, 2012. http://dx.doi.org/10.21437/interspeech.2012-450.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guzman, Rel. "Monte Carlo Methods on High Dimensional Data." In LatinX in AI at Neural Information Processing Systems Conference 2018. Journal of LatinX in AI Research, 2018. http://dx.doi.org/10.52591/lxai2018120314.

Full text
Abstract:
Markov Chain Monte Carlo (MCMC) simulation is a family of stochastic algorithms that are commonly used to approximate probability distributions by generating samples. The aim of this proposal is to deal with the problem of doing that job on a large scale because due to the increasing power computational demands of data being tall or wide, a study that combines statistical and engineering expertise can be made in order to achieve hardware-accelerated MCMC inference. In this work, I attempt to advance the theory and practice of approximate MCMC methods by developing a toolbox of distributed MCMC
APA, Harvard, Vancouver, ISO, and other styles
6

Emery, A. F., and E. Valenti. "Estimating Parameters of a Packed Bed by Least Squares and Markov Chain Monte Carlo." In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-82086.

Full text
Abstract:
Most parameter estimation is based upon the assumption of normally distributed errors using least squares and the confidence intervals are computed from the sensitivities and the statistics of the residuals. For nonlinear problems, the assumption of a normal distribution of the parameters may not be valid. Determining the probability density distribution can be difficult, particularly when there is more than one parameter to be estimated or there is uncertainty about other parameters. An alternative approach is Bayesian inference, but the numerical computations can be expensive. Markov Chain M
APA, Harvard, Vancouver, ISO, and other styles
7

ur Rehman, M. Javvad, Sarat Chandra Dass, and Vijanth Sagayan Asirvadam. "Markov chain Monte Carlo (MCMC) method for parameter estimation of nonlinear dynamical systems." In 2015 IEEE International Conference on Signal and Image Processing Applications (ICSIPA). IEEE, 2015. http://dx.doi.org/10.1109/icsipa.2015.7412154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hassan, Badreldin G. H., Isameldin A. Atiem, and Ping Feng. "Rainfall Frequency Analysis of Sudan by Using Bayesian Markov chain Monte Carlo (MCMC) methods." In 2013 International Conference on Information Science and Technology Applications. Atlantis Press, 2013. http://dx.doi.org/10.2991/icista.2013.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wiese, Jonas Gregor, Lisa Wimmer, Theodore Papamarkou, Bernd Bischl, Stephan Guennemann, and David Ruegamer. "Towards Efficient MCMC Sampling in Bayesian Neural Networks by Exploiting Symmetry (Extended Abstract)." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/943.

Full text
Abstract:
Bayesian inference in deep neural networks is challenging due to the high-dimensional, strongly multi-modal parameter posterior density landscape. Markov chain Monte Carlo approaches asymptotically recover the true posterior but are considered prohibitively expensive for large modern architectures. We argue that the dilemma between exact-but-unaffordable and cheap-but-inexact approaches can be mitigated by exploiting symmetries in the posterior landscape. We show theoretically that the posterior predictive density in Bayesian neural networks can be restricted to a symmetry-free parameter refer
APA, Harvard, Vancouver, ISO, and other styles
10

Niaki, Farbod Akhavan, Durul Ulutan, and Laine Mears. "Parameter Estimation Using Markov Chain Monte Carlo Method in Mechanistic Modeling of Tool Wear During Milling." In ASME 2015 International Manufacturing Science and Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/msec2015-9357.

Full text
Abstract:
Several models have been proposed to describe the relationship between cutting parameters and machining outputs such as cutting forces and tool wear. However, these models usually cannot be generalized, due to the inherent uncertainties that exist in the process. These uncertainties may originate from machining, workpiece material composition, and measurements. A stochastic approach can be utilized to compensate for the lack of certainty in machining, particularly for tool wear evolution. The Markov Chain Monte Carlo (MCMC) method is a powerful tool for addressing uncertainties in machining pa
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Markov chain Monte Carlo (MCMC)"

1

Pasupuleti, Murali Krishna. Stochastic Computation for AI: Bayesian Inference, Uncertainty, and Optimization. National Education Services, 2025. https://doi.org/10.62311/nesx/rriv325.

Full text
Abstract:
Abstract: Stochastic computation is a fundamental approach in artificial intelligence (AI) that enables probabilistic reasoning, uncertainty quantification, and robust decision-making in complex environments. This research explores the theoretical foundations, computational techniques, and real-world applications of stochastic methods, focusing on Bayesian inference, Monte Carlo methods, stochastic optimization, and uncertainty-aware AI models. Key topics include probabilistic graphical models, Markov Chain Monte Carlo (MCMC), variational inference, stochastic gradient descent (SGD), and Bayes
APA, Harvard, Vancouver, ISO, and other styles
2

Oskolkov, Nikolay. Machine Learning for Computational Biology. Instats Inc., 2024. http://dx.doi.org/10.61700/l01vi14ohm8en1490.

Full text
Abstract:
This one-day workshop, led by Nikolay Oskolkov from Lund University, provides a comprehensive introduction to machine learning techniques in computational biology, focusing on both theoretical knowledge and practical coding skills in R and Python. Participants will learn to implement from scratch and optimize algorithms such as neural networks, random forest, k-means clustering, and Markov Chain Monte Carlo (MCMC), making it an essential resource for advancing research in biostatistics, genetics, and data science.
APA, Harvard, Vancouver, ISO, and other styles
3

Zang, Emma. Bayesian Statistics for Social and Health Scientists in R and Python. Instats Inc., 2023. http://dx.doi.org/10.61700/obtt1o65iw3ui469.

Full text
Abstract:
This seminar will introduce you to Bayesian statistics, which are increasingly popular and offer a powerful alternative to more traditional forms of statistical analysis. Targeted at a social and health science audience, the seminar will cover the fundamentals of Bayesian inference and illustrate a variety of techniques with applied examples of Bayesian regressions and hierarchical models. You will gain an understanding of Markov chain Monte Carlo (MCMC) methods and learn how to develop and validate Bayesian models so that you can apply them in your daily research, with the kinds of intuitive
APA, Harvard, Vancouver, ISO, and other styles
4

Zang, Emma. Bayesian Statistics for Social and Health Scientists in R and Python + 2 Free Seminars. Instats Inc., 2022. http://dx.doi.org/10.61700/bgfpomu3wdhe5469.

Full text
Abstract:
This seminar will introduce you to Bayesian statistics, which are increasingly popular and offer a powerful alternative to more traditional forms of statistical analysis. Targeted at a social and health science audience, the seminar will cover the fundamentals of Bayesian inference and illustrate a variety of techniques with applied examples of Bayesian regressions and hierarchical models. You will gain an understanding of Markov chain Monte Carlo (MCMC) methods and learn how to develop and validate Bayesian models so that you can apply them in your daily research, with the kinds of intuitive
APA, Harvard, Vancouver, ISO, and other styles
5

Gelfand, Alan E., and Sujit K. Sahu. On Markov Chain Monte Carlo Acceleration. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada279393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Safta, Cosmin, Mohammad Khalil, and Habib N. Najm. Transitional Markov Chain Monte Carlo Sampler in UQTk. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1606084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Warnes, Gregory R. HYDRA: A Java Library for Markov Chain Monte Carlo. Defense Technical Information Center, 2002. http://dx.doi.org/10.21236/ada459649.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Reddy, S., and A. Crisp. Deep Neural Network Informed Markov Chain Monte Carlo Methods. Office of Scientific and Technical Information (OSTI), 2023. http://dx.doi.org/10.2172/2283285.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bates, Cameron Russell, and Edward Allen Mckigney. Metis: A Pure Metropolis Markov Chain Monte Carlo Bayesian Inference Library. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1417145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Small, Matthew. Determining the Mass Function of Planetesimals Using Markov Chain Monte Carlo Simulations. Iowa State University, 2022. http://dx.doi.org/10.31274/cc-20240624-524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!