ConceptAI & ML
Curse of dimensionality
The exponential growth in computational complexity and required nodes as the dimension of the state space increases in discretized value iteration.
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.
Lecturers
5Each in their own terms, from the easiest level.
Russ Tedrake
The exponential growth of computational complexity and mesh nodes needed in high dimensions.Andrej Karpathy
The exponential growth of the number of parameters and data sparsity as the context length increases in n-gram models.Fei-Fei Li, Justin Johnson & Serena Yeung
The problem that densely covering a high-dimensional space requires a number of training examples that grows exponentially with the dimension.Sergey Levine
The problem that the number of entries needed in a tabular representation grows exponentially with the dimension of the state space.Nikola Kovachki
The exponential scaling of computational complexity or parameters required as dimension increases.
Connections
11The lectures that define it or assume it, and the concepts next to it.