Course Information
Reporting Issues
Please read this page before posting.
Piazza
Use this link to Piazza Links to an external site. for general class discussions
Discussion Times
(No discussions in the first week. Discussions start week of 1/28/19)
Number | Time | Location | GSI |
101 | M 10-11 AM | 320 Soda | Daniel Seita |
102 | M 11-12 noon | 320 Soda | Daniel Seita |
103 | M 12-1 PM | 320 Soda | David Chan |
104 | M 1-2 PM | 320 Soda | Philippe Laban |
105 | M 2-3 PM | 405 Soda | Philippe Laban |
106 | M 3-4 PM | 405 Soda | David Chan |
107 | M 12-1 PM | 310 Soda | Forrest Huang |
108 | M 1-2 PM | 310 Soda | Forrest Huang |
Course Overview
Deep Networks have revolutionized computer vision, voice interaction, natural language and robotics. They have growing impact in the sciences and medicine, and are starting to touch many other aspects of life. Unlike many other computational tools though, they do not follow a closed set of theoretical principles. In Yann Lecun's words they require "an interplay between intuitive insights, theoretical modeling, practical implementations, empirical studies, and scientific analyses." This course attempts to cover that ground, and has three goals:
* Design principles and best practices: design motifs that work well in particular domains, structure optimization and parameter optimization.
* Visualizing deep networks. Exploring the training and use of deep networks with visualization tools.
* Understanding deep networks. Methods with formal guarantees: generative and adversarial models.
This is the third offering of the class, and it borrows computer vision content from the Stanford course CS231n: Convolutional Neural Networks for Visual Recognition and in reinforcement learning from the Berkeley course: CS294: Deep Reinforcement Learning.
Logistics
- Course Numbers: CS 182/282A Spring 2019, UC Berkeley
- Class Numbers: 182: 32191, 282A: 31116
- Instructor: John Canny
- GSIs:
- Philippe Laban: phillab@berkeley.edu
- Daniel Seita: seita@cs.berkeley.edu
- David Chan: davidchan@berkeley.edu
- Forrest Huang: forrest_huang@berkeley.edu
- Time: MW 8-9:30am
- Location: Dwinelle 145
- Discussion: Join Piazza for announcements and to ask questions about the course
Prerequisites
The prerequisites for this course are:
* Knowledge of calculus and linear algebra, Math 53/54 or equivalent. You'll need this throughout the course.
* Probability and Statistics, CS70 or Stat 134. We'll talk about continuous and discrete probability distributions. CS70 is bare minimum preparation, a stat course is better.
* Machine Learning, CS189. You may be able to manage the course without 189 but in that case you should have a strong stat background.
* Programming, CS61B or equivalent. Assignments will mostly use Python. If you need some help, try this tutorial from CS231n (Links to an external site.)
Texts
We'll frequently use the online book: Deep Learning (Links to an external site.) by Ian Goodfellow and Yoshua Bengio and Aaron Courville. For reinforcement learning, the new version of Sutton and Barto's classic book is available online (Links to an external site.).
Grading
- Class Participation: 10%
- Midterms: 30%
- Final Project (in groups): 30%
- Assignments : 30%
Slip Days
You can use up to 5 slip days for late assignments.
Office hours
Staff | Time | Location |
John Canny | M 2-3pm | 637 Soda |
Philippe Laban | M 3-4pm | BID 354-360 Hearst Mining Bldg |
Daniel Seita | Tu 4-5:30pm | VCL (off Atrium) 5th Floor Soda |
David Chan | Th 8:30-10am | 411 Soda |
Forrest Huang | W 10-11:30am | BID 354-360 Hearst Mining Bldg |
Lectures Online
The class will be screen-captured and audio-recorded. Recordings will be available from bCourses and CalCentral. You should be able to get them from the "Course Captures" tab at the left.