Skip to main content
AI-A: Fundamental Issues
- Overview of AI problems, Examples of successful recent AI applications
- Definitions of agents with examples (e.g., reactive, deliberative)
- What is intelligent behavior?
- The Turing test and its flaws
- Multimodal input and output
- Simulation of intelligent behavior
- Rational versus non-rational reasoning
- Problem characteristics
- Fully versus partially observable
- Single versus multi-agent
- Deterministic versus stochastic
- Static versus dynamic
- Discrete versus continuous
- Nature of agents
- Autonomous, semi-autonomous, mixed-initiative autonomy
- Reflexive, goal-based, and utility-based
- Decision making under uncertainty and with incomplete information
- The importance of perception and environmental interactions
- Learning-based agents
- Embodied agents
- sensors, dynamics, effectors
- AI Applications, growth, and Impact (economic, societal, ethics)
-
-
AI-B: Search
- State space representation of a problem
- Specifying states, goals, and operators
- Factoring states into representations (hypothesis spaces)
- Problem solving by graph search
- e.g., Graphs as a space, and tree traversals as exploration of that space
- Dynamic construction of the graph (you’re not given it upfront)
- Uninformed graph search for problem solving
- Breadth-first search
- Depth-first search
- With iterative deepening
- Uniform cost search
- Heuristic graph search for problem solving
- Heuristic construction and admissibility
- Hill-climbing
- Local minima and the search landscape
- Local vs global solutions
- Greedy best-first search
- A* search
- Space and time complexities of graph search algorithms
AI-C: Fundamental Knowledge Representation and Reasoning
- Types of representations
- Symbolic, logical
- Creating a representation from a natural language problem statement
- Learned subsymbolic representations
- Graphical models (e.g., naive Bayes, Bayes net)
- Review of probabilistic reasoning, Bayes theorem (cross-reference with DS/Discrete Probability)
- Bayesian reasoning
- Bayesian inference
AI-D: Machine Learning
- Definition and examples of a broad variety of machine learning tasks
- Supervised learning
- Classification
- Regression
- Reinforcement learning
- Unsupervised learning
- Clustering
- Fundamental ideas:
- no free lunch
- undecidability
- sources of error in machine learning
- Simple statistical-based supervised learning such as Naive Bayes, Decision trees
- Focus on how they work without going into mathematical or optimization details; enough to understand and use existing implementations correctly
- The overfitting problem and controlling solution complexity (regularization, pruning – intuition only)
- The bias (underfitting) – variance (overfitting) tradeoff
- Working with Data
- Data preprocessing
- Importance and pitfalls of
- Handling missing values (imputing, flag-as-missing)
- Implications of imputing vs flag-as-missing
- Encoding categorical variables, encoding real-valued data
- Normalization/standardization
- Emphasis on real data, not textbook examples
- Representations
- Hypothesis spaces and complexity
- Simple basis feature expansion, such as squaring univariate features
- Learned feature representations
- Machine learning evaluation
- Separation of train, validation, and test sets
- Performance metrics for classifiers
- Estimation of test performance on held-out data
- Tuning the parameters of a machine learning model with a validation set
- Importance of understanding what your model is actually doing, where its pitfalls/shortcomings are, and the implications of its decisions
- Basic neural networks
- Fundamentals of understanding how neural networks work and their training process, without details of the calculations
- Ethics for Machine Learning
- Focus on real data, real scenarios, and case studies.
- Dataset/algorithmic/evaluation bias