20592 - STATISTICS AND PROBABILITY
Department of Decision Sciences
SONIA PETRONE
Mission & Content Summary
MISSION
CONTENT SUMMARY
PART I : Probability recap
- Definition and basic properties
- Random variables. Multivariate distributions
- Expectation and conditional expectation.
- Convergence of random variables.
Basic notions on stocastic processes. Random noise. Random walks. Markov chains.
Part II : Statistical inference
- Models, Statistical Inference and Learning
- Elements of nonparametric estimation.
- The bootstrap.
- Parametric Inference
- MLE and asymptotics
- Confidence intervals
- Hypothesis testing and p-values
PART III - Bayesian learning
- Fundamentals of Bayesian learning
- Bayes rule and examples.
- Bayesian linear regression (if time permits)
ALL OVER: Computational methods
- Stochastic integration and Monte Carlo.
- Optimization. EM algorithm.
- Parametric bootstrap (if time permits)
- Markov Chain Monte Carlo.
Intended Learning Outcomes (ILO)
KNOWLEDGE AND UNDERSTANDING
- Define, describe and explain rigorously the main notions of probability and statistical learning in the frequentist and Bayesian approach.
* Identify computational strategies for fundamental complex problems
* Recognize the role of probability and statistics in "data science" and related fields
APPLYING KNOWLEDGE AND UNDERSTANDING
- Estimate and predict, and quantify uncertainty, in fundamental problems
- Write algorithms in Python for the implementation of computational statistic techniques, namely optimization and integration techniques.
Teaching methods
- Face-to-face lectures
- Exercises (exercises, database, software etc.)
- Individual assignments
- Group assignments
DETAILS
Students will be given periodic group or individual assignments, on the theory and on the implementation of computational methods (with Python).
Assessment methods
Continuous assessment | Partial exams | General exam | |
---|---|---|---|
|
x | ||
|
x | x |
ATTENDING AND NOT ATTENDING STUDENTS
ASSIGNMENTS:
Students wil be given periodic assigments, on the theory and on the computational methods presented in class.
The assigments (take-home) will be done in groups (up to 5 people). The assigments are very important to encourage students to follow and verify their understanding!
They are not formally evaluated, but **students who do not deliver the assigments will have additional questions in the written proof**
EXAM:
The exam will consist in an individual written proof (unfortunately, from remote), that will count 70%, and a final project on computational methods, that counts 30%.
NOTE 1: The final project is done in groups, while the written proof is individual. Therefore, the written proof may count 100% if poorly done.
NOTE 2: The exam structure might be slightly modified, in order to accomodate for the possible difficulties due to the COVID-19 pandemics, taking into account th students' needs. In that case, students will be promptly informed, through BBoard announcements and more.
Teaching materials
ATTENDING AND NOT ATTENDING STUDENTS
textbook
L. Wasserman, "All of Statistics", Springer
More teaching material, lecture notes, Python code etc will be provided on BBoard.