Constraints
One word, taught differently in 3 fields. Each use is given apart.
In AI & ML
Linear equations or inequalities that restrict the possible values of the variables in an optimization problem.
In Theory & Algos
Conditions or clauses applied to specific variables that must be satisfied by a truth assignment.
In Literature
Conditions on well-formedness that output candidates are evaluated against in optimality theory.
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.
Opens up
Concepts that name this one as a prerequisite.
In AI & ML
2Each in their own terms, from the easiest level.
Patrick Winston
A constraint C is a limit on variable values, typically pairs of variable values.
In Theory & Algos
1In Literature
1Lectures that assume it
23The first 12 are shown.
- Maxima and Minima
- The Anatomy of an Optimization Problem
- System Dynamics: Predator-Prey Models with Carrying Capacity
- The Lagrangian, Dual Function & Slater's Condition
- The Future of Programming
- Symbolic Execution
- Commodity Models
- Sequential Convex Programming
- Saddle-Point Interpretation, KKT Conditions & Perturbation
- Constraint Satisfaction Problems (CSPs) Part 1/2
- Learning: Sparse Spaces and Phonological Generalization
- Advanced Topics and Applications
Connections
37The lectures that define it or assume it, and the concepts next to it.
Concepts10
Lectures27
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Constraint Satisfaction Problems
- Constraints: Search and Domain Reduction
- Phonology, Part 2
- Maxima and Minima
- The Anatomy of an Optimization Problem
Show 21 moreShow fewer
- System Dynamics: Predator-Prey Models with Carrying Capacity
- The Lagrangian, Dual Function & Slater's Condition
- The Future of Programming
- Symbolic Execution
- Commodity Models
- Sequential Convex Programming
- Saddle-Point Interpretation, KKT Conditions & Perturbation
- Constraint Satisfaction Problems (CSPs) Part 1/2
- Learning: Sparse Spaces and Phonological Generalization
- Advanced Topics and Applications
- Introduction to Linear Programming
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Constraint Satisfaction Problems (CSPs) Part 2/2
- Trajectory Optimization II
- Hybrid Trajectory Optimization
- Mixed-discrete (combinatorial) and continuous optimization
- Applications of Optimization in Machine Learning and Engineering
- Phonology, Part 3
- Algorithms for Life: AI and Operations Research Transforming Healthcare, Education, and Agriculture
- Model Merging, Cross-Modal Coupling, and Course Summary
- Dynamic Programming: Dance Dance Revolution (MIT 6.006 Recitation 22)