Course description
The objective of the course is to provide students with a measure-theoretic understanding of probability that is normally not taught in engineering departments. The hope is that this will equip students with deeper concepts and tools in probability theory that help in understanding deeper concepts in machine learning, reinforcement learning, the analysis of stochastic approximation algorithms, and more.
Prerequisites
Basic probability and analysis.
Evaluation
| Component | Marks |
|---|---|
| Mid-term examination | 30 |
| Assignments | 20 |
| End-semester examination | 50 |
Syllabus
Sigma-fields; construction of probability spaces and measures; random variables and measurability; independence; integration and expectation; monotone convergence; dominated convergence; almost sure and in-probability convergence; convergence in distribution; the central limit theorem; conditional expectation and martingales.
References
- G. R. Shorack, Probability for Statisticians, Springer, 2nd edition, 2017.
- R. Ash and C. Doléans-Dade, Probability and Measure Theory, 1999.
Academic honesty
As students of IISc, we expect you to adhere to the highest standards of academic honesty and integrity.
Elements of the course are designed to support your learning of the subject. Copying will not help you (in the exams or in the real world), so don't do it. If you have difficulties learning some of the topics or lack some background, try to form study groups where you can bounce off ideas with one another and try to teach each other what you understand. You're also welcome to talk to any of us and we'll be glad to help you.
If any exam/assignment is found to be copied, it will automatically result in a zero grade for that assignment and a warning note to your advisor. Any repeat instance will automatically lead to a failing grade in the course.