A Proximal Approach to IVA-G with Convergence Guarantees
| dc.contributor.author | Cosserat, Clément | |
| dc.contributor.author | Gabrielson, Ben | |
| dc.contributor.author | Chouzenoux, Emilie | |
| dc.contributor.author | Pesquet, Jean-Christophe | |
| dc.contributor.author | Adali, Tulay | |
| dc.date.accessioned | 2023-07-07T14:29:26Z | |
| dc.date.available | 2023-07-07T14:29:26Z | |
| dc.date.issued | 2023-05-05 | |
| dc.description | 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Rhodes Island, Greece, 04-10 June 2023 | en_US |
| dc.description.abstract | Independent vector analysis (IVA) generalizes independent component analysis (ICA) to multiple datasets, and when used with a multivariate Gaussian model (IVA-G), provides a powerful tool for joint analysis of multiple datasets in an array of applications. While IVA-G enjoys uniqueness guarantees, the current solution to the problem exhibits significant variability across runs necessitating the use of a scheme for selecting the most consistent one, which is costly. In this paper, we present a penalized maximum-likelihood framework for the problem, which enables us to derive a non-convex cost function that depends on the precision matrices of the source component vectors, the main mechanism by which IVA-G leverages correlation across the datasets. By adding a quadratic regularization, a block-coordinate proximal algorithm is shown to offer a suitable solution to this minimization problem. The proposed method also provides convergence guarantees that are lacking in other state-of-the-art approaches to the problem. This also allows us to obtain overall slightly better performance, and in particular, we show that our method yields better estimation in average than the current IVA-G algorithm for various source numbers, datasets, and degrees of correlation across the data. | en_US |
| dc.description.sponsorship | E.C. acknowledges support from the ERC Starting Grant MAJORIS ERC-2019-STG-850925. Part of the work of J.-C. P. was supported by the ANR Chair in AI, BRIDGEABLE. This work was also supported in part by NSF-NCS 1631838, and NIH grants R01 MH118695, R01 MH123610, R01 AG073949. | en_US |
| dc.description.uri | https://ieeexplore.ieee.org/document/10096421 | en_US |
| dc.format.extent | 5 pages | en_US |
| dc.genre | conference papers and proceedings | en_US |
| dc.genre | postprints | en_US |
| dc.identifier | doi:10.13016/m2olmd-ybkp | |
| dc.identifier.citation | C. Cosserat, B. Gabrielson, E. Chouzenoux, J. -C. Pesquet and T. Adali, "A Proximal Approach to IVA-G with Convergence Guarantees," ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Rhodes Island, Greece, 2023, pp. 1-5, doi: 10.1109/ICASSP49357.2023.10096421. | en_US |
| dc.identifier.uri | https://doi.org/10.1109/ICASSP49357.2023.10096421 | |
| dc.identifier.uri | http://hdl.handle.net/11603/28453 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | IEEE | en_US |
| dc.relation.isAvailableAt | The University of Maryland, Baltimore County (UMBC) | |
| dc.relation.ispartof | UMBC Computer Science and Electrical Engineering Department Collection | |
| dc.relation.ispartof | UMBC Faculty Collection | |
| dc.relation.ispartof | UMBC Student Collection | |
| dc.rights | © 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
| dc.title | A Proximal Approach to IVA-G with Convergence Guarantees | en_US |
| dc.type | Text | en_US |
| dcterms.creator | https://orcid.org/0000-0001-9217-6641 | en_US |
| dcterms.creator | https://orcid.org/0000-0003-0594-2796 | en_US |