In this lecture, Prof. Winston discusses BLANK and modern breakthroughs in neural net research.

Lecture 12b: Deep Neural Nets

In this video, Prof. Winston introduces neural nets and back propagation.

Lecture 12a: Neural Nets

This mega-recitation covers Problem 1 from Quiz 2, Fall 2007.  We start with a minimax search of the game tree, and then work an example using alpha-beta pruning.  We also discuss static evaluation and progressive deepening (Problem 1-C, Fall 2008 Quiz 2).

Mega-Recitation 3: Games, Minimax, Alpha-Beta

This mega-recitation covers a question from the Fall 2007 final exam, in which we teach a robot how to identify a table lamp.  Given a starting model, we identify a heuristic and adjust the model for each example; examples can be hits or near misses.

Mega-Recitation 7: Near Misses, Arch Learning

We start by discussing what a support vector is, using two-dimensional graphs as an example.  We work Problem 1 of Quiz 4, Fall 2008: identifying support vectors, describing the classifier, and using a kernel function to project points into a new space.

Mega-Recitation 5: Support Vector Machines

This mega-recitation covers the boosting problem from Quiz 4, Fall 2009.  We determine which classifiers to use, then perform three rounds of boosting, adjusting the weights in each round.  This gives us an expression for the final classifier.

Mega-Recitation 6: Boosting

We begin by discussing neural net formulas, including the sigmoid and performance functions and their derivatives.  We then work Problem 2 of Quiz 3, Fall 2008, which includes running one step of back propagation and matching neural nets with classifiers.

Mega-Recitation 4: Neural Nets

This mega-recitation covers Problem 2 from Quiz 1, Fall 2008.  We start with depth-first search and breadth-first search, using a goal tree in each case.  We then discuss branch and bound and A*, and why they give different answers in this problem.

Mega-Recitation 2: Basic Search, Optimal Search

In this mega-recitation, we cover Problem 1 from Quiz 1, Fall 2009.  We begin with the rules and assertions, then spend most of our time on backward chaining and drawing the goal tree for Part A.  We end with a brief discussion of forward chaining.

Mega-Recitation 1: Rule-Based Systems

This lecture begins with a brief discussion of cross-modal coupling.  Prof. Winston then reviews big ideas of the course, suggests possible next courses, and demonstrates how a story can be understood from multiple points of view at a conceptual level.

Lecture 23: Model Merging, Cross-Modal Coupling, Course Summary

 Artificial Intelligence

This lecture covers a symbolic integration program from the early days of AI.  We use safe and heuristic transformations to simplify the problem, and then consider broader questions of how much knowledge is involved, and how the knowledge is represented.

Lecture 2: Reasoning: Goal Trees and Problem Solving

This lecture covers algorithms for depth-first and breadth-first search, followed by several refinements: keeping track of nodes already considered, hill climbing, and beam search.  We end with a brief discussion of commonsense vs. reflective knowledge.

Lecture 4: Search: Depth-First, Hill Climbing, Beam

How do we model neurons?  In the neural net problem, we want a set of weights that makes the actual output match the desired output.  We use a simple neural net to work out the back propagation algorithm, and show that it is a local computation.

Lecture 12: Learning: Neural Nets, Back Propagation

This lecture explores genetic algorithms at a conceptual level.  We consider three approaches to how a population evolves towards desirable traits, ending with ranks of both fitness and diversity.  We briefly discuss how this space is rich with solutions.

Lecture 13: Learning: Genetic Algorithms

This lecture covers strategies for finding the shortest path.  We discuss branch and bound, which can be refined by using an extended list or an admissible heuristic, or both (known as A*).  We end with an example where the heuristic must be consistent.

Lecture 5: Search: Optimal, Branch and Bound, A*

This lecture begins with a high-level view of learning, then covers nearest neighbors using several graphical examples.  We then discuss how to learn motor skills such as bouncing a tennis ball, and consider the effects of sleep deprivation.

Lecture 10: Introduction to Learning, Nearest Neighbors

In this lecture, we consider strategies for adversarial games such as chess.  We discuss the minimax algorithm, and how alpha-beta pruning improves its efficiency.  We then examine progressive deepening, which ensures that some answer is always available.

Lecture 6: Search: Games, Minimax, and Alpha-Beta

Can multiple weak classifiers be used to make a strong one?  We examine the boosting algorithm, which adjusts the weight of each classifier, and work through the math.  We end with how boosting doesn't seem to overfit, and mention some applications.

Lecture 17: Learning: Boosting

To determine whether three blocks form an arch, we use a model which evolves through examples and near misses; this is an example of one-shot learning.  We also discuss other aspects of how students learn, and how to package your ideas better.

Lecture 15: Learning: Near Misses, Felicity Conditions

We begin this lecture with basic probability concepts, and then discuss belief nets, which capture causal relationships between events and allow us to specify the model more simply.  We can then use the chain rule to calculate the joint probability table.

Lecture 21: Probabilistic Inference I

In this lecture, we consider cognitive architectures, including General Problem Solver, SOAR, Emotion Machine, Subsumption, and Genesis.  Each is based on a different hypothesis about human intelligence, such as the importance of language and stories.

Lecture 19: Architectures: GPS, SOAR, Subsumption, Society of Mind

We begin with a review of inference nets, then discuss how to use experimental data to develop a model, which can be used to perform simulations.  If we have two competing models, we can use Bayes' rule to determine which is more likely to be accurate.

Lecture 22: Probabilistic Inference II

Why do "cats" and "dogs" end with different plural sounds, and how do we learn this?  We can represent this problem in terms of distinctive features, and then generalize.  We end this lecture with a brief discussion of how to approach AI problems.

Lecture 14: Learning: Sparse Spaces, Phonology

What is this?
1 quote, 3 ideas & 1 question from a carefully curated podcast episode.
Every Monday & Wednesday.

Want a 3rd insight and episode every week? Email me at curation@owltail.com.

OwlTail

OwlTail 1-3-1

The best podcast episodes on romantic relationships. Episodes talk about the 5 love languages, intimacy, and the taboo topics of sexual desires and infidelity. This topic is a deep dive into the science and complexities that face us in our relationships with others. Add episodes you're interested into your queue below!