CS229m Lec 7 : Radamacher Complexity bounds for linear models & neural nets/ Challenges in DL theory
cs229m_stanford
목록 보기
2/2
Summary :
R.C bounds for linear models & two-layer NNs.
Challenges in DL Theory (3 aspects : optimization/implicit regularization/generalization bounds)
Methods used for proof:
Telegrand's Lemma within Lipschitzness of function
inequalities related to sup
infinite sup usage
통계/DS/AI 기록일지