 |
|
|
|
|
|
| Grade Statistics | Below are the average grades of Moed A. We hope this information will assist you in deciding whether or not to attend MoedB.
ExamA (before factor): 69
ExamA (after factor): 74
FinalA: 86 |
|
| Created on 28/2/2012, 11:53:41 |
|
|
|
|
|
|
|
|
|
|
|
|
| Moed A | Moed A (including a general solution) has been uploaded.
Please send all appeals to Omer by email, and don't forget to include the scans. |
|
| Created on 21/2/2012, 01:06:11 |
|
|
|
|
|
|
|
|
|
|
|
|
| More Solved Exams | | Last semester's moed B has been uploaded (including short solution). |
|
| Created on 15/2/2012, 20:53:35 |
|
|
|
|
|
|
|
|
|
|
|
|
| Omer's Reception Hours | I am not feeling well, and will not be able to hold reception hours at the Technion as intended. Instead, I will be available on Skype (levyomer) today between 18:00-20:00. As always, I am available via email.
Omer |
|
| Created on 15/2/2012, 16:08:26 |
|
|
|
|
|
|
|
|
|
|
|
|
| Exam Information | A few notes regarding the exam:
- All material covered in the lectures, tutorials, and assignments is potentially in the exam.
- The exam is with closed material; save the rainforests! Reference code or equations will be supplied within the exam itself, if needed.
Good luck! |
|
| Last updated on 11/2/2012, 19:44:16 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 3 - Competition Results | The winners of the learning competition are:
1. Kiril Yurovnik
2. Igal Kreichman & Nadir Izrael
3. Noa Korner
Congratulations! |
|
| Created on 7/2/2012, 00:31:38 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 2 - Competition Results | The winners of the Quarto competition are:
1. Igal Kreichman & Nadir Izrael
2. Meirav Zehavi
3. Hila Glantz & Uria Peretz
Congratulations! |
|
| Created on 31/1/2012, 11:54:51 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 3 - Competition Details | | The minimal learning time in the competition will be 8 seconds. |
|
| Created on 28/1/2012, 13:51:13 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 2 - Agent Failure | The second competition cannot be run due to a substantial number of failures. These failures are a result of not submitting according to the assignment's instructions (for example, missing submissions.txt) and not checking the actual code before submission.
As stated in the instructions, malfunctioning agents will result in point reduction (-25). All agents must demonstrate minimal functionality; this is essential to the assignment evaluation.
All teams below must resubmit the assignment to my email by Sunday at 20:00. The tournament will be rerun at 20:05.
201532165-994770923
307571208-318109477
021531819-066412404
301033585
037023231-036933778
301618492
300646825-203091392
|
|
| Created on 26/1/2012, 00:04:57 |
|
|
|
|
|
|
|
|
|
|
|
|
| Next Lecture - Watson | Next week's lecture will be given by Dr. David Carmel about Watson, IBM's AI system that defeated human experts in the trivia game of Jeopardy!
David's lecture got wonderful reviews last year, so we have decided to open it up to the general public. You are more than welcome to invite friends who are not taking our course this semester. |
|
| Created on 20/1/2012, 14:07:08 |
|
|
|
|
|
|
|
|
|
|
|
|
| Evaluating Classifiers | Please read the document in the provided link:
http://www.cs.ucc.ie/~dgb/courses/tai/notes/handout5.pdf
This should summarize the popular methods for evaluating classifiers.
Regarding evaluation in the third assignment:
- When evaluating random consistent trees, use a single train/test split. The test set may be anywhere between 10% and 33% of the entire dataset, as long as the accuracy estimation is fine enough.
- When comparing two classifiers, use 10-fold cross validation, and check for statistical significance using McNemar's test. This is provided in agent_comparator.py.
Feel free to ask questions by email or schedule a phone call.
Omer |
|
| Created on 18/1/2012, 13:57:14 |
|
|
|
|
|
|
|
|
|
|
|
|
| Tutorial Cancellation | Dear students,
I am ill, and won't be able to teach tomorrow's lesson. A summary of the lesson's material will be uploaded to the course website, and I will allow telephone reception hours (on appointment).
Omer |
|
| Created on 15/1/2012, 22:57:35 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 3 - Bug Fix | | There was a bug in the provided code (DecisionTree.preHash()). A fixed version has been uploaded. |
|
| Created on 14/1/2012, 20:37:07 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 3 | | The third (and final) homework assignment has been published. Good luck! |
|
| Created on 10/1/2012, 22:56:26 |
|
|
|
|
|
|
|
|
|
|
|
|
| 1. New Slides 2. Guest lecture | There is a new set of slides, "Learning.pdf" for tomorrow lecture.
I also have good news - Dr. David Carmel, a member of IBM Watson
team, will give us a guest lecture at our 21/1 slot. Please feel free to invite
your friends.
|
|
| Created on 6/1/2012, 18:31:21 |
|
|
|
|
|
|
|
|
|
|
|
|
| Future Assignment Submission | Future reports should be submitted in PDF to Omer's email instead of a print-out.
You should still submit the experimental code and competition agents to their respective locations in the course website, in addition to the report. |
|
| Created on 2/1/2012, 22:26:33 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 1 - Competition Results | The Sokoban competition's results are in, and the winners are...
1. Shahar Timnat
2. Igal Kreichman & Nadir Izrael
3. Gil Fruchter & Nitzan Dori
Congratulations to the winners! |
|
| Created on 1/1/2012, 23:48:03 |
|
|
|
|
|
|
|
|
|
|
|
|
| Threading and Multiprocessing | Threading, multiprocessing, system signals and the likes, are all prohibited in the course assignments. You may use multiple processes/threads to run different experiments, but may not do so as part of an agent.
We will briefly address the issue of anytime algorithms in a multiple-processor environment in the next tutorial. |
|
| Created on 1/1/2012, 01:21:38 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 2 - Postponement | | The assignment's deadline has been postponed by a week. Reports handed in after Monday morning, January 9th, will not be checked. |
|
| Last updated on 30/12/2011, 18:39:58 |
|
|
|
|
|
|
|
|
|
|
|
|
| New slides for tomorrow lecture: CSP | Dear students,
I hope you remember that there is a lecture tomorrow.
I uploaded a new set of slides on the topic of
Constraint Satisfaction Problems
which will be the topic of the lecture tomorrow
Shaul |
|
| Created on 27/12/2011, 02:18:15 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 2 - Bug Fix | | There was a small bug in quarto_game.py, and new version has already been uploaded. Please make sure you are in sync. |
|
| Created on 22/12/2011, 14:56:29 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 2 | | The second assignment has been published. Good luck! |
|
| Created on 19/12/2011, 13:36:28 |
|
|
|
|
|
|
|
|
|
|
|
|
| December 18 - no lecture today | I am sorry but there will be no lecture today.
Shaul |
|
| Created on 18/12/2011, 08:08:25 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 1 - Postponement | The assignment's deadline has been postponed to Sunday night. There will be no further postponements; assignments handed in after the deadline will not be checked.
The only exception is miluim. Contact me (Omer) ASAP if you are eligible for a miluim-based postponement. |
|
| Last updated on 13/12/2011, 21:04:49 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 1 | The first assignment has been published! Since you have only two weeks to complete this assignment, we strongly advise you to start working on it ASAP.
Next week's tutorial will provide some statistical background to help you with experiment analysis. It is recommended that you start running experiments by then (or at the very least finish reading the assignment), because otherwise, the tutorial's material may be out of context.
|
|
| Created on 30/11/2011, 14:31:35 |
|
|
|
|
|
|
|
|
|
|
|
|
| Homework Assignment 0 | | An introductory assignment has been uploaded, to get you familiarized with Python. Note that this assignment is not for submission, but highly recommended for those who are not fluent in Python. |
|
| Created on 16/11/2011, 12:55:41 |
|
|
|
|
|
|
|
|
|
|
|
|
| Tutorial Notes | | Notes from the first tutorial have been uploaded. Feel free to email me (Omer) with any question regarding the tutorial. |
|
| Created on 16/11/2011, 12:53:58 |
|
|
|
|
|
|
|
|
|
|
|
|
| Tutorial Times | | Unfortunately, the proposed time is unavailable for too many people, who have no way of making it to class. We will therefore revert back to the original time (Monday 9:30). |
|
| Created on 10/11/2011, 14:31:58 |
|
|
|
|
|
|
|
|
|
|
|
|
| Tutorial Times | The algorithm yielded D13 (Wednesday 13:30-14:30) as the best time. Those of you who cannot attend at that time (you know who you are), please contact me ASAP and let me know why. If this slot is problematic as well, we will have to revert to Mondays at 9:30.
Omer |
|
| Created on 10/11/2011, 00:36:08 |
|
|
|
|
|
|
|
|
|
|
|
|
| Tutorial Times Format | A few clarifications about the format:
- A09 means Sunday 9:30-10:30.
- X08 (8:30-9:30) is the earliest and X18 (18:30-19:30) is the latest.
|
|
| Created on 8/11/2011, 11:25:35 |
|
|
|
|
|
|
|
|
|
|
|
|
| Tutorial Times | After a rather failed attempt at finding an agreeable time-slot, we will take an algorithmic approach to resolve this issue. This requires every student to send me his/her constraints, ordered by importance, in the following format:
X##
X##
X##
...
Where X is the day of the week (A, B, C, D, or E) and ## is the hour (08, 09, 10, ..., 18). For example, if I cannot attend on Sunday morning, and Wednesday afternoon is a bit inconvenient, I would send the following:
A08
A09
A10
D14
D15
The format is critical because I will be feeding your preferences directly to a program.
The algorithm itself is pretty simple - it first marks everybody's most problematic time-slot, then everybody's second-most problematic time-slot, and so on. The algorithm ends when a certain iteration eliminates all available time-slots, and returns the previous state. One of the remaining time-slots in this state will be selected, with respect to the preferences in the final iteration.
Please submit your requests to the new "Tutorial Times" assignment as a txt file in the mentioned format. You may add as many conflicts as you choose, but note that only the first N will be taken into account (N being the final iteration). I really think that this is the best and fairest way to decide.
Thanks,
Omer |
|
| Created on 7/11/2011, 23:36:04 |
|
|
|
|
|
|
|
|
|
|
|
|
| First Tutorial | | The first tutorial will take place on Monday morning at 9:30 as appears in UG. Please make an effort to attend, as we will spend the last few minutes of the lesson to find an alternative time. |
|
| Created on 5/11/2011, 04:27:32 |
|
|
|
|
|
|
|
|
|
|
|
|
| AI Tutorials | Welcome to Introduction to Artificial Intelligence!
We would like to make a few important announcements before the semester begins. During the first two weeks of semester, no tutorials will take place. In addition, we would like to move the tutorials to a different time-slot. Currently, Sunday afternoon seems like the best option. Please notify Omer by email if that time-slot is utterly impossible.
Shana Tova! |
|
| Created on 27/9/2011, 14:34:49 |
|
|
|
|
|
|
Technion - Israel Institute of Technology 
