COM SCI 260D: Large-Scale Machine Learning
Lecture, four hours; discussion, two hours; outside study six hours. Requisite: course M146. To alleviate costs and improve robustness and generalization performance of modern machine learning models, it becomes crucial to develop methods with strong theoretical guarantees to warrant efficient, accurate, and robust learning. Discussion of advanced topics and state-of-art research to improve efficiency, robustness, and scalability of machine learning algorithms on large data. Topics include advanced optimization, variance reduction, distributed training, federated learning, data summarization, robust learning, neural network pruning, neural architecture search, neural network quantization. Letter grading.
4 units, graduate
Offered Fall quarters
- Predicted GPA
- 3.50
- A or A minus
- 59%
- D, F or withdrew
- 0%
- Sections
- No sections listed for this term. Offered Fall quarters.
- By instructor
- Fall 2022 to Fall 2025
- All instructors
- 3.50 GPA
- 59% A
- 0% DFW
- 378 grades
- MIRZASOLEIMAN
- 3.50 GPA
- 59% A
- 0% DFW
- 378 grades
- Prerequisites
- Requisite: course M146.
- Restrictions
- Not read yet
- Grading
- Not read yet
What past students say
Read from 3 reviews, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Recommend
- 1 recommends it, 1 advises against
- Teaching
- 2 say clear
- Exams
- 1 says moderate
Each figure counts the reviews that say so. Most reviews skip most topics.