Approximate joint diagonalization using a natural gradient approach

Arie Yeredor, Andreas Ziehe, Klaus Muller

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a "natural gradient"-type multiplicative update of the diagonalizing matrix, complemented by step-size optimization at each iteration. The advantages of the new algorithm over existing non-unitary AJD algorithms are in the ability to accommodate non-positive-definite matrices (compared to Pham's algorithm), in the low computational load per iteration (compared to Yeredor's AC-DC algorithm), and in the theoretically guaranteed convergence to a true (possibly local) minimum (compared to Ziehe et al.'s FFDiag algorithm).

Original languageEnglish
Pages (from-to)89-96
Number of pages8
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3195
Publication statusPublished - 2004 Dec 1
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this