Natural gradient works efficiently in learning
Neural Computation
The Geometry of Algorithms with Orthogonality Constraints
SIAM Journal on Matrix Analysis and Applications
Natural Conjugate Gradient in Variational Inference
Neural Information Processing
Riemannian optimization method on the flag manifold for independent subspace analysis
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Bidirectional relation between CMA evolution strategies and natural evolution strategies
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Separation theorem for independent subspace analysis and its consequences
Pattern Recognition
Hi-index | 0.03 |
We study the problem of complex-valued independent subspace analysis (ISA). We introduce complex flag manifolds to tackle this problem, and, based on Riemannian geometry, propose the natural conjugate gradient method on this class of manifolds. Numerical experiments demonstrate that the natural conjugate gradient method yields better convergence compared to the natural gradient geodesic search method.