Sign inSign in
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.
as Russ Tedrake defines itMITThe wording closest to all 6 definitions
Watch it explained

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

5

Each in their own terms, from the easiest level.

  • Russ Tedrake

    MIT · Undergraduate

    The exponential growth of computational complexity and mesh nodes needed in high dimensions.
    • 2:39Trajectory Optimization I
  • Andrej Karpathy

    Undergraduate

    The exponential growth of the number of parameters and data sparsity as the context length increases in n-gram models.
    • 1:04Building makemore Part 2: Multi-Layer Perceptron Language Models (Bengio et al. 2003)
  • Fei-Fei Li, Justin Johnson & Serena Yeung

    Stanford University · Undergraduate

    The problem that densely covering a high-dimensional space requires a number of training examples that grows exponentially with the dimension.
    • 40:41Image Classification
  • Sergey Levine

    UC Berkeley · Undergraduate

    The problem that the number of entries needed in a tabular representation grows exponentially with the dimension of the state space.
    • 1:24Exploration of fundamental concepts in deep reinforcement learning
  • Nikola Kovachki

    UT Austin · Graduate

    The exponential scaling of computational complexity or parameters required as dimension increases.
    • 11:08Operator Learning in Theory and Practice

Connections

11

The lectures that define it or assume it, and the concepts next to it.

5 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.