# Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability

@inproceedings{Bhaskara2014UniquenessOT, title={Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability}, author={Aditya Bhaskara and M. Charikar and Aravindan Vijayaraghavan}, booktitle={COLT}, year={2014} }

We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompositions: we prove that given a tensor whose decomposition satisfies a robust form of Kruskal's rank condition, it is possible to approximately recover the decomposition if the tensor is known up to a sufficiently small (inverse polynomial) error.
Kruskal's theorem has found many applications in proving the identifiability of parameters for various latent variable models and mixture models such as… CONTINUE READING

#### Supplemental Video

#### Paper Mentions

BLOG POST

47 Citations

When are Overcomplete Representations Identifiable? Uniqueness of Tensor Decompositions Under Expansion Constraints

- Mathematics
- 2013

An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors

- Mathematics, Computer Science
- 2014

63

Perturbation Bounds for Orthogonally Decomposable Tensors and Their Applications in High Dimensional Data Analysis

- Mathematics, Computer Science
- 2020

1

When are overcomplete topic models identifiable? uniqueness of tensor tucker decompositions with structured sparsity

- Mathematics, Computer Science
- 2013

40

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 105 REFERENCES

Identifiability of parameters in latent structure models with many observed variables

- Mathematics
- 2009

353

Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

- Computer Science, Mathematics
- 2008

715

Kruskal's permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints

- Computer Science, Mathematics
- 2004

178

On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors

- Computer Science, Mathematics
- 2002

316