17-1: Monte Carlo Algorithms
Next video: https://youtu.be/xaSBvljOQkc
Monte Carlo refers to algorithms that rely on repeated random sampling to obtain numerical results. This lecture teaches Monte Carlo using 5 examples:
0:15 Uniform sampling for estimating π
7:37 Buffon's needle problem
13:20 Area of a region
19:39 Monte Carlo integration
29:29 Estimating expectations
Slides: https://github.com/wangshusen/AdvancedAlgorithms
Видео 17-1: Monte Carlo Algorithms канала Shusen Wang
Monte Carlo refers to algorithms that rely on repeated random sampling to obtain numerical results. This lecture teaches Monte Carlo using 5 examples:
0:15 Uniform sampling for estimating π
7:37 Buffon's needle problem
13:20 Area of a region
19:39 Monte Carlo integration
29:29 Estimating expectations
Slides: https://github.com/wangshusen/AdvancedAlgorithms
Видео 17-1: Monte Carlo Algorithms канала Shusen Wang
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
RL-1C: Randomness in MDP, Agent-Environment Interaction
6-1: Binary Tree Basics
3-1: Insertion Sort
5-1: Matrix basics: additions, multiplications, time complexity analysis
RL-1A: Random Variables, Observations, Random Sampling
RL-1G: Summary
Self-Attenion for RNN (1.25x speed recommended)
RL-1D: Rewards and Returns
2-1: Array, Vector, and List: Comparisons
2-2: Binary Search
BERT for pretraining Transformers
Attention for RNN Seq2Seq Models (1.25x speed recommended)
Transformer Model (2/2): Build a Deep Neural Network (1.25x speed recommended)
Few-Shot Learning (2/3): Siamese Networks
Few-Shot Learning (3/3): Pretraining + Fine-tuning
5-2: Dense Matrices: row-major order, column-major order
Vision Transformer for Image Classification
Few-Shot Learning (1/3): Basic Concepts
Transformer Model (1/2): Attention Layers
RL-1B: State, Action, Reward, Policy, State Transition