Learning a set of directions


Wouter M. Koolen, Jiazhong Nie, Manfred Warmuth ;
Proceedings of the 26th Annual Conference on Learning Theory, PMLR 30:851-866, 2013.


Assume our data consists of unit vectors (directions) and we are to find a small orthogonal set of the “the most important directions” summarizing the data. We develop online algorithms for this type of problem. The techniques used are similar to Principal Component Analysis which finds the most important small rank subspace of the data.The new problem is significantly more complex since the online algorithm maintains uncertainty over the most relevant subspace as well as directional information.

Related Material