Applicability of Quasi-Monte Carlo for lattice systems
|
|
- Jocelyn Butler
- 5 years ago
- Views:
Transcription
1 Applicability of Quasi-Monte Carlo for lattice systems Andreas Ammon 1,2, Tobias Hartung 1,2,Karl Jansen 2, Hernan Leovey 3, Andreas Griewank 3, Michael Müller-Preussker 1 1 Humboldt-University Berlin, Physics Department, 2 NIC, DESY, Zeuthen, 3 Humboldt-University Berlin, Mathematics Department July st International Symposium on Lattice Field Theory. corresponding publication: arxiv: , (in referee process with CPC)
2 Outline Motivation The (An)Harmonic Oscillator on the Lattice Results Outlook/Conclusions
3 typical lattice problem: Z = Dx e S[x] ; x = (x 1,..., x d ) (1) O = Z 1 Dx e S[x] O[x] (2) stochastic approximation through Markov chain Monte Carlo methods: Metropolis algorithm, HMC,... finite Markov chain: x 1,..., x N N samples of O: O 1,..., O N O i random variables with variance σo 2 estimate O = 1 N N i=1 O i has standard error O = σ O N need 100 times more statistics to get additional digit of precision past improvements: reduce σ O and auto-correlation Improved error scaling would be highly desirable!
4 improved error scaling? quasi-monte Carlo (QMC) is an approach to improve the asymptotic error behaviour see for example F. Kuo, Ch. Schwab and I. Sloan, 2012[KSS12] construction of deterministic low-discrepancy point-sets in arbitrary many dimensions low-discrepancy more uniform (see below) promises N 1 asymptotic error behaviour for integrands with certain properties (e.g. Gaussian) two times more digits with the same number of samples!! applied successfully to financial problems (see bibliography)
5 QMC point sets are more uniform How does an actual uniform sampling in two dimensions look like? Example: 512 two-dimensional pseudo-random points pseudo random 2d point set histogram of counts count frequency sample 512 points introduce grid of 8 8 equal squares count number of points in each square count occurrence of 1, 2,... points in a square (histogram of histogram) Poisson distribution with λ = n = 8 uneven sampling larger stochastic error
6 QMC point set (2d Sobol samples) : quasi Monte Carlo point set (Sobol) histogram of counts count frequency Figure: 512 uniform 2d Sobol points each square contains same number of points delta distribution even coverage less stochastic fluctuations simulate effect of higher statistics with much less samples in this sense QMC is exactly what we want randomisation possible (RQMC) w/o changing properties practical error estimation
7 problem description lattice action (see Creutz and Freedman [CF81]): d ( ) M0 (x i+1 x i ) 2 S = a + µ2 2 a 2 2 x i 2 + λxi 4 i=1 M 0... particle mass µ 2 = M 0ω 2... frequency/spring constant a... lattice spacing d... number of lattice sites T = da... time extent ; x d+1 = x 1 (p.b.) λ = 0 harmonic oscillator λ > 0 anharmonic oscillator, µ 2 < 0 double well potential Anharmonic potential µ 2 > 0 Anharmonic potential µ 2 < 0 Figure: two cases for the anharmonic potential
8 observables primary observables derived quantities x 2 = 1 xi 2 (3) d i x 4 = 1 xi 4 (4) d i x k x k+j = 1 x i x i+j... correlator (5) d i E 0 = 3λ x 4 + µ 2 x 2 + µ4 16 (6) E 1 E 0 = energy gap from correlator fit (7) theoretically known for a 0, T = da (iterative method) Blankenbecler, DeGrand and Sugar 1980 [BDS80]
9 experiment I: harmonic oscillator (λ = 0, µ 2 > 0 ) partition function can be written as multivariate Gaussian integral ( Z = Dx exp 1 ) 2 x t C 1 x C 1 = 2M0 a ((1 + a2 µ 2 )δ ij 1 ) 2M 0 2 (δ ij+1 + δ ij 1 ) covariance matrix: C = SDS t D = diag(β 1,..., β d ) β i R + ( x = Sw Z Dw exp ) 1 wi 2 2β i i (8) (9) (10) sampling algorithm generate uniform z [0, 1] d (pseudo random / QMC ) w i = β i Φ 1 (z i ), Φ 1... inverse standard normal CDF ordering of eigenvalues β 1 > β 2 >... > β d when using QMC like ordering of importance z 1 > z 2 >... > z d x i = S ij w j ( Hartley transformation, involutive: S = S 1 = S t )
10 harmonic oscillator results parameters: µ 2 = 2.0, M 0 = 0.5, a = 0.5 & d = 100 Error of <x 2 > for the Harmonic Oscillator Fit QMC, α = Error of <x 2 > 1e 07 1e 05 1e 03 Mc MC Rand. QMC 10 i N 10 i N i = 5 : 5 <X 2 > χ 2 = ; dof = Number of samples N log(n) Figure: left: asymptotic error behaviour of MC/QMC, right: fit of QMC error N α QMC at work trivial, but successful application to physical problem
11 experiment II: anharmonic oscillator (λ = 1, µ 2 < 0 ) direct sampling not possible because of anharmonic part of the potential do reweighting ( Z = Dx exp 1 2 xt C 1 x aλ ) xi 4 i (11) ( C 1 indefinite (µ 2 < 0) define C 1 sim = 2M 0 (1 + µ a 2 sim with µ 2 sim > 0, arbitrary insert the productive 0 Z = = Dx exp 1 2 xtc 1 sim x }{{} sampling 1 2 xt (C 1 C 1 sim )x aλ i a 2 )δ 2M 0 ij 1 ( ) ) δij+1 + δ 2 ij 1 xi 4 } {{ } reweighting (12) Dx e 1 2 xt C 1 sim x W (x) (13) sampling like harmonic oscillator but with C C sim observable estimation from samples (x j ) j=1,...,n : j O W (xj )O(x j ) j W W (x) = e (xj )
12 numerical results/anharmonic oscillator parameters: M 0 = 0.5, a = 0.015, µ 2 = 16 fit: O CN α O α log C χ 2 /dof d = 100 X (8) 2.0(1) 7.9 / 6 X (8) 4.0(1) 13.2 / 6 E (9) 4.0(1) 8.3 / 6 d = 1000 X (14) 2.0(2) 5.0 / 4 X (14) 4.0(2) 5.7 / 4 E (13) 4.0(2) 4.0 / 4 Error of <X 2 >, d = 1000 Error of <X 4 >, d = 1000 Error of E 0, d = 1000 <X 2 > 5e 04 2e <X 4 > E N N N ( arxiv: , K. Jansen, H. Leovey, A. Ammon, A. Griewank, M. Müller-Preußker, 2013[JLA + 13])
13 energy gap asymptotic behaviour of correlator non-trivial observable not possible to detect on present parameter setup (T too small) changed µ 2 = 16 µ 2 = 4, energy gap: result obtained for d = 100, N = 2 5, 2 8, 2 11, 2 14 and 400 Sobol sequences each: α = 0.735(13) (Tobias Hartung, 2013, personal communication)
14 outlook & conclusions harmonic oscillator: QMC works perfectly (as expected) anharmonic oscillator: significantly improved error scaling N 3 4 remaining questions: Why do we observe this N 3 4 behaviour?? further improvements by generalised choice of C sim? other, possibly non-gaussian, sampling methods next step: one-dimensional spin model in cosine discretisation S[φ] = Ia i 1 a 2 cos(φ i+1 φ i ) (14) study χ Q (topological susceptibility) and E = E 1 E 0 (energy gap)
15 R. Blankenbecler, T. A. DeGrand and R. Sugar, Moment Method for Eigenvalues and Expectation Values, Phys.Rev. D21, 1055 (1980). M. Creutz and B. Freedman, A STATISTICAL APPROACH TO QUANTUM MECHANICS, Annals Phys. 132, 427 (1981). P. Glasserman, Monte Carlo methods in financial engineering, volume 53 of Applications of Mathematics (New York), Springer-Verlag, New York, 2004, Stochastic Modelling and Applied Probability. K. Jansen, H. Leovey, A. Ammon, A. Griewank and M. Müller-Preußker, Quasi-Monte Carlo methods for lattice systems: a first look, (2013), F. Kuo, C. Schwab and I. Sloan, Quasi-Monte Carlo methods for high-dimensional integration: the standard (weighted Hilbert space) setting and beyond, ANZIAM Journal 53(0) (2012).
arxiv: v1 [hep-lat] 19 Nov 2013
HU-EP-13/69 SFB/CPP-13-98 DESY 13-225 Applicability of Quasi-Monte Carlo for lattice systems arxiv:1311.4726v1 [hep-lat] 19 ov 2013, a,b Tobias Hartung, c Karl Jansen, b Hernan Leovey, Anreas Griewank
More informationAlternatives to conventional Monte Carlo
Alternatives to conventional Monte Carlo Recursive umerical Integration & Julia Volmer Andreas Ammon, Alan enz, Tobias Hartung, Karl Jansen, Hernan Leövey DESY Zeuthen 16. September 216 Julia Volmer (DESY
More informationMonte Carlo simulations of harmonic and anharmonic oscillators in discrete Euclidean time
Monte Carlo simulations of harmonic and anharmonic oscillators in discrete Euclidean time DESY Summer Student Programme, 214 Ronnie Rodgers University of Oxford, United Kingdom Laura Raes University of
More informationQuasi-Monte Carlo Methods for Applications in Statistics
Quasi-Monte Carlo Methods for Applications in Statistics Weights for QMC in Statistics Vasile Sinescu (UNSW) Weights for QMC in Statistics MCQMC February 2012 1 / 24 Quasi-Monte Carlo Methods for Applications
More informationToday: Fundamentals of Monte Carlo
Today: Fundamentals of Monte Carlo What is Monte Carlo? Named at Los Alamos in 940 s after the casino. Any method which uses (pseudo)random numbers as an essential part of the algorithm. Stochastic - not
More informationData Analysis I. Dr Martin Hendry, Dept of Physics and Astronomy University of Glasgow, UK. 10 lectures, beginning October 2006
Astronomical p( y x, I) p( x, I) p ( x y, I) = p( y, I) Data Analysis I Dr Martin Hendry, Dept of Physics and Astronomy University of Glasgow, UK 10 lectures, beginning October 2006 4. Monte Carlo Methods
More informationToday: Fundamentals of Monte Carlo
Today: Fundamentals of Monte Carlo What is Monte Carlo? Named at Los Alamos in 1940 s after the casino. Any method which uses (pseudo)random numbers as an essential part of the algorithm. Stochastic -
More informationMonte Carlo Methods in High Energy Physics I
Helmholtz International Workshop -- CALC 2009, July 10--20, Dubna Monte Carlo Methods in High Energy Physics CALC2009 - July 20 10, Dubna 2 Contents 3 Introduction Simple definition: A Monte Carlo technique
More informationFast evaluation of mixed derivatives and calculation of optimal weights for integration. Hernan Leovey
Fast evaluation of mixed derivatives and calculation of optimal weights for integration Humboldt Universität zu Berlin 02.14.2012 MCQMC2012 Tenth International Conference on Monte Carlo and Quasi Monte
More informationToday: Fundamentals of Monte Carlo
Today: Fundamentals of Monte Carlo What is Monte Carlo? Named at Los Alamos in 1940 s after the casino. Any method which uses (pseudo)random numbers as an essential part of the algorithm. Stochastic -
More informationNew Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets
New Multilevel Based on Quasi-Monte Carlo Point Sets Michael Gnewuch Institut für Informatik Christian-Albrechts-Universität Kiel 1 February 13, 2012 Based on Joint Work with Jan Baldeaux (UTS Sydney)
More informationProgress in high-dimensional numerical integration and its application to stochastic optimization
Progress in high-dimensional numerical integration and its application to stochastic optimization W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Short course,
More informationMetropolis/Variational Monte Carlo. Microscopic Theories of Nuclear Structure, Dynamics and Electroweak Currents June 12-30, 2017, ECT*, Trento, Italy
Metropolis/Variational Monte Carlo Stefano Gandolfi Los Alamos National Laboratory (LANL) Microscopic Theories of Nuclear Structure, Dynamics and Electroweak Currents June 12-30, 2017, ECT*, Trento, Italy
More informationMonte Carlo and cold gases. Lode Pollet.
Monte Carlo and cold gases Lode Pollet lpollet@physics.harvard.edu 1 Outline Classical Monte Carlo The Monte Carlo trick Markov chains Metropolis algorithm Ising model critical slowing down Quantum Monte
More informationClassical Monte Carlo Simulations
Classical Monte Carlo Simulations Hyejin Ju April 17, 2012 1 Introduction Why do we need numerics? One of the main goals of condensed matter is to compute expectation values O = 1 Z Tr{O e βĥ} (1) and
More informationNumerical Methods II
Numerical Methods II Prof. Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute MC Lecture 13 p. 1 Quasi-Monte Carlo As in lecture 6, quasi-monte Carlo methods offer much greater
More informationA =, where d n w = dw
Chapter 9 Monte Carlo Simulations So far we have either dealt with exactly soluble systems like the (time-dependent) oscillator or with various expansions like the semiclassical, perturbative and high-temperature
More informationNumerical Analysis for Statisticians
Kenneth Lange Numerical Analysis for Statisticians Springer Contents Preface v 1 Recurrence Relations 1 1.1 Introduction 1 1.2 Binomial CoefRcients 1 1.3 Number of Partitions of a Set 2 1.4 Horner's Method
More informationMonte Carlo study of the Baxter-Wu model
Monte Carlo study of the Baxter-Wu model Nir Schreiber and Dr. Joan Adler Monte Carlo study of the Baxter-Wu model p.1/40 Outline Theory of phase transitions, Monte Carlo simulations and finite size scaling
More informationA CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS
Statistica Sinica 26 (2016), 1117-1128 doi:http://dx.doi.org/10.5705/ss.202015.0240 A CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS Xu He and Peter Z. G. Qian Chinese Academy of Sciences
More informationIntroduction to Machine Learning CMU-10701
Introduction to Machine Learning CMU-10701 Markov Chain Monte Carlo Methods Barnabás Póczos & Aarti Singh Contents Markov Chain Monte Carlo Methods Goal & Motivation Sampling Rejection Importance Markov
More informationTheir Statistical Analvsis. With Web-Based Fortran Code. Berg
Markov Chain Monter rlo Simulations and Their Statistical Analvsis With Web-Based Fortran Code Bernd A. Berg Florida State Univeisitfi USA World Scientific NEW JERSEY + LONDON " SINGAPORE " BEIJING " SHANGHAI
More informationThe Lovasz-Vempala algorithm for computing the volume of a convex body in O*(n^4) - Theory and Implementation
The Lovasz-Vempala algorithm for computing the volume of a convex body in O*(n^4) - Theory and Implementation Mittagsseminar, 20. Dec. 2011 Christian L. Müller, MOSAIC group, Institute of Theoretical Computer
More informationMonte Carlo (MC) Simulation Methods. Elisa Fadda
Monte Carlo (MC) Simulation Methods Elisa Fadda 1011-CH328, Molecular Modelling & Drug Design 2011 Experimental Observables A system observable is a property of the system state. The system state i is
More informationNumerical integration and importance sampling
2 Numerical integration and importance sampling 2.1 Quadrature Consider the numerical evaluation of the integral I(a, b) = b a dx f(x) Rectangle rule: on small interval, construct interpolating function
More informationBayesian Inference for DSGE Models. Lawrence J. Christiano
Bayesian Inference for DSGE Models Lawrence J. Christiano Outline State space-observer form. convenient for model estimation and many other things. Bayesian inference Bayes rule. Monte Carlo integation.
More informationAlgorithms for Uncertainty Quantification
Algorithms for Uncertainty Quantification Lecture 9: Sensitivity Analysis ST 2018 Tobias Neckel Scientific Computing in Computer Science TUM Repetition of Previous Lecture Sparse grids in Uncertainty Quantification
More informationGeneral Construction of Irreversible Kernel in Markov Chain Monte Carlo
General Construction of Irreversible Kernel in Markov Chain Monte Carlo Metropolis heat bath Suwa Todo Department of Applied Physics, The University of Tokyo Department of Physics, Boston University (from
More informationMetropolis Monte Carlo simulation of the Ising Model
Metropolis Monte Carlo simulation of the Ising Model Krishna Shrinivas (CH10B026) Swaroop Ramaswamy (CH10B068) May 10, 2013 Modelling and Simulation of Particulate Processes (CH5012) Introduction The Ising
More informationMalvin H. Kalos, Paula A. Whitlock. Monte Carlo Methods. Second Revised and Enlarged Edition WILEY- BLACKWELL. WILEY-VCH Verlag GmbH & Co.
Malvin H. Kalos, Paula A. Whitlock Monte Carlo Methods Second Revised and Enlarged Edition WILEY- BLACKWELL WILEY-VCH Verlag GmbH & Co. KGaA v I Contents Preface to the Second Edition IX Preface to the
More informationHastings-within-Gibbs Algorithm: Introduction and Application on Hierarchical Model
UNIVERSITY OF TEXAS AT SAN ANTONIO Hastings-within-Gibbs Algorithm: Introduction and Application on Hierarchical Model Liang Jing April 2010 1 1 ABSTRACT In this paper, common MCMC algorithms are introduced
More informationMCRG Flow for the Nonlinear Sigma Model
Raphael Flore,, Björn Wellegehausen, Andreas Wipf 23.03.2012 So you want to quantize gravity... RG Approach to QFT all information stored in correlation functions φ(x 0 )... φ(x n ) = N Dφ φ(x 0 )... φ(x
More informationMultigrid Methods for Linear Systems with Stochastic Entries Arising in Lattice QCD. Andreas Frommer
Methods for Linear Systems with Stochastic Entries Arising in Lattice QCD Andreas Frommer Collaborators The Dirac operator James Brannick, Penn State University Björn Leder, Humboldt Universität Berlin
More informationAdvanced Monte Carlo Methods Problems
Advanced Monte Carlo Methods Problems September-November, 2012 Contents 1 Integration with the Monte Carlo method 2 1.1 Non-uniform random numbers.......................... 2 1.2 Gaussian RNG..................................
More informationThe nature of superfluidity in the cold atomic unitary Fermi gas
The nature of superfluidity in the cold atomic unitary Fermi gas Introduction Yoram Alhassid (Yale University) Finite-temperature auxiliary-field Monte Carlo (AFMC) method The trapped unitary Fermi gas
More informationMarkov Chains and MCMC
Markov Chains and MCMC Markov chains Let S = {1, 2,..., N} be a finite set consisting of N states. A Markov chain Y 0, Y 1, Y 2,... is a sequence of random variables, with Y t S for all points in time
More informationRandomized Quasi-Monte Carlo for MCMC
Randomized Quasi-Monte Carlo for MCMC Radu Craiu 1 Christiane Lemieux 2 1 Department of Statistics, Toronto 2 Department of Statistics, Waterloo Third Workshop on Monte Carlo Methods Harvard, May 2007
More informationLPTM. Quantum-Monte-Carlo Approach to the Thermodynamics of Highly Frustrated Spin-½ Antiferromagnets. Andreas Honecker 1
Quantum-Monte-Carlo Approach to the Thermodynamics of Highly Frustrated Spin-½ Antiferromagnets LPTM Laboratoire de Physique Théorique et Modélisation Andreas Honecker 1 Laboratoire de Physique Théorique
More information8 Error analysis: jackknife & bootstrap
8 Error analysis: jackknife & bootstrap As discussed before, it is no problem to calculate the expectation values and statistical error estimates of normal observables from Monte Carlo. However, often
More informationBayesian Inference for DSGE Models. Lawrence J. Christiano
Bayesian Inference for DSGE Models Lawrence J. Christiano Outline State space-observer form. convenient for model estimation and many other things. Bayesian inference Bayes rule. Monte Carlo integation.
More informationReliability Theory of Dynamic Loaded Structures (cont.) Calculation of Out-Crossing Frequencies Approximations to the Failure Probability.
Outline of Reliability Theory of Dynamic Loaded Structures (cont.) Calculation of Out-Crossing Frequencies Approximations to the Failure Probability. Poisson Approximation. Upper Bound Solution. Approximation
More informationDiscretization of SDEs: Euler Methods and Beyond
Discretization of SDEs: Euler Methods and Beyond 09-26-2006 / PRisMa 2006 Workshop Outline Introduction 1 Introduction Motivation Stochastic Differential Equations 2 The Time Discretization of SDEs Monte-Carlo
More informationErnst-Michael Ilgenfritz, Michael Müller-Preussker and Andre Sternbeck
Twisted mass QCD thermodynamics: first results on apenext Ernst-Michael Ilgenfritz, Michael Müller-Preussker and Andre Sternbeck Humboldt-Universität zu Berlin, Institut für Physik, Newtonstr. 15, 12489
More informationRandom Eigenvalue Problems Revisited
Random Eigenvalue Problems Revisited S Adhikari Department of Aerospace Engineering, University of Bristol, Bristol, U.K. Email: S.Adhikari@bristol.ac.uk URL: http://www.aer.bris.ac.uk/contact/academic/adhikari/home.html
More informationFirst results from dynamical chirally improved fermions
First results from dynamical chirally improved fermions arxiv:hep-lat/595v1 1 Sep 25 C. B.Lang Karl-Franzens-Universität Graz, Austria E-mail: christian.lang@uni-graz.at Karl-Franzens-Universität Graz,
More informationBayesian Inference for DSGE Models. Lawrence J. Christiano
Bayesian Inference for DSGE Models Lawrence J. Christiano Outline State space-observer form. convenient for model estimation and many other things. Preliminaries. Probabilities. Maximum Likelihood. Bayesian
More information1 Introduction. Lera Sapozhnikova a,c. James Beacham b,c. September 17, 2007
A Comparison of the Fermionic Overlap-Dirac Operator and Pure Gauge Field Definitions of the Quenched Topological Susceptibility in the Schwinger Model Lera Sapozhnikova a,c James Beacham b,c a Faculty
More informationProbability and Stochastic Processes
Probability and Stochastic Processes A Friendly Introduction Electrical and Computer Engineers Third Edition Roy D. Yates Rutgers, The State University of New Jersey David J. Goodman New York University
More informationNumerical Analysis of 2-D Ising Model. Ishita Agarwal Masters in Physics (University of Bonn) 17 th March 2011
Numerical Analysis of 2-D Ising Model By Ishita Agarwal Masters in Physics (University of Bonn) 17 th March 2011 Contents Abstract Acknowledgment Introduction Computational techniques Numerical Analysis
More informationImprovement of Monte Carlo estimates with covariance-optimized finite-size scaling at fixed phenomenological coupling
Improvement of Monte Carlo estimates with covariance-optimized finite-size scaling at fixed phenomenological coupling Francesco Parisen Toldin Max Planck Institute for Physics of Complex Systems Dresden
More informationIntroduction to Statistics and Error Analysis II
Introduction to Statistics and Error Analysis II Physics116C, 4/14/06 D. Pellett References: Data Reduction and Error Analysis for the Physical Sciences by Bevington and Robinson Particle Data Group notes
More informationQuasi-Monte Carlo integration over the Euclidean space and applications
Quasi-Monte Carlo integration over the Euclidean space and applications f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with James Nichols (UNSW) Journal of Complexity 30
More informationFinite-Horizon Statistics for Markov chains
Analyzing FSDT Markov chains Friday, September 30, 2011 2:03 PM Simulating FSDT Markov chains, as we have said is very straightforward, either by using probability transition matrix or stochastic update
More informationUNCERTAINTY QUANTIFICATION IN LIQUID COMPOSITE MOULDING PROCESSES
UNCERTAINTY QUANTIFICATION IN LIQUID COMPOSITE MOULDING PROCESSES Bart Verleye 1, Dirk Nuyens 1, Andrew Walbran 3,2, and Ming Gan 2 1 Dept. Computer Science, KU Leuven, Celestijnenlaan 200A, B-3001 Leuven,
More informationScientific Computing: Monte Carlo
Scientific Computing: Monte Carlo Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Spring 2012 April 5th and 12th, 2012 A. Donev (Courant Institute)
More informationMarkov Processes. Stochastic process. Markov process
Markov Processes Stochastic process movement through a series of well-defined states in a way that involves some element of randomness for our purposes, states are microstates in the governing ensemble
More informationLecture 7 and 8: Markov Chain Monte Carlo
Lecture 7 and 8: Markov Chain Monte Carlo 4F13: Machine Learning Zoubin Ghahramani and Carl Edward Rasmussen Department of Engineering University of Cambridge http://mlg.eng.cam.ac.uk/teaching/4f13/ Ghahramani
More informationMarkov Chain Monte Carlo Method
Markov Chain Monte Carlo Method Macoto Kikuchi Cybermedia Center, Osaka University 6th July 2017 Thermal Simulations 1 Why temperature 2 Statistical mechanics in a nutshell 3 Temperature in computers 4
More informationComputer Vision Group Prof. Daniel Cremers. 11. Sampling Methods: Markov Chain Monte Carlo
Group Prof. Daniel Cremers 11. Sampling Methods: Markov Chain Monte Carlo Markov Chain Monte Carlo In high-dimensional spaces, rejection sampling and importance sampling are very inefficient An alternative
More informationModelling of Dependent Credit Rating Transitions
ling of (Joint work with Uwe Schmock) Financial and Actuarial Mathematics Vienna University of Technology Wien, 15.07.2010 Introduction Motivation: Volcano on Iceland erupted and caused that most of the
More informationarxiv:hep-lat/ v1 29 Sep 1997
1 Topology without cooling: instantons and monopoles near to deconfinement M. Feurstein a, E.-M. Ilgenfritz b, H. Markum a, M. Müller-Preussker b and S. Thurner a HUB EP 97/66 September 19, 1997 arxiv:hep-lat/9709140v1
More informationLow Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed?
Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Xiaoqun Wang 1,2 and Ian H. Sloan 2 1 Department of Mathematical Sciences, Tsinghua University, Beijing 100084,
More informationConnections between score matching, contrastive divergence, and pseudolikelihood for continuous-valued variables. Revised submission to IEEE TNN
Connections between score matching, contrastive divergence, and pseudolikelihood for continuous-valued variables Revised submission to IEEE TNN Aapo Hyvärinen Dept of Computer Science and HIIT University
More informationKernel adaptive Sequential Monte Carlo
Kernel adaptive Sequential Monte Carlo Ingmar Schuster (Paris Dauphine) Heiko Strathmann (University College London) Brooks Paige (Oxford) Dino Sejdinovic (Oxford) December 7, 2015 1 / 36 Section 1 Outline
More informationComputational Physics (6810): Session 13
Computational Physics (6810): Session 13 Dick Furnstahl Nuclear Theory Group OSU Physics Department April 14, 2017 6810 Endgame Various recaps and followups Random stuff (like RNGs :) Session 13 stuff
More informationThe heavy-light sector of N f = twisted mass lattice QCD
The heavy-light sector of N f = 2 + 1 + 1 twisted mass lattice QCD Marc Wagner Humboldt-Universität zu Berlin, Institut für Physik mcwagner@physik.hu-berlin.de http://people.physik.hu-berlin.de/ mcwagner/
More informationMonte Caro simulations
Monte Caro simulations Monte Carlo methods - based on random numbers Stanislav Ulam s terminology - his uncle frequented the Casino in Monte Carlo Random (pseudo random) number generator on the computer
More informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
More informationReview. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda
Review DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Probability and statistics Probability: Framework for dealing with
More informationQuantum Monte Carlo Simulations in the Valence Bond Basis
NUMERICAL APPROACHES TO QUANTUM MANY-BODY SYSTEMS, IPAM, January 29, 2009 Quantum Monte Carlo Simulations in the Valence Bond Basis Anders W. Sandvik, Boston University Collaborators Kevin Beach (U. of
More information3.320 Lecture 18 (4/12/05)
3.320 Lecture 18 (4/12/05) Monte Carlo Simulation II and free energies Figure by MIT OCW. General Statistical Mechanics References D. Chandler, Introduction to Modern Statistical Mechanics D.A. McQuarrie,
More informationStochastic Particle Methods for Rarefied Gases
CCES Seminar WS 2/3 Stochastic Particle Methods for Rarefied Gases Julian Köllermeier RWTH Aachen University Supervisor: Prof. Dr. Manuel Torrilhon Center for Computational Engineering Science Mathematics
More informationTutorial on quasi-monte Carlo methods
Tutorial on quasi-monte Carlo methods Josef Dick School of Mathematics and Statistics, UNSW, Sydney, Australia josef.dick@unsw.edu.au Comparison: MCMC, MC, QMC Roughly speaking: Markov chain Monte Carlo
More informationAuxiliary-field Monte Carlo methods in Fock space: sign problems and methods to circumvent them
Auxiliary-field Monte Carlo methods in Fock space: sign problems and methods to circumvent them Introduction Yoram Alhassid (Yale University) Finite-temperature auxiliary-field Monte Carlo methods in Fock
More informationLecture 8: The Metropolis-Hastings Algorithm
30.10.2008 What we have seen last time: Gibbs sampler Key idea: Generate a Markov chain by updating the component of (X 1,..., X p ) in turn by drawing from the full conditionals: X (t) j Two drawbacks:
More informationApplication of QMC methods to PDEs with random coefficients
Application of QMC methods to PDEs with random coefficients a survey of analysis and implementation Frances Kuo f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with Ivan Graham
More informationCS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling
CS242: Probabilistic Graphical Models Lecture 7B: Markov Chain Monte Carlo & Gibbs Sampling Professor Erik Sudderth Brown University Computer Science October 27, 2016 Some figures and materials courtesy
More informationApril 20th, Advanced Topics in Machine Learning California Institute of Technology. Markov Chain Monte Carlo for Machine Learning
for for Advanced Topics in California Institute of Technology April 20th, 2017 1 / 50 Table of Contents for 1 2 3 4 2 / 50 History of methods for Enrico Fermi used to calculate incredibly accurate predictions
More informationNumerical methods for lattice field theory
Numerical methods for lattice field theory Mike Peardon Trinity College Dublin August 9, 2007 Mike Peardon (Trinity College Dublin) Numerical methods for lattice field theory August 9, 2007 1 / 37 Numerical
More informationarxiv: v2 [math.nt] 27 Mar 2018
arxiv:1710.09313v [math.nt] 7 Mar 018 The Champernowne constant is not Poissonian Ísabel Pirsic, Wolfgang Stockinger Abstract We say that a sequence (x n n N in [0,1 has Poissonian pair correlations if
More informationA NOTE ON STOCHASTIC INTEGRALS AS L 2 -CURVES
A NOTE ON STOCHASTIC INTEGRALS AS L 2 -CURVES STEFAN TAPPE Abstract. In a work of van Gaans (25a) stochastic integrals are regarded as L 2 -curves. In Filipović and Tappe (28) we have shown the connection
More informationLecture 2: Repetition of probability theory and statistics
Algorithms for Uncertainty Quantification SS8, IN2345 Tobias Neckel Scientific Computing in Computer Science TUM Lecture 2: Repetition of probability theory and statistics Concept of Building Block: Prerequisites:
More informationMarkov Chain Monte Carlo Inference. Siamak Ravanbakhsh Winter 2018
Graphical Models Markov Chain Monte Carlo Inference Siamak Ravanbakhsh Winter 2018 Learning objectives Markov chains the idea behind Markov Chain Monte Carlo (MCMC) two important examples: Gibbs sampling
More informationKonrad-Zuse-Zentrum für Informationstechnik Berlin Takustrasse 7, Berlin, Germany
DECORRELATION OF THE TOPOLOGICAL CHARGE IN TEMPERED SIMULATIONS OF FULL QCD H. STÜBEN Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustrasse 7, 14195 Berlin, Germany Abstract. The improvement of
More informationInference For High Dimensional M-estimates. Fixed Design Results
: Fixed Design Results Lihua Lei Advisors: Peter J. Bickel, Michael I. Jordan joint work with Peter J. Bickel and Noureddine El Karoui Dec. 8, 2016 1/57 Table of Contents 1 Background 2 Main Results and
More information4. Cluster update algorithms
4. Cluster update algorithms Cluster update algorithms are the most succesful global update methods in use. These methods update the variables globally, in one step, whereas the standard local methods
More informationELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process
Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random
More informationRandom Matrix Eigenvalue Problems in Probabilistic Structural Mechanics
Random Matrix Eigenvalue Problems in Probabilistic Structural Mechanics S Adhikari Department of Aerospace Engineering, University of Bristol, Bristol, U.K. URL: http://www.aer.bris.ac.uk/contact/academic/adhikari/home.html
More informationOptimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition
Optimal Randomized on Function Spaces with underlying ANOVA decomposition Michael Gnewuch 1 University of Kaiserslautern, Germany October 16, 2013 Based on Joint Work with Jan Baldeaux (UTS Sydney) & Josef
More informationLarge Scale Bayesian Inference
Large Scale Bayesian I in Cosmology Jens Jasche Garching, 11 September 2012 Introduction Cosmography 3D density and velocity fields Power-spectra, bi-spectra Dark Energy, Dark Matter, Gravity Cosmological
More informationStatistical Thermodynamics and Monte-Carlo Evgenii B. Rudnyi and Jan G. Korvink IMTEK Albert Ludwig University Freiburg, Germany
Statistical Thermodynamics and Monte-Carlo Evgenii B. Rudnyi and Jan G. Korvink IMTEK Albert Ludwig University Freiburg, Germany Preliminaries Learning Goals From Micro to Macro Statistical Mechanics (Statistical
More informationSmooth Common Principal Component Analysis
1 Smooth Common Principal Component Analysis Michal Benko Wolfgang Härdle Center for Applied Statistics and Economics benko@wiwi.hu-berlin.de Humboldt-Universität zu Berlin Motivation 1-1 Volatility Surface
More informationNEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE
NEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE Quoc T. Le Gia Ian H. Sloan Yu Guang Wang Robert S. Womersley School of Mathematics and Statistics University of New South Wales, Australia
More informationRandom Walks A&T and F&S 3.1.2
Random Walks A&T 110-123 and F&S 3.1.2 As we explained last time, it is very difficult to sample directly a general probability distribution. - If we sample from another distribution, the overlap will
More informationHandbook of Stochastic Methods
Springer Series in Synergetics 13 Handbook of Stochastic Methods for Physics, Chemistry and the Natural Sciences von Crispin W Gardiner Neuausgabe Handbook of Stochastic Methods Gardiner schnell und portofrei
More informationMarkov Chain Monte Carlo Simulations and Their Statistical Analysis An Overview
Markov Chain Monte Carlo Simulations and Their Statistical Analysis An Overview Bernd Berg FSU, August 30, 2005 Content 1. Statistics as needed 2. Markov Chain Monte Carlo (MC) 3. Statistical Analysis
More informationComputer Vision Group Prof. Daniel Cremers. 14. Sampling Methods
Prof. Daniel Cremers 14. Sampling Methods Sampling Methods Sampling Methods are widely used in Computer Science as an approximation of a deterministic algorithm to represent uncertainty without a parametric
More informationI. QUANTUM MONTE CARLO METHODS: INTRODUCTION AND BASICS
I. QUANTUM MONTE CARLO METHODS: INTRODUCTION AND BASICS Markus Holzmann LPMMC, UJF, Grenoble, and LPTMC, UPMC, Paris markus@lptl.jussieu.fr http://www.lptl.jussieu.fr/users/markus (Dated: January 24, 2012)
More informationLecture on Parameter Estimation for Stochastic Differential Equations. Erik Lindström
Lecture on Parameter Estimation for Stochastic Differential Equations Erik Lindström Recap We are interested in the parameters θ in the Stochastic Integral Equations X(t) = X(0) + t 0 µ θ (s, X(s))ds +
More informationScaling analysis of snapshot spectra in the world-line quantum Monte Carlo for the transverse-field Ising chain
TNSAA 2018-2019 Dec. 3-6, 2018, Kobe, Japan Scaling analysis of snapshot spectra in the world-line quantum Monte Carlo for the transverse-field Ising chain Kouichi Seki, Kouichi Okunishi Niigata University,
More information