Tensor decomposition | EPFL Graph Search

Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?

Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.

Découvrez-en plus sur les applications Graph.

In multilinear algebra, a tensor decomposition is any scheme for expressing a "data tensor" (M-way array) as a sequence of elementary operations acting on other, often simpler tensors. Many tensor decompositions generalize some matrix decompositions. Tensors are generalizations of matrices to higher dimensions (or rather to higher orders, i.e. the higher number of dimensions) and can consequently be treated as multidimensional fields. The main tensor decompositions are: Tensor rank decomposition; Higher-order singular value decomposition; Tucker decomposition; matrix product states, and operators or tensor trains; Online Tensor Decompositions hierarchical Tucker decomposition; block term decomposition This section introduces basic notations and operations that are widely used in the field. A multi-way graph with K perspectives is a collection of K matrices with dimensions I × J (where I, J are the number of nodes). This collection of matrices is naturally represented as a tensor X of size I × J × K. In order to avoid overloading the term “dimension”, we call an I × J × K tensor a three “mode” tensor, where “modes” are the numbers of indices used to index the tensor.

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (22)

Personnes associées (2)

Unités associées (5)

Concepts associés (2)

Cours associés (2)

Séances de cours associées (5)

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Laura Grigori

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

Philadelphia2024

STREAMING TENSOR TRAIN APPROXIMATION

Daniel Kressner

Tensor trains are a versatile tool to compress and work with high-dimensional data and functions. In this work we introduce the streaming tensor train approximation (STTA), a new class of algorithms for approximating a given tensor ' in the tensor train fo ...

Philadelphia2023

WikiArtVectors: Style and Color Representations of Artworks for Cultural Analysis via Information Theoretic Measures

With the increase in massive digitized datasets of cultural artefacts, social and cultural scientists have an unprecedented opportunity for the discovery and expansion of cultural theory. The WikiArt dataset is one such example, with over 250,000 high qual ...

MDPI2022

CS-526: Learning theory

Machine learning and data analysis are becoming increasingly central in many sciences and applications. This course concentrates on the theoretical underpinnings of machine learning.

CS-308: Introduction to quantum computation

The course introduces the paradigm of quantum computation in an axiomatic way. We introduce the notion of quantum bit, gates, circuits and we treat the most important quantum algorithms. We also touch

Multilinear subspace learning is an approach for disentangling the causal factor of data formation and performing dimensionality reduction. The Dimensionality reduction can be performed on a data tensor that contains a collection of observations have been vectorized, or observations that are treated as matrices and concatenated into a data tensor. Here are some examples of data tensors whose observations are vectorized or whose observations are matrices concatenated into data tensor s (2D/3D), video sequences (3D/4D), and hyperspectral cubes (3D/4D).

En mathématiques, plus précisément en algèbre multilinéaire et en géométrie différentielle, un tenseur est un objet très général, dont la valeur s'exprime dans un espace vectoriel. On peut l'utiliser entre autres pour représenter des applications multilinéaires ou des multivecteurs.

Couvre la décomposition des tenseurs et le théorème de Jennrich, en se concentrant sur le rang des tenseurs et l'unicité de la décomposition des tenseurs.

Explore l'analyse du processus de mesure dans l'algorithme de Shor.

Analyser les équations d'équilibre linéaire de l'élan et explorer les conséquences de la continuité et de la divergence dans la conservation de l'élan angulaire.