4 papers · 1 filter
Neural Learning of Fast Matrix Multiplication Algorithms: A StrassenNet Approach
Paolo Andreini, Alessandra Bernardi, Monica Bianchini +4
Fast matrix multiplication can be described as searching for low-rank decompositions of the matrix--multiplication tensor. We design a neural architecture, \textsc{StrassenNet}, wh…
Triangular tensor networks, pencils of matrices and beyond
Alessandra Bernardi, Fulvio Gesmundo
We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors…
A refinement on the local cactus rank algorithm
Alessandra Bernardi, Oriol Reig Fité
We present an algorithm to recover a minimal local apolar scheme to a homogeneous polynomial . The socle degree of the scheme determines whether it is evinced by a Generalized A…
On the cactus rank of cubics forms
Alessandra Bernardi, Kristian Ranestad
We prove that the smallest degree of an apolar 0-dimensional scheme of a general cubic form in variables is at most , when , and therefore smaller than the ran…