Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Tensor decomposition

Related publications (14)

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 ...

Siam Publications2024

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 ...

Siam Publications2023

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

Bhargav Srinivasa Desikan

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

Ergodic Exploration Using Tensor Train: Applications in Insertion Tasks

Sylvain Calinon, Suhan Narayana Shetty

In robotics, ergodic control extends the tracking principle by specifying a probability distribution over an area to cover instead of a trajectory to track. The original problem is formulated as a spectral multiscale coverage problem, typically requiring t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Functional Tucker Approximation Using Chebyshev Interpolation

Daniel Kressner, Christoph Max Strössner

This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function approximations tha ...

SIAM PUBLICATIONS2021

Sparse Sampling for Inverse Problems With Tensors

Guillermo Ortiz Jimenez

We consider the problem of designing sparse sampling strategies for multidomain signals, which can be represented using tensors that admit a known multilinear decomposition. We leverage the multidomain structure of tensor signals and propose to acquire sam ...

2019

Finding Steady States of Communicating Markov Processes Combining Aggregation/Disaggregation with Tensor Techniques

Francisco Santos Paredes Quartin de Macedo

Stochastic models for interacting processes feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this wo ...

Springer Int Publishing Ag2016

Riemannian Optimization For High-Dimensional Tensor Completion

Michael Maximilian Steinlechner

Tensor completion aims to reconstruct a high-dimensional data set where the vast majority of entries is missing. The assumption of low-rank structure in the underlying original data allows us to cast the completion problem into an optimization problem rest ...

Siam Publications2016

Low-Rank Tensor Methods for Communicating Markov Processes

Daniel Kressner, Francisco Santos Paredes Quartin de Macedo

Stochastic models that describe interacting processes, such as stochastic automata networks, feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the num ...

Springer-Verlag Berlin2014

Learning with tensors: a framework based on convex optimization and spectral regularization

Quoc Tran Dinh

We present a framework based on convex optimization and spectral regularization to perform learning when feature observations are multidimensional arrays (tensors). We give a mathematical characterization of spectral penalties for tensors and analyze a uni ...

Springer2014

Dynamical Approximation By Hierarchical Tucker And Tensor-Train Tensors

We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch and Lubich; see [SIAM J. Matrix Anal. Appl., 29 (2007), pp. 434-454], [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2360-2375]) to the re ...

Society for Industrial and Applied Mathematics2013

Optimal polarisation equations in FLRW universes

Julien Lesgourgues

This paper presents the linearised Boltzmann equation for photons for scalar, vector and tensor perturbations in flat, open and closed FLRW cosmologies. We show that E- and B-mode polarisation for all types can be computed using only a single hierarchy. Th ...

Iop Publishing Ltd2013

Reconstruction of Large, Irregularly Sampled Multidimensional Images. A Tensor-Based Approach

Michaël Unser

Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this problem; the currently available methods, however, are hard to deploy for large-scale inter ...

Institute of Electrical and Electronics Engineers2011

Higher Order SVD Analysis for Dynamic Texture Synthesis

Sabine Süsstrunk, Luciano Sbaiz, Roberto Costantini

Videos representing flames, water, smoke, etc. are often defined as dynamic textures: "textures" because they are characterized by redundant repetition of a pattern and "dynamic" because this repetition is also in time and not only in space. Dynamic textur ...

Institute of Electrical and Electronics Engineers2008