Description

Course Focus
===========
Algorithms and methods in classical and modern Artificial Intelligence

Course motivation
==============
This course is motivated by the need to provide computer science students with a thorough background in classical artificial intelligence. This is a key course for students who want to work in artificial and computational intelligence.

Target Audience:
=============
The target audience for this course is graduate students and researchers in computer science.

Pre-Requisites:
===========
1. Undergraduate level data structures and algorithms course
2. Programming in C++ or any high level language. Python will be particularly useful!

Course Objectives
==============
At the end of this course, successful candidates will:
- Know about the state of the art algorithms and theory in Artificial Intelligence
- Understand ‘agent models’ of Artificial Intelligence
- Be able to apply concepts of Artificial Intelligence in real life development projects

Course Schedule
=============
3 Credit Hours, 48 contact hours

Course Design and Contents:
======================
- Basics: Introduction to AI, its scope and focus. Intelligent agent model of AI.
- Uninformed Search Techniques: Search problems in Computer Science, Uninformed Search (Breadth First Search, Depth First Search etc.,), Refinements and advancements in uninformed search.
- Heuristic Search: Heuristics, Greedy Best First Search, A* search with Memory bounded heuristic search
- Local Search Techniques: Hill climbing, simulated annealing and Genetic Algorithms
- Intelligent Game Programming: Decision making in games, MIN-MAX, Alpha beta pruning, intelligent game design
- Reinforcement Learning
- Learning from Data
- Neural Solvers for Games and Reinforcement Learning


Course Books/References:
=====================
• Artificial Intelligence: A modern approach, 3rd Edition, Stuart Russell and Peter Norvig, Prentice Hall 2010.

• Latest research papers

Grading Policy
===========
Team Project: 30%
Sessional Exam: 20%
Assignments and Quizzes: 20%
Final Exam: 30%

General Information

No information, yet. Stay tuned!

Announcements

Deep Learning Based Reinforcement Learning Paper
8/24/17 12:17 AM

Please read the deep mind paper "Human-level control through deep reinforcement learning": http://www.nature.com/nature/journal/v518/n7540/full/nature14236.html

mnih2015.pdf

Sessional Grades
8/23/17 4:32 PM

NameA-1A-2A-3ProjectQuizClass ParticipationA-4+BonusTotal
Total100100100100100350
Weight77.57.52053
Aqsa70805075600134
Huniya90909085702143
Dawood951009595851248
Taimoor951009595602247
Warfana9595080800135
Amina951009595901248

Neural Networks Book
8/18/17 8:23 PM

This is a real useful book for building strong foundations in neural networks. We have covered chapter 2 and chapter 6 of the book.

\\172.30.10.2\FacultyShare\Fayyaz ul Amir Afsar Dr\CIS621 Machine Learning\Books\Laurene_Fausett_-_Fundamentals_of_neural_networks.PDF

-F

Project Finishing Touches and upload
8/18/17 8:18 PM

Dear Students,

All of you did really well in your projects. Here are a few minor things left in your projects. I would like you to cover them and upload your final project before 0900HRS on Wednesday, August 22, 2017 so that I can submit your final project grades. 

  • Neural Style Transfer: Apply Neural Style Transfer for 10 paintings by Pakistani artists on 10 images of your choice.
  • Visual Object Recognition: Try removing the delay in the system and make a short video recording of your system in action so we can show it off to others.
  • OCR: Calculate the accuracy of the OCR system for printed text using a few documents for which the original text is also available.
  • Sentiment Analysis: Try downloading a larger data set of tweets for analysis.
  • Hemometer: Aqsa -- Normalization and showing the images to a doctor to identify whether the person has anemia or not. Amina -- Plot the leave one out cross-validation scores (so we can see why the AUC-PR is low).

Submission: All of you are to upload your class project data to piazza via private message to the instructor as follows:

Make a single zipped file for your project and it should contain three folders:

  1. Data -- contains any and all data used in your project together with a readme.txt file explaining what the data files contain and how to use them. If your data set is large (videos!), you can give it to me via a flash disk.
  2. Code -- contains any and all code used in your project together with a readme.txt file explaining how to get your code to run, any dependencies and installation requirements that it may have. The code should have 
  3. Documentation -- contains any and all documents that you have developed for your project such as presentations containing proper references to all relevant documents. You can also upload papers relevant to your projects.
Presentations time
8/17/17 3:05 PM

We shall have our presentations starting at 820am in B-215. Please be on time.

Each student shall have ~8 minute presentation, ~ 2 minutes Q/A session and ~5 minutes demo.

-F

Reinforcement Learning has been added to class homepage under Resources
8/16/17 5:18 PM

The teaching staff has posted a new lecture notes resource.

Title: Reinforcement Learning
http://www.piazza.com/class_profile/get_resource/j4k7qqfhjfl5fd/j6ezfxwz1585bo

Lecture date: Aug 16, 2017

You can view it on the course page: https://piazza.com/pieas.edu.pk/summer2017/cis530/resources

Probability axioms
8/16/17 5:16 PM

We covered 3 basic rules of probability theory. I summarize them below:

  • The probability is always [0,1], i.e., 0p(A)1
  • If two events are independent then the probability of them happening together is the product of their individual probability values, i.e., p(A,B)=p(AB)=p(A)p(B)
  • If two events cannot happen together, then their probability that either of them happens is the sum of their individual probability values. p(AB)=p(A)+p(B). In case of conditional probability, i.e.,p(A|B)=p(A,B)/p(B).

Staff Office Hours
NameOffice Hours
Dr. Fayyaz ul Amir Afsar Minhas
When?
Where?

Homework

Homework Solutions

Lecture Notes

Lecture Notes
Lecture Date