본문 바로가기
Stay Hungry Stay Foolish/ML & DL

[CS231n] standford university 강의링크 정리

by HANNI하니 2020. 3. 31.

ppt

http://cs231n.stanford.edu/syllabus.html

 

Syllabus | CS 231N

Schedule and Syllabus The Spring 2020 iteration of the course will be taught virtually for the entire duration of the quarter. (more information available here ) The format of lecture and time is still to be determined. Please stay tuned and check back bef

cs231n.stanford.edu

https://blog.naver.com/wpxkxmfpdls/221845894049

 

CS231n 강의노트 정리 링크(핵심내용)

​1강:​2강:​3강:​4강: Backpropagation and Nerual Networkshttps://blog.naver.com/wpxkxmfpdls/22...

blog.naver.com

https://blog.naver.com/jamiet1/221239289809

 

[CS231n#1] Image Classification, Linear classifier

출처 : CS231n + 현재 내가 듣고있는 학교의 강의와 자료를 토대로 복습 [ Image Classification ] - ...

blog.naver.com

http://blog.naver.com/infoefficien/221151681986

 

고려대 - [CS231n] 1. Introduction - 모경현

gaussian37

blog.naver.com

https://blog.naver.com/vi_football/221878546500

 

[CS231n] Lecture 4 정리 - Backpropagation and Neural Networks

[CS231n] Lecture 4​- Backpropagation and Neural NetworksStanford Unicersity의 2017년판 CS...

blog.naver.com

https://blog.naver.com/jhk8169/221702733618

 

[CS231n Spring 2017] Lecture 3: Loss function and Optimization

지난 시간에 이어서, 이번 시간엔 linear classifier의 행렬 W를 어떻게 고르는지에 대해서 다루며 시작합...

blog.naver.com

 

댓글