Sign inSign in
ConceptEngineering

Low rank approximation

Getting an approximation of a full-rank matrix that is low rank to allow fast multiplications and efficient computations.
as Stephen Boyd defines itStanford UniversityThe wording closest to all 3 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Stephen Boyd

    Stanford University · Undergraduate

    Finding a matrix of lower rank that approximates a given matrix by minimizing a specific norm of the difference.
    • 15:36Applications of SVD, Controllability, and State Transfer in Electrical Engineering
  • Song Han

    Stanford University · Undergraduate

    Low rank approximation breaks a convolution or fully connected layer into smaller matrices or layers to reduce computational complexity.
    • 22:43Efficient Methods and Hardware for Deep Learning

Connections

7

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

2 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.