Heuristics
One word, taught differently in 2 fields. Each use is given apart.
In AI & ML
Rules of thumb or tricks used by a computer program to guide decision-making and problem-solving.
In Mathematics
A rule of thumb or simplified model that is not strictly correct but provides useful insights or approximations.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Problem-solving2Search problem2Adaptive markets hypothesis1Computer program1Dual processing1Expert systems1Independence1Optimization1
Opens up
Concepts that name this one as a prerequisite.
In AI & ML
5Each in their own terms, from the easiest level.
Tamar Szabó Gendler
Fast and frugal tools for dealing with the complexity of the world when faced with time-sensitive decision-making tasks.Andrew Lo
Mental shortcuts or rules of thumb that individuals develop over time through experience to simplify decision-making.Pieter Abbeel
A function that estimates how close a state is to a goal for a particular search problem.Patrick Winston
Strategies or rules of thumb used to guide problem-solving or knowledge engineering.
In Mathematics
1Lectures that assume it
11- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Thinking, Fast and Slow: Heuristics, Biases, and Judgment Under Uncertainty
- Nobel Lecture: From Cashews to Nudges — The Evolution of Behavioral Economics
- Learning: Near Misses and Felicity Conditions in AI
- On the Measure of Intelligence: Program Synthesis and Fluid Abstraction
- Search: Optimal, Branch and Bound, A*
- Evolution, Emotion, and Reason: Evolution and Rationality
- Speculative Parallelism & Leiserchess
- Query Optimizer Implementation 1
- Search: Depth-First, Hill Climbing, Beam Search
- Philosophical Puzzles
Connections
26The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Search problem
- Adaptive markets hypothesis
- Computer program
- Admissible heuristic
- Attribute substitution
- Beam search
Show 2 moreShow fewer
Lectures18
- A* Search and Heuristics
- Computer Science: Hardware, Software, and Heuristics
- Inclusion-Exclusion
- Empirically-informed Responses
- Reasoning: Goal Trees and Rule-Based Expert Systems
- Efficient Markets III & Course Summary
Show 12 moreShow fewer
- Efficient Markets II
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Thinking, Fast and Slow: Heuristics, Biases, and Judgment Under Uncertainty
- Nobel Lecture: From Cashews to Nudges — The Evolution of Behavioral Economics
- Learning: Near Misses and Felicity Conditions in AI
- On the Measure of Intelligence: Program Synthesis and Fluid Abstraction
- Search: Optimal, Branch and Bound, A*
- Evolution, Emotion, and Reason: Evolution and Rationality
- Speculative Parallelism & Leiserchess
- Query Optimizer Implementation 1
- Search: Depth-First, Hill Climbing, Beam Search
- Philosophical Puzzles