2017-2018 2018-2019 2019-2020 2020-2021 2021-2022
 Browseby subject... Scheduleview...

# 1 - 3 of 3 results for: MATH151

## CS 229:Machine Learning (STATS 229)

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 to the equivalency of CS106A, CS106B, or CS106X, familiarity with probability theory to the equivalency of CS 109, MATH151, or STATS 116, and familiarity with multivariable calculus and linear algebra to the equivalency of MATH51 or CS205.
Terms: Aut, Spr, Sum | Units: 3-4

## MATH 151:Introduction to Probability Theory

A proof-oriented development of basic probability theory. Counting; axioms of probability; conditioning and independence; expectation and variance; discrete and continuous random variables and distributions; joint distributions and dependence; Central Limit Theorem and laws of large numbers. This course is pre-approved as an alternative to CS 109 for the CS major if one later takes CS 228 or CS 229. Prerequisite: Math 61CM, or Math 52 and either Math 56 or Math 115 (or equivalent).
Terms: Win | Units: 3 | UG Reqs: GER:DB-Math, WAY-FR

## STATS 229:Machine Learning (CS 229)

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 to the equivalency of CS106A, CS106B, or CS106X, familiarity with probability theory to the equivalency of CS 109, MATH151, or STATS 116, and familiarity with multivariable calculus and linear algebra to the equivalency of MATH51 or CS205.
Terms: Aut, Spr, Sum | Units: 3-4
Filter Results:
term offered
 Autumn Winter Spring Summer
updating results...
teaching presence
 in person online: asynchronous online: synchronous remote: asynchronous remote: synchronous independent studies
updating results...
number of units
 1 unit 2 units 3 units 4 units 5 units >5 units
updating results...
time offered
 early morning (before 10am) morning (10am-12pm) lunchtime (12pm-2pm) afternoon (2pm-5pm) evening (after 5pm)
updating results...
days
 Monday Tuesday Wednesday Thursday Friday Saturday Sunday
updating results...
UG Requirements (GERs)
 WAY-A-II WAY-AQR WAY-CE WAY-EDP WAY-ER WAY-FR WAY-SI WAY-SMA Language Writing 1 Writing 2 Writing SLE DB:Hum DB:Math DB:SocSci DB:EngrAppSci DB:NatSci EC:EthicReas EC:GlobalCom EC:AmerCul EC:Gender IHUM1 IHUM2 IHUM3
updating results...
component
 Lecture (LEC) Seminar (SEM) Discussion Section (DIS) Laboratory (LAB) Lab Section (LBS) Activity (ACT) Case Study (CAS) Colloquium (COL) Workshop (WKS) Independent Study (INS) Intro Dial, Sophomore (IDS) Intro Sem, Freshman (ISF) Intro Sem, Sophomore (ISS) Internship (ITR) Arts Intensive Program (API) Language (LNG) Clerkship (CLK) Practicum (PRA) Practicum (PRC) Research (RES) Sophomore College (SCS) Thesis/Dissertation (T/D)
updating results...
career