Note that for a given i, the matrix i is of (at most) rank-1.
the solution of A can be viewed as the linear combination of a sequence of rank-1 matrices, where each rank-1 matrix is defined by distributional representation v i and the weight difference between the weight of true label w y i and the "expected" weight m η i,m w m .