Answers are grounded in this paper and cite their sources.
We show how to extend several basic concentration inequalities for simple random tensors X=x₁⊗⋯⊗ xd where all xₖ are independent random vectors in Rⁿ with independent coefficients. The new results have optimal dependence on the dimension n and the degree d. As an application, we show that random tensors are well conditioned: (1-o(1))nᵈ independent copies of the simple random tensor X∈R^nᵈ are far from being linearly dependent with high probability. We prove this fact for any degree d=o(√n/log n) and conjecture that it is true for any $d=O(n)$.
No takes yet. Share an insight, caveat, or question.
Roman Vershynin (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: