Turbo-smt: Accelerating coupled sparse matrix-tensor factorizations by 200x

Evangelos E Papalexakis, Tom M Mitchell, Nicholas D Sidiropoulos, Christos Faloutsos, Partha Pratim Talukdar, Brian Murphy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Citations (Scopus)
209 Downloads (Pure)


How can we correlate the neural activity in the human brain as it responds to typed words, with properties of these terms (like ‘edible’, ‘fits in hand’)? In short, we want to find latent variables, that jointly explain both the brain activity, as well as the behavioral responses. This is one of many settings of the Coupled Matrix-Tensor Factorization (CMTF) problem.

Can we accelerate any CMTF solver, so that it runs within a few minutes instead of tens of hours to a day, while maintaining good accuracy? We introduce Turbo-SMT, a meta-method capable of doing exactly that: it boosts the performance of any CMTF algorithm, by up to 200x, along with an up to 65 fold increase in sparsity, with comparable accuracy to the baseline.

We apply Turbo-SMT to BrainQ, a dataset consisting of a (nouns, brain voxels, human subjects) tensor and a (nouns, properties) matrix, with coupling along the nouns dimension. Turbo-SMT is able to find meaningful latent variables, as well as to predict brain activity with competitive accuracy.

Original languageEnglish
Title of host publicationProceedings of the 2014 SIAM International Conference on Data Mining
PublisherSociety for Industrial and Applied Mathematics
Number of pages9
ISBN (Electronic)9781611973440
Publication statusPublished - 2014


Dive into the research topics of 'Turbo-smt: Accelerating coupled sparse matrix-tensor factorizations by 200x'. Together they form a unique fingerprint.

Cite this