## Results for Stats116 |
4 courses |

Topics: statistical pattern recognition, linear and non-linear regression, non-parametric methods, exponential family, GLMs, support vector machines, kernel methods, deep learning, model/feature selection, learning theory, ML advice, clustering, density estimation, EM, dimensionality reduction, ICA, PCA, reinforcement learning and adaptive control, Markov decision processes, approximate dynamic programming, and policy search. Prerequisites: knowledge of basic computer science principles and skills at a level sufficient to write a reasonably non-trivial computer program in Python/numpy, familiarity with probability theory to the equivalency of CS109 or STATS116, and familiarity with multivariable calculus and linear algebra to the equivalency of MATH51.

Terms: Aut, Spr, Sum
| Units: 3-4

Instructors: ; Charikar, M. (PI); Ma, T. (PI); Ng, A. (PI); Re, C. (PI); Caron, P. (TA); Ding, T. (TA); Do, D. (TA); Fuster, A. (TA); Jain, S. (TA); Kamalu, J. (TA); Li, H. (TA); Nie, X. (TA); Shu, R. (TA); Sun, A. (TA); Waites, C. (TA); Wolff, C. (TA); Yuan, H. (TA); Z. HaoChen, J. (TA); Zhu, M. (TA)

This class will cover the principles and practices of domain-specific programming models and compilers for dense and sparse applications in scientific computing, data science, and machine learning. We will study programming models from the recent literature, categorize them, and discuss their properties. We will also discuss promising directions for their compilation, including the separation of algorithm, schedule, and data representation, polyhedral compilation versus rewrite rules, and sparse iteration theory. Prerequisites: CS161 or equivalent, STATS116 or equivalent.

Terms: Aut
| Units: 3

Probability spaces as models for phenomena with statistical regularity. Discrete spaces (binomial, hypergeometric, Poisson). Continuous spaces (normal, exponential) and densities. Random variables, expectation, independence, conditional probability. Introduction to the laws of large numbers and central limit theorem. Prerequisites: MATH 52 and familiarity with infinite series, or equivalent.

Terms: Aut, Spr, Sum
| Units: 4
| UG Reqs: GER:DB-Math, WAY-AQR, WAY-FR

Instructors: ; Dubey, P. (PI); Schramm, T. (PI); Bhattacharya, S. (TA); Gupta, S. (TA); Zhou, K. (TA)

Topics: statistical pattern recognition, linear and non-linear regression, non-parametric methods, exponential family, GLMs, support vector machines, kernel methods, deep learning, model/feature selection, learning theory, ML advice, clustering, density estimation, EM, dimensionality reduction, ICA, PCA, reinforcement learning and adaptive control, Markov decision processes, approximate dynamic programming, and policy search. Prerequisites: knowledge of basic computer science principles and skills at a level sufficient to write a reasonably non-trivial computer program in Python/numpy, familiarity with probability theory to the equivalency of CS109 or STATS116, and familiarity with multivariable calculus and linear algebra to the equivalency of MATH51.

Terms: Aut, Spr, Sum
| Units: 3-4

Instructors: ; Charikar, M. (PI); Ma, T. (PI); Ng, A. (PI); Re, C. (PI); Caron, P. (TA); Ding, T. (TA); Do, D. (TA); Fuster, A. (TA); Jain, S. (TA); Kamalu, J. (TA); Li, H. (TA); Nie, X. (TA); Shu, R. (TA); Sun, A. (TA); Waites, C. (TA); Wolff, C. (TA); Yuan, H. (TA); Z. HaoChen, J. (TA); Zhu, M. (TA)