Course106102220102 lectures
Artificial Intelligence: Foundations and Algorithms
Prof. Mausam · IIT Delhi
About
The course introduces the variety of concepts in the field of artificial intelligence. It discusses the philosophy of AI, and how to model a new problem as an AI problem. It describes a variety of models such as search, logic, Bayes nets, and MDPs, which can be used to model a new problem. It also teaches many first algorithms to solve each formulation. The course prepares a student to take a variety of focused, advanced courses in various subfields of AI.
INTENDED AUDIENCE : Undergraduate students in computer science PREREQUISITES : Data Structures, Probability
INDUSTRY SUPPORT : Most software companies
Lectures
Week 1
- Introduction: What to Expect from AI
- Introduction: History of AI from 40s - 90s
- Introduction: History of AI in the 90s
- Introduction: History of AI in NASA & DARPA(2000s)
- Introduction: The Present State of AI
- Introduction: Definition of AI Dictionary Meaning
- Introduction: Definition of AI Thinking VS Acting and Humanly VS Rationally
- Introduction: Definition of AI Rational Agent View of AI
- Introduction: Examples Tasks, Phases of AI & Course Plan
Week 2
- Uniform Search: Notion of a State
- Uniformed Search: Search Problem and Examples Part-2
- Uniformed Search: Basic Search Strategies Part-3
- Uniformed Search: Iterative Deepening DFS Part-4
- Uniformed Search: Bidirectional Search Part-5
Week 3
- Informed Search: Best First Search Part-1
- Informed Search: Greedy Best First Search and A* Search Part-2
- Informed Search: Analysis of A* Algorithm Part-3
- Informed Search Proof of optimality of A* Part-4
- Informed Search: Iterative Deepening A* and Depth First Branch & Bound Part-5
- Informed Search: Admissible Heuristics and Domain Relaxation Part-6
- Informed Search: Pattern Database Heuristics Part-7
Week 4
- Local Search: Satisfaction Vs Optimization Part-1
- Local Search: The Example of N-Queens Part-2
- Local Search: Hill Climbing Part-3
- Local Search: Drawbacks of Hill Climbing Part-4
- Local Search: of Hill Climbing With random Walk & Random Restart Part-5
- Local Search: Hill Climbing With Simulated Anealing Part-6
- Local Search: Local Beam Search and Genetic Algorithms Part-7
Week 5
- Adversarial Search : Minimax Algorithm for two player games
- Adversarial Search : An Example of Minimax Search
- Adversarial Search : Alpha Beta Pruning
- Adversarial Search : Analysis of Alpha Beta Pruning
- Adversarial Search : Cutting Off Search
- Adversarial Search : Horizon Effect, Game Databases & Other Ideas
- Adversarial Search: Summary and Other Games
Week 6
- Constraint Satisfaction Problems: Representation of the atomic state
- Constraint Satisfaction Problems: Map coloring and other examples of CSP
- Constraint Satisfaction Problems: Backtracking Search
- Constraint Satisfaction Problems: Variable and Value Ordering in Backtracking Search
- Constraint Satisfaction Problems: Inference for detecting failures early
- Constraint Satisfaction Problems: Exploiting problem structure
Week 7
- Logic in AI : Different Knowledge Representation systems - Part 1
- Logic in AI : Syntax - Part - 2
- Logic in AI : Semantics - Part - 3
- Logic in AI : Forward Chaining - Part 4
- Logic in AI : Resolution - Part - 5
- Logic in AI : Reduction to Satisfiability Problems - Part - 6
- Logic in AI : SAT Solvers : DPLL Algorithm - Part - 7
- Logic in AI : Sat Solvers: WalkSAT Algorithm - Part - 8
Week 8
- Uncertainty in AI: Motivation
- Uncertainty in AI: Basics of Probability
- Uncertainty in AI: Conditional Independence & Bayes Rule
- Bayesian Networks: Syntax
- Bayesian Networks: Factoriziation
- Bayesian Networks: Conditional Independences and d-Separation
- Bayesian Networks: Inference using Variable Elimination
- Bayesian Networks: Reducing 3-SAT to Bayes Net
Week 9
- Constraint Satisfaction Problems: Representation of the atomic state
- Constraint Satisfaction Problems: Map coloring and other examples of CSP
- Constraint Satisfaction Problems: Backtracking Search
- Constraint Satisfaction Problems: Variable and Value Ordering in Backtracking Search
- Constraint Satisfaction Problems: Inference for detecting failures early
- Constraint Satisfaction Problems: Exploiting problem structure
- Bayesian Networks: Rejection Sampling
- Bayesian Networks: Likelihood Weighting
- Bayesian Networks: MCMC with Gibbs Sampling
- Bayesian Networks: Maximum Likelihood Learning
- Bayesian Networks: Maximum a-Posteriori Learning
- Bayesian Networks: Bayesian Learning
- Bayesian Networks: Structure Learning and Expectation Maximization
- Introduction, Part 10: Agents and Environments
Week 10
- Decision Theory: Steps in Decision Theory
- Decision Theory: Non Deterministic Uncertainty
- Decision Theory: Probabilistic Uncertainty & Value of perfect information
- Decision Theory: Expected Utility vs Expected Value
- Markov Decision Processes: Definition
- Markov Decision Processes: An example of a Policy
- Markov Decision Processes: Policy Evaluation using system of linear equations
- Markov Decision Processes: Iterative Policy Evaluation
- Markov Decision Processes: Value Iteration
- Markov Decision Processes: Policy Iteration and Applications & Extensions of MDPs
Week 11
- Reinforcement Learning: Background
- Reinforcement Learning: Model-based Learning for policy evaluation (Passive Learning)
- Reinforcement Learning: Model-free Learning for policy evaluation (Passive Learning)
- Reinforcement Learning: TD Learning
- Reinforcement Learning: TD Learning and Computational Neuroscience
- Reinforcement Learning: Q Learning
- Reinforcement Learning: Exploration vs Exploitation Tradeoff
- Reinforcement Learning: Generalization in RL
Week 12
- Deep Learning : Perceptrons and Activation functions
- Deep Learning : Example of Handwritten digit recognition
- Deep Learning : Neural Layer as matrix operations
- Deep Learning : Differentiable loss function
- Deep Learning : Backpropagation through a computational graph
- Deep Learning : Thin Deep Vs Fat Shallow Networks
- Deep Learning : Convolutional Neural Networks
- Deep Learning : Deep Reinforcement Learning
- Ethics of AI : Humans vs Robots
- Ethics of AI : Robustness and Transparency of AI systems
- Ethics of AI : Data Bias and Fairness of AI systems
- Ethics of AI : Accountability, privacy and Human-AI interaction
- Wrapup
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IIT Delhi
- Department
- Computer Science and Engineering
- Teacher
- Prof. Mausam
- Level
- Undergraduate
- Language
- English
- Subjects
- Computer science, Engineering
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed
More like this
NPTEL101102090
Course
Elements of Mechanical Vibration
46 lectures · Source's player
NPTEL103102012
Course
Heterogeneous Catalysis and Catalytic Processes
40 lectures · Video
NPTEL103102016
Course
Interfacial Engineering
37 lectures · Video
NPTEL103102211
Course
Fluid Mechanics And Its Applications
66 lectures · Video
NPTEL105102176
Course
Fire Protection, Services and Maintenance Management of Building
56 lectures · Source's player
NPTEL105102195
Course
Sustainable Materials and Green Buildings
47 lectures · Source's player
NPTEL105102012
Course
Concrete Technology
42 lectures · Video
NPTEL105102088
Course
Civil Engineering - Building materials and Construction
41 lectures · Video
NPTEL105102159
Course
Water Management
40 lectures · Video
NPTEL105102160
Course
Geoenvironmental Engineering (Environmental Geotechnology); Landfills, Slurry Ponds & Contaminated Sites
42 lectures · Video
NPTEL105102175
Course
Energy Efficiency, Acoustics and Daylighting in Building
54 lectures · Video
NPTEL106102001
Course
AI for Earth Observation
55 lectures · Source's player