2 Rectangular Matrices

[[lecture-main-topic-data]]

We are particularly interested in the $d \times m$ matrix

G \sim N (0, 1)^{\otimes d \times m}

Concepts

File	status	type	Lectures
bound for the size of an epsilon packing	complete	🧮	Random Matrix Lecture 04
dimension requirements for gaussian random matrix to be a restricted isometry with high probability	complete	🧮	Random Matrix Lecture 05
distinguishing is equivalent to double nullspace property	complete	🧮	Random Matrix Lecture 05
epsilon net	complete	💡	Random Matrix Lecture 04
epsilon net restricted inner product bounds the operator norm	in progress	🧮	Random Matrix Lecture 04
epsilon packing	complete	💡	Random Matrix Lecture 04
gaussian random matrix transform vectors into gaussian random vectors	complete	🧮	Random Matrix Lecture 02
high probability bound for operator norm of difference for Gaussian covariance matrix	complete	🧮	Random Matrix Lecture 04 Random Matrix Lecture 05
high probability bound on singular values of gaussian random matrix	complete	🧮	Random Matrix Lecture 04
maximal epsilon packing is also a net	complete	🧮	Random Matrix Lecture 04
nullspace property	in progress		Random Matrix Lecture 05
random matrix	in progress	💡	Random Matrix Lecture 02 Random Matrix Lecture 04 Random Matrix Lecture 06
restricted inner product	in progress	💡	Random Matrix Lecture 04
restricted isometry implies nullspace property	complete	🧮	Random Matrix Lecture 05
restricted isometry property	complete	💡	Random Matrix Lecture 05
sparsity	complete	💡	Random Matrix Lecture 05
we can find an epsilon net with the bound for an epsilon packing	complete	🧮	Random Matrix Lecture 04

File

Created 2025-09-04 ֍ Last Modified 2025-09-11