On the computational and statistical complexity of over-parameterized matrix sensing

On the computational and statistical complexity of over-parameterized matrix sensing. We consider solving the low rank matrix sensing problem with Factorized Gradient Descend (FGD) method when the true rank is unknown and over-specified, which we refer to as over-parameterized matrix sensing.