Optimization on the Orthogonal Group for Independent Component Analysis
نویسندگان
چکیده
This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the proposed optimization method is to combine the global search of a good initial condition with a gradient-descent algorithm. This new ICA algorithm performs faster than the RADICAL algorithm (based on Jacobi rotations) while still preserving, and even enhancing, the strong robustness properties that result from its contrast.
منابع مشابه
Riemannian Optimization Method on the Flag Manifold for Independent Subspace Analysis
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 ...
متن کاملNon-negative Independent Component Analysis Algorithm Based on 2D Givens Rotations and a Newton Optimization
In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-linear cost function optimization over the special orthogonal matrix group SO(n). Using Givens rotations and Newton optimization, we developed an effective axis pair rotation method for Non-negative ICA. The performance of the pro...
متن کاملDescent methods for optimization on homogeneous manifolds
preprint numerics no. 1/2007 norwegian university of science and technology trondheim, norway 1 In this article we present a framework for line search methods for optimization on smooth homogeneous manifolds, with particular emphasis to the Lie group of real orthogonal matrices. We propose strategies of univariate descent (UVD) methods. The advantages of this approach are that the optimization ...
متن کاملQuasi-Geodesic Neural Learning Algorithms Over the Orthogonal Group: A Tutorial
The aim of this contribution is to present a tutorial on learning algorithms for a single neural layer whose connection matrix belongs to the orthogonal group. The algorithms exploit geodesics appropriately connected as piece-wise approximate integrals of the exact differential learning equation. The considered learning equations essentially arise from the Riemannian-gradient-based optimization...
متن کاملApplication of orthogonal array technique and particle swarm optimization approach in surface roughness modification when face milling AISI1045 steel parts
Face milling is an important and common machining operation because of its versatility and capability to produce various surfaces. Face milling is a machining process of removing material by the relative motion between a work piece and rotating cutter with multiple cutting edges. It is an interrupted cutting operation in which the teeth of the milling cutter enter and exit the work piece during...
متن کامل