CS 540 - Fall 2015 (Shavlik©), Midterm Topics 6/6/2018 Today’s Topics Some Exam-Review Notes Midterm is Tuesday 10/25, 4:00-5:15 pm in Van Vleck B130 One 8.5x11 inch page of notes (both sides), simple calculator (log’s and arithmetic), no accessing internet! 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics

If you don’t recognize this … Topics Covered So Far If you don’t recognize this … Some AI History and Philosophy (more final class) Learning from Labeled Data (more ahead) Reasoning from Specific Cases (k-NN) Searching for Solutions (many variants, common core) Projecting Possible Futures (eg, game-playing) Simulating ‘Problem Solving’ Done by the Biophysical World (SA, GA, and [later] neural nets) Reasoning Probabilistically (just Ch 13 & Lec 13) 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics

Detailed List of Course Topics Learning from labeled data Experimental methodologies for choosing parameter settings and estimating future accuracy Decision trees and random forests Probabilistic models, nearest-neighbor methods Genetic algorithms Neural networks Support vector machines Reinforcement learning (if time permits) Searching for solutions Heuristically finding shortest paths Algorithms for playing games like chess Simulated annealing Reasoning probabilistically Probabilistic inference (just the basics so far) Bayes' rule Bayesian networks   Reasoning from concrete cases Cased-based reasoning Nearest-neighbor algorithm Reasoning logically First-order predicate calculus Representing domain knowledge using mathematical logic Logical inference Problem-solving methods based on the biophysical world Genetic algorithms Simulated annealing Neural networks Philosophical aspects Turing test Searle's Chinese Room thought experiment The coming singularity Strong vs. weak AI Societal impact of AI 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics

CS 540 - Fall 2015 (Shavlik©), Midterm Topics Some Key Ideas ML: Easy to fit training examples, hard to generalize to future examples (never use TESTSET to choose model!) SEARCH: OPEN holds partial solutions, how to choose which partial sol’n to extend? (CLOSED prevents infinite loops) PROB: Fill JOINT Prob table (explicitly or implicitly) simply by COUNTING data, then can answer all kinds of questions 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics

CS 540 - Fall 2015 (Shavlik©), Midterm Topics Exam Advice Mix of ‘straightforward’ concrete problem solving and brief discussion of important AI issues and techniques Problem solving graded ‘precisely’ Discussion graded ‘leniently’ Previous exams great training and tune sets (hence soln’s not posted for old exams, ie so they can be used as TUNE sets) 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics

CS 540 - Fall 2015 (Shavlik©), Midterm Topics Exam Advice (cont.) Think before you write Briefly discuss important points Don’t do a ‘core dump’ Some questions are open-ended so budget your time wisely Always say SOMETHING 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics

CS 540 - Fall 2015 (Shavlik©), Midterm Topics Fall 2015 Midterm http://pages.cs.wisc.edu/~shavlik/cs540/old-exams/midterm-fall15.pdf 10/20/15 CS 540 - Fall 2015 (Shavlik©), Midterm Topics