arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.01102cs.LGeess.SP
收藏

面向多模态数据融合的个性化耦合张量分解:唯一性与算法

Personalized Coupled Tensor Decomposition for Multimodal Data Fusion: Uniqueness and Algorithms

Université de Lorraine(洛林大学);CNRS(法国国家科学研究中心);CRAN(克兰研究所);University of Maryland Baltimore County(马里兰大学巴尔的摩分校)

Ricardo Augusto Borsoi, Konstantin Usevich, David Brie, Tülay Adali

AI总结:

针对多模态数据融合中数据集异质性与个性化信息的挑战,提出含公共和特有分量的个性化耦合张量分解框架,给出唯一性条件与两种求解算法,性能优于现有方法。

摘要:

耦合张量分解(CTDs)通过关联不同数据集的因子来实现数据融合。尽管已有多种CTD方法被提出,但现有研究尚未解决数据融合中的两类重要挑战:1)数据集通常具有异质性,构成同一现象的不同“视图”(多模态性);2)每个数据集可能包含个性化或数据集特有的信息,即不与其他数据集耦合的独特因子。针对这些挑战,本文提出一种个性化CTD框架。该框架构建了灵活的模型,将每个数据集表示为两个分量之和:一个分量通过多线性测量模型与公共张量关联,另一个为各数据集的特有分量。公共分量和特有分量均假设可进行帕拉迪克(polyadic)分解,该模型推广了多种现有CTD模型。本文给出了易于解释的分解特定唯一性和通用唯一性条件,这些条件利用了不同单数据集的单模唯一性以及测量模型的性质。本文提出两种计算公共分量和特有分量的算法:一种半代数算法和一种坐标下降优化方法。实验结果表明,与现有最优方法相比,所提框架具有更优的性能。

英文摘要:

Coupled tensor decompositions (CTDs) perform data fusion by linking factors from different datasets. Although many CTDs have been already proposed, current works do not address important challenges of data fusion, where: 1) the datasets are often heterogeneous, constituting different "views" of a given phenomena (multimodality); and 2) each dataset can contain personalized or dataset-specific information, constituting distinct factors that are not coupled with other datasets. In this work, we introduce a personalized CTD framework tackling these challenges. A flexible model is proposed where each dataset is represented as the sum of two components, one related to a common tensor through a multilinear measurement model, and another specific to each dataset. Both the common and distinct components are assumed to admit a polyadic decomposition. This generalizes several existing CTD models. We provide conditions for specific and generic uniqueness of the decomposition that are easy to interpret. These conditions employ uni-mode uniqueness of different individual datasets and properties of the measurement model. Two algorithms are proposed to compute the common and distinct components: a semi-algebraic one and a coordinate-descent optimization method. Experimental results illustrate the advantage of the proposed framework compared with the state of the art approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑