# Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits

arXiv: https://arxiv.org/abs/2105.01751 · HTML: https://mlsanity.com/paper/2105.01751/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 87 references that are in the map.
- First posted on arXiv 4 May 2021.

## Builds on (most cited first, 4 of 4)

- [Learning Polynomials of Few Relevant Dimensions](https://mlsanity.com/paper/2004.13748/) (2020)
- [Learning sums of powers of low-degree polynomials in the non-degenerate case](https://mlsanity.com/paper/2004.06898/) (2020)
- [Reconstruction of depth-3, top fan-in two circuits over characteristic zero fields](https://mlsanity.com/paper/1512.01256/) (2015)
- [Efficient reconstruction of depth three circuits with top fan-in two](https://mlsanity.com/paper/2103.07445/) (2021)

## Abstract (arXiv)

We give new and efficient black-box reconstruction algorithms for some classes of depth-3 arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the optimal tensor decomposition as a sum of rank-one tensors when then input is a constant-rank tensor. More specifically, we provide efficient learning algorithms that run in randomized polynomial time over general fields and in deterministic polynomial time over the reals and the complex numbers for the following classes: (1) Set-multilinear depth-3 circuits of constant top fan-in SigmaPiSigmasqcupj Xj(k) circuits). As a consequence of our algorithm, we obtain the first polynomial time algorithm for tensor rank computation and optimal tensor decomposition of constant-rank tensors. This result holds for d dimensional tensors for any d, but is interesting even for d=3. (2) Sums of powers of constantly many linear forms (SigmawedgeSigma circuits). As a consequence we obtain the first polynomial-time algorithm for tensor rank computation and optimal tensor decomposition of constant-rank symmetric tensors. (3) Multilinear depth-3 circuits of constant top fan-in (multilinear SigmaPiSigma(k) circuits). Our algorithm works over all fields of characteristic 0 or large enough characteristic. Prior to our work the only efficient algorithms known were over polynomially-sized finite fields (see. Karnin-Shpilka 09'). Prior to our work, the only polynomial-time or even subexponential-time algorithms known (deterministic or randomized) for subclasses of SigmaPiSigma(k) circuits that also work over large/infinite fields were for the setting when the top fan-in k is at most 2 (see Sinha 16' and Sinha 20').