Abstract
Recent authors have investigated the use of manifolds and Lie group methods for independent component analysis (ICA), including the Stiefel and the Grassmann manifolds and the orthogonal group O(n). In this paper we introduce a new class of manifold, the generalized flag manifold, which is suitable for independent subspace analysis. The generalized flag manifold is a set of subspaces which are orthogonal to each other, and includes the Stiefel and the Grassmann manifolds as special cases. We describe how the independent subspace analysis problem can be tackled as an optimization on the generalized flag manifold. We propose a Riemannian optimization method on the generalized flag manifold by adapting an existing geodesic formula for the Stiefel manifold, and present a new learning algorithm for independent subspace analysis based on this approach. Experiments confirm the effectiveness of our method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Absil, P.-A., Mahony, R., Sepulchre, R.: Riemannian geometry of Grassmann manifolds with a view on algorithmic computation. Acta Applicandae Mathematicae 80(2), 199–220 (2004)
Amari, S.: Natural gradient works efficiently in Learning. Neural Computation 10, 251–276 (1998)
Edelman, A., Arias, T.A., Smith, S.T.: The Geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications 20(2), 303–353 (1998)
Fiori, S.: Quasi-Geodesic Neural Learning Algorithms over the Orthogonal Group: A Tutorial. Journal of Machine Learning Research 6, 743–781 (2005)
Gallot, S., Hulin, D., Lafontaine, J.: Riemannian Geometry. Springer, Heidelberg (1990)
Helmke, U., Moore, J.B.: Optimization and dynamical systems. Springer, Heidelberg (1994)
Hyvärinen, A., Hoyer, P.O.: Emergence of phase and shift invariant features by decomposition of natural images into independent feature subspaces. Neural Computation 12(7), 1705–1720 (2000)
Nishimori, Y.: Learning Algorithm for Independent Component Analysis by Geodesic Flows on Orthogonal Group. In: Proceedings of International Joint Conference on Neural Networks (IJCNN 1999), vol. 2, pp. 1625–1647 (1999)
Nishimori, Y., Akaho, S.: Learning Algorithms Utilizing Quasi-Geodesic Flows on the Stiefel Manifold. Neurocomputing 67, 106–135 (2005)
Plumbley, M.D.: Algorithms for non-negative independent component analysis. IEEE Transactions on Neural Networks 14(3), 534–543 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nishimori, Y., Akaho, S., Plumbley, M.D. (2006). Riemannian Optimization Method on the Flag Manifold for Independent Subspace Analysis. In: Rosca, J., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2006. Lecture Notes in Computer Science, vol 3889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11679363_37
Download citation
DOI: https://doi.org/10.1007/11679363_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32630-4
Online ISBN: 978-3-540-32631-1
eBook Packages: Computer ScienceComputer Science (R0)