Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Stochastic Simulation: Metropolis-Hastings Algorithm
Graph Chatbot
Related lectures (32)
Previous
Page 3 of 4
Next
Pizza Making Process
Covers the process of making pizza, sampling, averages, dispersion, residuals, and normal distribution.
Markov Chain Monte Carlo: Sampling and Convergence
Explores Markov Chain Monte Carlo for sampling high-dimensional distributions and optimizing functions using the Metropolis-Hastings algorithm.
Transfer Functions and Control Algorithms
Explores transfer functions, control algorithms, and system transformations in discrete and analog systems, with practical exercises included.
Numerical Control of Dynamic Systems
Covers topics like digital filtering, stability, and discrete systems, including experiments and manipulations.
Sampling Complex Exponentials
Covers the sampling of complex exponentials and the challenges of reconstruction in different scenarios.
Theory of MCMC
Covers the theory of Markov Chain Monte Carlo (MCMC) sampling and discusses convergence conditions, transition matrix choice, and target distribution evolution.
Review Session: Module 1
Introduces inferential statistics, covering sampling, central tendency, dispersion, histograms, z-scores, and the normal distribution.
Sampling: Inference and Statistics
Explores sampling, inferential statistics, and effective experimentation in statistics.
Generative Models: Self-Attention and Transformers
Covers generative models with a focus on self-attention and transformers, discussing sampling methods and empirical means.
Filtering before Sampling
Emphasizes the necessity of filtering signals before sampling to prevent undersampling effects.