| Abstract | We present a tuning-free and computationally simple solution for multivariate reduced rank regression, based on the recently introduced signal subspace matching (SSM) metric. Unlike the existing solutions, which solve simultaneously for the rank and the value of the coefficient matrix, our solution decouples the two tasks. First, the rank of the coefficient matrix is determined using the SSM metric, and then the coefficient matrix is determined by ordinary least squares. We prove the consistency of the solution for the high signal-to-noise-ratio limit, and also for the large-sample limit, conditioned on the noise being white. Experimental results, demonstrating the performance of the SSM solution, are included. |
