• 沒有找到結果。

Course Logistics

N/A
N/A
Protected

Academic year: 2022

Share "Course Logistics"

Copied!
14
0
0

加載中.... (立即查看全文)

全文

(1)
(2)

Course Logistics

(3)

Course Logistics

Instructor: 陳縕儂 Yun-Nung (Vivian) Chen Time: Tuesday 234, 9:10-12:20

Location: 資104

Website: http://adl.miulab.tw

NTU COOL: https://cool.ntu.edu.tw/courses/175/

Email: [email protected]

To ensure timely response, email title should contain “[ADL2019]”

Do NOT send to our personal emails

Always check the up-to-date information from the website

(4)

NTU COOL

新的課程平台: NTU COOL

課程側錄上傳

作業手寫題直接上傳繳交 (還可以寫 code 呢!)

強大的助教團隊

論壇郵件回信

TA Recitation

TA Hours

(5)

Course Goal

The students are expected to understand

1. how deep learning works

2. how to frame tasks into learning problems

3. how to use toolkits to implement designed models, and 4. when and why specific deep learning techniques work for

specific problems

(6)

Pre-requisites

Course

◦Required: college-level calculus, linear algebra

◦Preferred: probability, statistics

Programming

◦proficiency in Python; all assignments will be in Python

◦GitHub; all assignments will be handed in via GitHub

◦Kaggle; all assignments will be submitted to Kaggle

(tutorial from Stanford) (tutorial) (website)

GPU resources are LIMITED, so please consider your available resources for taking this course

(7)

GitHub Student Pack

The student plan provides unlimited private repositories

make your assignments private before the due date

make them public afterwards

(8)

Grading Policy

4 Individual Assignment: 18% x 4 = 72%

◦GitHub code w/ README

The score is given based on the ranking list

Bonus points for outstanding performance

Late policy: 25% off per day late afterwards

Final Group Project: 25%

◦GitHub code, Project document

Bonus points for the outstanding work

Others: 5%

◦Write-up for the guest lecture/company visit

Understanding the difference between “collaboration” and “academic infraction”

(9)

Individual Assignments

A2. Word Representation A1. Dialogue Modeling

(10)

Final Group Project (2~5 persons)

Choose your preferred project topic

Proposal (BONUS!): submit your proposal

Get additional bonus if other groups choose the same the proposed topics

Presentation

Poster presentation

Outstanding projects will be selected for company-sponsored awards/prizes

Project Report & Code

Wrap-up project report

GitHub code submission w/ README

The project details will be announced later

(11)

How to Get the Registration Code?

Limit: ~100 students per course Requirements

Available GPU Resources

Programming skills

Fill in the Google Form

Selection order if out of limit

EECS Graduate = EECS (4-yr up) > EECS Others > Others

(12)

Tentative Schedule

Week Topic Assignment

1 2019/02/19 Course Logistics & Introduction

2 2019/02/26 Neural Network Basics &Guest Lecture by Dr. Yang

3 2019/03/05 Backpropagation + Word Representations A1 – Dialogue Modeling 4 2019/03/12 Recurrent / Recursive Neural Networks

5 2019/03/19 TA Recitation A2 – Word Embeddings

6 2019/03/26 Attention Mechanism 7 2019/04/02 Spring Break

8 2019/04/09 Word Embeddings + Contextual Embeddings A3 – Game Playing 9 2019/04/16 Company Workshop

10 2019/04/23 Convolutional Neural Networks

11 2019/04/30 Deep Reinforcement Learning A4 – Conditional Generation 12 2019/05/07 Deep Reinforcement Learning

13 2019/05/14 Break

14 2019/05/21 Generative Adversarial Networks 15 2019/05/28 Generative Adversarial Networks 16 2019/06/04 Break

17 2019/06/11 Unsupervised Learning 18 2019/06/18 Final Project Presentation

(13)

Teaching Assistant Team

(14)

Rules

Asking questions is encouraged!!

Any comment or feedback is preferred!!

(speed, style, etc)

Going to TA hours!!

參考文獻

相關文件

Since everyone needs to write the final solutions alone, there is absolutely no need to lend your homework solutions and/or source codes to your classmates at any time.. In order

First, write a program to implement the (linear) ridge regression algorithm for classification (i.e. use 0/1 error for evaluation)?. Use the first 400 examples for training to get g

(a) Consider a binary classification algorithm A majority that returns a constant classifier that always predicts the majority class (i.e., the class with more instances in the data

(A 10% bonus can be given if your proof for either case is rigorous and works for general polynomial regression.).. If gradient boosting is coupled with linear regression

Since everyone needs to write the final solutions alone, there is absolutely no need to lend your homework solutions and/or source codes to your classmates at any time.. In order

Since everyone needs to write the final solutions alone, there is absolutely no need to lend your homework solutions and/or source codes to your classmates at any time.. In order

(*) Implement the fixed learning rate gradient descent algorithm below for logistic regression, ini- tialized with 0?. Run the algorithm with η = 0.001 and T = 2000 on the following

課堂講授 Lectures 課堂討論 Class Discussions 實務操作 Practices 專題演講 Seminar 實地參訪 Field Trips e 化教學 e-Learning 完全網路教學 Complete Web-Teaching 混和式網路教學