Catalog Description: Deep Networks have revolutionized computer vision, language technology, robotics and control. They have growing impact in many other areas of science and engineering. They do not however, follow a closed or compact 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.

Units: 4

Student Learning Outcomes: Students will learn design principles and best practices: design motifs that work well in particular domains, structure optimization and parameter optimization. , Understanding deep networks. Methods with formal guarantees: generative and adversarial models, tensor factorization., Students will come to understand visualizing deep networks. Exploring the training and use of deep networks with visualization tools.

Prerequisites: MATH 53 and MATH 54 or equivalent; COMPSCI 70 or STAT 134; COMPSCI 61B or equivalent; COMPSCI 189 or COMPSCI 289A (recommended)

Formats:
Spring: 3.0 hours of lecture and 1.0 hours of discussion per week
Fall: 3.0 hours of lecture and 1.0 hours of discussion per week

Grading Basis: letter

Final Exam Status: No final exam

---

Class Schedule (Spring 2025):
CS C182/282A – MoWe 14:00-15:29, Soda 306 – Anant Sahai

Class Notes
* Time conflicts ARE allowed but no alternate final exam

* The lecture WILL be recorded for playback later

Class Schedule (Fall 2025):
CS C182/282A – TuTh 11:00-12:29, Soda 306 – Anant Sahai, Gireeja Vishnu Ranade

Class homepage on inst.eecs

Links:

• CS enrollment policies
• EE enrollment policies
• HKN course maps