Multiplicative Algorithm for Orthgonal Groups and Independent Component Analysis
| dc.creator | Akuzawa, Toshinao | |
| dc.date | 2000-01-07 | |
| dc.date.accessioned | 2026-07-25T23:54:56Z | |
| dc.description | The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the restriction to the orthogonal groups makes the problem somewhat complicated, an explicit expression for the amount of individual jumps is obtained. This algorithm is exactly second-order-convergent. The global instability inherent in the Newton method is remedied by a Levenberg-Marquardt-type variation. The method thus constructed can readily be applied to the independent component analysis. Its remarkable performance is illustrated by a numerical simulation. | |
| dc.description | 11 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0001004 | |
| dc.identifier | http://arxiv.org/abs/cs/0001004 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/102439 | |
| dc.subject | Machine Learning | |
| dc.subject | G.1.6 | |
| dc.title | Multiplicative Algorithm for Orthgonal Groups and Independent Component Analysis | |
| dc.type | text |