A greedy algorithm for model selection of tensor decompositions
Lists
Only you see this
Abstract
Various tensor decompositions use different arrangements of factors to explain multi-way data. Components from different decompositions can vary in the number of parameters. Allowing a model to contain components from different decompositions results in a combinatoric number of possible models. Model selection balances approximation error and the number of parameters, but due to the number of possible models, post-hoc model selection is infeasible. Instead, we incrementally build a model. This approach is analogous to sparse coding with a union of dictionaries. The proposed greedy approach can estimate a model consisting of a combination of tensor decompositions.
BibTeX
@inproceedings{brockmeier2013greedy,
author = {Austin J. Brockmeier and José C. Príncipe and Anh Huy Phan and Andrzej Cichocki},
title = {{A greedy algorithm for model selection of tensor decompositions}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2013},
url = {https://openreview.net/forum?id=C46xSBVoSF},
}Loading related content...