DDA6201, Fall 2024
Instructor: Tongxin Li litongxin@cuhk.edu.cn
Course Schedule: Wed 2:00PM - 4:50PM
Venue: Teaching B Bldg 306
Course Information
Table of contents
Course Description
This course introduces advanced theory and applications of online algorithms. Topics include introduction to online algorithms; classical online problems; regret and competitive ratio; multi-armed bandit problems; online convex optimization; follow-the-regularized-leader and applications; no-regret dynamics in games; online algorithms with predictions. This course requires students to have advanced mathematical backgrounds in machine learning and algorithms.
Grading Scheme (DDA4210)
- Assignments 45 %
- Group Project Presentation: 40 %
- Paper Reading Presentation 15 %
General Course Policies:
Academic Integrity: Academic dishonesty may result in a failing grade (i.e. F). Every student is expected to review and abide by the Academic Integrity Policy of CUHK-Shenzhen. Ignorance will not be allowed as an excuse for any academic dishonesty. Do not hesitate to ask me if you are ever in doubt about what constitutes plagiarism, cheating, or any other breach of academic integrity.