Low-rank Optimization and Applications

Slides of the talks

Lieven De Lathauwer
KU Leuven
Canonical Polyadic Decomposition of Incomplete Tensors: an Algebraic Study (01.04.2019, 09:15)

 slides 

Madeleine Udell
Cornell University
A practical one-pass algorithm for tensor decomposition (01.04.2019, 10:00)

 slides 

Venera Khoromskaia
Max-Planck Institute for Mathematics in the Sciences
Tensor numerical methods in computational quantum chemistry (02.04.2019, 14:00)

 slides 

Elena Angelini
Università di Siena
On the identifiability of symmetric tensors beyond the Kruskal's bound (04.04.2019, 09:15)

 slides 

Daniel Kressner
EPF Lausanne
On adaptive cross approximation (04.04.2019, 11:15)

 slides 

Evgeny Frolov
Skoltech Moscow
A straightforward generalization of low rank approximation approach for hybrid recommender systems (04.04.2019, 14:00)

 slides 

Grey Ballard
Wake Forest University
Parallel Algorithms for CP and Tucker Decompositions (04.04.2019, 14:45)

 slides 

Hanie Sedghi
Google Brain
The Singular Values of Convolutional Layers (04.04.2019, 16:00)

 slides 

Jochen Garcke
University of Bonn, and Fraunhofer SCAI
A Geometrical Method for Low-Dimensional Representations of Simulations (05.04.2019, 09:15)

 slides 

Sebastian Krämer
RWTH Aachen
A Geometrical Description of Feasible Singular Values in Tree Tensor Formats (05.04.2019, 10:00)

 slides 

Paul Breiding
Max Planck Institute for Mathematics in the Sciences
Pencil-based algorithms for tensor rank decomposition are not stable (05.04.2019, 11:15)

 slides 

Date and Location

April 01 - 05, 2019
Max Planck Institute for Mathematics in the Sciences
Inselstraße 22
04103 Leipzig
Germany

Scientific Organizers

Evrim Acar
Simula Metropolitan Center for Digital Engineering

André Uschmajew
MPI for Mathematics in the Sciences

Nick Vannieuwenhoven
KU Leuven

Administrative Contact

Saskia Gutzschebauch
MPI für Mathematik in den Naturwissenschaften
Contact by Email

28.05.2019, 08:37