CompSci 570
Artificial Intelligence
Major Topics Covered
Algorithms and representations for artificial intelligence
- NP-Hardness and Satisfiability
- Review of NP-Hardness
- fast Solvers and phase transitions
- approximation
- Some NP-hard AI problems
- Reasoning under uncertainty
- Probability review
- Bayes nets and Markov random fields
- HMMs and query planing
- Introduction to machine learning
- Regression and Classification
- Unsupervised learning
- Neural/deep learning
- Decisions
- MDPs, POMDPs, reinforcement learning, deep RL
- Observation planning with POMDPs
- Game theory and linear programming
- Query planning as a game