Concept

Champ tensoriel

Publications associées (43)

Rank-Adaptive Time Integration Of Tree Tensor Networks

A rank-adaptive integrator for the approximate solution of high-order tensor differential equations by tree tensor networks is proposed and analyzed. In a recursion from the leaves to the root, the integrator updates bases and then evolves connection tenso ...

SIAM PUBLICATIONS2023

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

Mutual information for low-rank even-order symmetric tensor estimation

Nicolas Macris, Jean François Emmanuel Barbier, Clément Dominique Luneau

We consider a statistical model for finite-rank symmetric tensor factorization and prove a single-letter variational expression for its asymptotic mutual information when the tensor is of even order. The proof applies the adaptive interpolation method orig ...

OXFORD UNIV PRESS2021

Locally supported tangential vector, n-vector, and tensor fields

Christopher Brandt

We introduce a construction of subspaces of the spaces of tangential vector, n-vector, and tensor fields on surfaces. The resulting subspaces can be used as the basis of fast approximation algorithms for design and processing problems that involve tangenti ...

WILEY2020

Complements to Mugge and Friedel's Theory of Twinning

Cyril Cayron

The crystallography of twinning is based on the concepts of simple shear and obliquity introduced by Mugge, Mallard and Friedel at the turn of the last century, with tensor mathematics later developed by Bilby, Bevis and Crocker in the 1960s. We propose a ...

2020

Geometry-aware Manipulability Learning, Tracking and Transfer

Sylvain Calinon, Noémie Laure Gwendoline Jaquier

Body posture influences human and robots performance in manipulation tasks, as appropriate poses facilitate motion or force exertion along different axes. In robotics, manipulability ellipsoids arise as a powerful descriptor to analyze, control and design ...

Sage2020

Hochschild (co)homology of Koszul dual pairs

In this article we prove that the Tamarkin–Tsygan calculus of an Adams connected augmented dg algebra and of its Koszul dual are dual to each other. This uses the fact that the Hochschild cohomology and homology may be regarded as a twisted convolution dg ...

2019

Tensor Robust Pca On Graphs

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a graph signal processing framework to overcome the computational burden of Tensor Robust PCA (TRPCA). Our framework also serves as a convex alternative to graph regularized tensor factorization methods. Our method is based on projecting a tenso ...

IEEE2019

HOTmix: characterizing hindered diffusion using a mixture of generalized higher order tensors

Jean-Philippe Thiran, Erick Jorge Canales Rodriguez, Gabriel Girard, David Paul Roger Romascano, Marco Pizzolato, Jonathan Rafael Patino Lopez, Alessandro Daducci, Muhamed Barakovic, Gaëtan Olivier D Rensonnet, Tim Bjørn Dyrby

We present HOTmix, a new model to describe the diffusion MRI signal for molecules undergoing hindered diffusion. HOTmix is based on a mixture of generalized higher order tensors, explicitly incorporating the diffusion sequence’s time-dependent parameters. ...

2019

Mutual Information for Low-Rank Even-Order Symmetric Tensor Factorization

Nicolas Macris, Jean François Emmanuel Barbier, Clément Dominique Luneau

We consider a statistical model for finite-rank symmetric tensor factorization and prove a single-letter variational expression for its mutual information when the tensor is of even order. The proof uses the adaptive interpolation method, for which rank-on ...

IEEE2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search