15-359/659 Probability and Computing (SPRING 18), 12 Units
www.cs.cmu.edu/~15359/
CLASS: Mon/Wed 1:30 p.m. - 2:50 p.m. in GHC 4307
RECITATION A: Fri 1:30 p.m. - 2:20 p.m. PH A22
RECITATION B: Fri 2:30 p.m. - 3:20 p.m. PH A19
RECITATION C: Fri 3:30 p.m. - 4:20 p.m. PH A19
TEXTBOOK:
We are starting to write a textbook that is customized for this class. The book will be distributed one lecture at a time (as I write the chapters). If you wish to read ahead, your best bet is to get this book:
Performance Modeling and Design of Computer Systems and start with Chapter 3.
Probability theory has become indispensable in computer science. It is the core of machine learning theory. In computer science theory,
probabilistic methods and ideas based on randomization appear in many algorithms.
In areas such as networks and systems, probability is
necessary to model variability in the arrival process and service
requirements of jobs, so that we can understand how delay increases with increasing load, predict necessary buffer sizes, determine the appropriate number of servers in a data center, and so on.
This course gives
an introduction to probability as it is used in computer science
theory and practice, drawing on applications and current research
developments as motivation and context.
Material Covered Includes:
Part I : Probability on events. Everything about discrete random variables and continuous random variables, moments, conditioning, Bayes, Laplace transforms, z-transforms. Simulation of random variables.
Also heavy-tailed distributions.
Part II : Concentration inequalities: Markov, Chebyshev, Chernoff Bounds.
Introduction to Randomized algorithms (both Las Vegas and Monte Carlo).
Part III : Discrete-time Markov Chains (with ergodicity proofs) and
Continuous-time Markov chains. Poisson process. Tons of applications.
Elementary queueing theory with applications to modeling web server farms, routers, networking protocols, and capacity provisioning for data centers.
15-359 assumes NO PRIOR PROBABILITY/STATS classes, and will
satisfy the Computer Science Probability/Statistics requirement.
The course DOES assume that you have taken calculus (and still remember
how to integrate and differentiate, as well as remembering Taylor-series expansions). The course also
assumes that you can do simple double integrals, including changing the order of integrals, and also know some basic matrix algebra (eigenvectors, solving equations, etc.). The only real prereq is 15-251, where we expect that you learned how to sum basic arithmetic and geometric series and some basic combinatorics. Prior classes in 3-D Calculus and Linear Algebra are highly recommended, but are not absolute requirements, so long as you take full responsibility for knowing the needed material. 15-359 is ideally taken BEFORE 15-451 and will help you a lot with that class. It will also be very helpful in any future machine learning classes. This is an HONORS class. The pace is fast and the homework level is high. However you will learn a ton.
TEACHING STAFF:
- Prof. Mor Harchol-Balter (Email: harchol@cs.cmu.edu. Office GHC 7207.)
- Prof. Rashmi Vinayak (Email: rvinayak@cs.cmu.edu. Office GHC 9011.)
- Priyatham Bollimpalli (Head TA)
- Corwin de Boor (TA)
- Arisha Kulshrestha (TA)
- Justin Wang (TA)
LOTS OF OFFICE HOURS
Arisha Kulshrestha: Sundays 4 p.m. - 5:00 p.m. in GHC Commons (5th floor)
Rashmi Vinayak: Mondays: 3:00 p.m. - 4:00 p.m. in GHC 9011
Priyatham Bollimpalli: Mondays: 5:30 p.m. - 7:00 p.m. in GHC Commons (5th floor)
Corwin de Boor: Tuesdays: 1:30 p.m. - 3:00 p.m. in GHC Commons (5th floor)
Mor Harchol-Balter: Wednesdays: 5:30 p.m. - 7:00 p.m. in GHC 7207
Justin Wang: Thursdays: 3 p.m. - 4:30 p.m. in GHC Commons (5th floor)
GRADING:
- Weekly homework -- worth 35% combined.
- Midterm 1 -- worth 20%.
- Midterm 2 -- worth 20%.
- Final -- worth 20%.
- Occassional Quizzes -- worth 5%.
- Class Participation -- we will move you up if you're near a grade border and you participate heavily.
Your grade is your total percentage (although there's typically a curve *upwards* at the end):
A = 90 - 100% ;
B = 80 - 89% ;
C = 70 - 79% ;
D = 60 - 69%
This is a hard class, so we aim for a B as the mean, rather than the traditional B- or C mean used at CMU.
HOMEWORK:
Homework will go out each week on Friday. When the homework goes out, you already have all the material you need to do it that day.
Homework will be due each week the following Friday at 1 p.m. (before recitation). Start early! You must get the homework in on time. If you have an emergency, please see the Head TA. (Note: HW 0 is an exception in its dates/times.)
You will find the homework on the class website.
You will turn in homework on Gradescope , which will also track your grades. The gradescope course signup code is M3Y2V7 .
PARTICIPATION:
Your instructors love to teach, and they expect your full participation. Classes will be interactive!
No cell phones in class. Laptops are only permitted for taking notes. Internet must be turned off.
If you use your laptop for anything other than taking notes, I reserve the right to take your laptop.
CHEATING POLICY:
If you use an outside source (web site, book, person, etc.), you must cite that source.
It is fine to discuss problems with others, but you need to write up
the actual homework alone. At the top of your homework sheet, you must
list all the people with whom you discussed any problem.
Crediting help from other others will not take away any
credit from you, and will prevent us from assuming cheating if your
answers look similar to those of someone else. Note that the person providing answers is just as
guilty as the person receiving answers.
The above is the standard policy in all of academia.