Please send me an E-mail if you plan to attend Moed B.
|פורסם ב- 14/2/2015, 10:45:03 Created on 14/2/2015, 10:45:03 Создано 14/2/2015, 10:45:03 تم النشر ب- 14/2/2015, 10:45:03|
Final Grades are published
|עדכון אחרון ב- 2/2/2015, 16:42:38 Last updated on 2/2/2015, 16:42:38 Последняя модификация 2/2/2015, 16:42:38 تمت الحتلنة الأخيرة ب- 2/2/2015, 16:42:38|
Final details about the exam
|The exam will be held at Taub 5, from 9 to 12 on Friday, 30/1.|
You may bring lecture notes or whatever printed material you want.
|פורסם ב- 27/1/2015, 11:20:03 Created on 27/1/2015, 11:20:03 Создано 27/1/2015, 11:20:03 تم النشر ب- 27/1/2015, 11:20:03|
|The tutorial will be held in room 201.|
|פורסם ב- 26/1/2015, 10:15:54 Created on 26/1/2015, 10:15:54 Создано 26/1/2015, 10:15:54 تم النشر ب- 26/1/2015, 10:15:54|
Exam preparation tutorial
|It seems there is no time which suits everyone.|
I will hold the tutorial at Monday, 3-5 PM.
I will be in my office between 2-3 PM to answer any questions (The tutorial will be dedicated to solving exercises. I might do a very short review of SVM, but that's it)
|פורסם ב- 24/1/2015, 10:31:36 Created on 24/1/2015, 10:31:36 Создано 24/1/2015, 10:31:36 تم النشر ب- 24/1/2015, 10:31:36|
More exercises from the booklet.
|Ex 3: Q1, 2, 3, 4 (Understand 4.2, no need to solve), 5, 9, 10, 12 (Note that the matrix doesn't have to be symmetric. understand the solution to 12.2 - No need to solve), 14 (understand solution. No need to solve), 15 (Note that in 15.3, it's actually true not only for the stored vectors but their negation as well).|
Note that many of these exercises are redundant.
Also, there is nothing about SVM or SVR in these exercises. I suggest you review the material on SVM (remember how you get the dual problem from the lagrangian) and understand the idea behind the kernel trick.
|פורסם ב- 24/1/2015, 10:27:08 Created on 24/1/2015, 10:27:08 Создано 24/1/2015, 10:27:08 تم النشر ب- 24/1/2015, 10:27:08|
A note about VC dimension in the exercise booklet
|Some of the questions and answers in the exercise booklet which refer to VC dimension use a slightly different definition.|
The VC dimension is higher then the VC dimension you were taught by 1 according to that definition.
|פורסם ב- 20/1/2015, 21:42:17 Created on 20/1/2015, 21:42:17 Создано 20/1/2015, 21:42:17 تم النشر ب- 20/1/2015, 21:42:17|
Next tutorial will be dedicated to exam preperation
|Also, I will be at my office between 15:30 and 16:30 instead of the usual hour.|
There will be another exam preparation tutorial (A longer one). see:
(Note that Tuesday might not be possible for me. I'm not sure yet)
If you'd like me to solve something specific, please ask by e-mail.
I will also list which exercises from the booklet are relevant soon.
|פורסם ב- 18/1/2015, 11:48:37 Created on 18/1/2015, 11:48:37 Создано 18/1/2015, 11:48:37 تم النشر ب- 18/1/2015, 11:48:37|
More material has been uploaded
|Also, apparently, there were some exam solution files under "material" and they were set as "invisible".|
|פורסם ב- 15/1/2015, 17:10:08 Created on 15/1/2015, 17:10:08 Создано 15/1/2015, 17:10:08 تم النشر ب- 15/1/2015, 17:10:08|
Grades updated & Announcement
|The grades for HW 3 have been updated and made visible (I forgot about the whole visibility thing...)|
Also, the final exam will be 3 hours, instead of 2 (as I might have said at some point)
|פורסם ב- 13/1/2015, 10:21:21 Created on 13/1/2015, 10:21:21 Создано 13/1/2015, 10:21:21 تم النشر ب- 13/1/2015, 10:21:21|
|I have updated the grades.|
To the student who's ID ends in 58: I only got an answer to the first question (and barely that).
So I didn't give a grade yet.
|פורסם ב- 23/12/2014, 20:55:02 Created on 23/12/2014, 20:55:02 Создано 23/12/2014, 20:55:02 تم النشر ب- 23/12/2014, 20:55:02|
Some things about backpropagation & the exercise
|In my rush to get to the exercise before the tutorial ended I forgot to say a few things about the backpropagation algorithm:|
1. When the algorithm converges, it converges to a local minima (addressing this is one of the possible ways to improve the algorithm)
2. When updating the weights, please use the function 1/2 * (t-y)^2, and when calculating the total error, please use (1/2n) * sum(t_i - y_i)^2
(just to make it more comfortable for me. If you did it differently and you'll need to re-run your code, you don't have to)
3. You need 1003 samples, not 1004. My bad.
|פורסם ב- 14/12/2014, 18:48:00 Created on 14/12/2014, 18:48:00 Создано 14/12/2014, 18:48:00 تم النشر ب- 14/12/2014, 18:48:00|
New assignment has been published
|Good luck and happy holidays.|
|עדכון אחרון ב- 11/12/2014, 14:48:15 Last updated on 11/12/2014, 14:48:15 Последняя модификация 11/12/2014, 14:48:15 تمت الحتلنة الأخيرة ب- 11/12/2014, 14:48:15|
Notes about SVM in HW2
|Please note that while SVM light does not use average error, other SVM implementations might (the sum of the error is divided by the number of training points)|
This might affect the values of C you might want to try (For example, C=400 might be too much, but when the error is divided by 200, 400 might not be high enough for C)
|פורסם ב- 4/12/2014, 14:59:10 Created on 4/12/2014, 14:59:10 Создано 4/12/2014, 14:59:10 تم النشر ب- 4/12/2014, 14:59:10|
Added lecture notes
|Apologies for the delay, I am very forgetful :P|
|פורסם ב- 2/12/2014, 17:43:40 Created on 2/12/2014, 17:43:40 Создано 2/12/2014, 17:43:40 تم النشر ب- 2/12/2014, 17:43:40|
HW1 has been graded & returned
|Returned according to the last 2 digits of the ID.|
|פורסם ב- 30/11/2014, 14:57:08 Created on 30/11/2014, 14:57:08 Создано 30/11/2014, 14:57:08 تم النشر ب- 30/11/2014, 14:57:08|
|Submit by 10/12, please :P.|
|פורסם ב- 26/11/2014, 18:26:40 Created on 26/11/2014, 18:26:40 Создано 26/11/2014, 18:26:40 تم النشر ب- 26/11/2014, 18:26:40|
Clarification on something in HW1
|If you're confused about me asking for both the number of epoches and the number of times we went over all the vectors, it's ok.|
No need for number of vector checks. Most people implement it in a way that makes the number of vector checks be (the number of vectors)*(number of epoches)
I just copied and pasted the assignment used by my predecessors (for the most part)
|פורסם ב- 12/11/2014, 17:57:10 Created on 12/11/2014, 17:57:10 Создано 12/11/2014, 17:57:10 تم النشر ب- 12/11/2014, 17:57:10|
|I've uploaded my notes on lectures 2 and 3. Note that there may be some minor errors.|
I will scan more of my lecture notes next Thursday, and will probably upload them sometime that weekend.
|פורסם ב- 7/11/2014, 21:23:45 Created on 7/11/2014, 21:23:45 Создано 7/11/2014, 21:23:45 تم النشر ب- 7/11/2014, 21:23:45|
Some clarifications about HW #1
|I've been asked some good questions, so here are some good answers:|
1. For Q2, you may assume the data is linearly separable.
2. You may program in any language you choose.
You're welcome to ask more questions by mail if you're not sure about something.
Also, next Wednesday, I will not be at the Technion during office hours. You are welcome to ask questions by e-mail.
If you'd like to meet at another time, send me an e-mail and we can try to set something up.
|פורסם ב- 6/11/2014, 19:14:09 Created on 6/11/2014, 19:14:09 Создано 6/11/2014, 19:14:09 تم النشر ب- 6/11/2014, 19:14:09|
First assignment is published
|You should be done with the Perceptron by this Wednesday. You may, of course, start working on the assignment before that.|
Please submit the assignment by 19/11.
|פורסם ב- 2/11/2014, 14:11:32 Created on 2/11/2014, 14:11:32 Создано 2/11/2014, 14:11:32 تم النشر ب- 2/11/2014, 14:11:32|
The website is up
|Apologies for taking so long with the website.|
The first tutorial will be held today at 16:30 in Taub 8.
|עדכון אחרון ב- 22/10/2014, 12:31:23 Last updated on 22/10/2014, 12:31:23 Последняя модификация 22/10/2014, 12:31:23 تمت الحتلنة الأخيرة ب- 22/10/2014, 12:31:23|