Matrix and tensor rigidity and $L_p$-approximation
Yuri Malykhin

TL;DR
This paper explores the application of complexity theory methods to approximation problems, demonstrating new bounds for matrix and tensor rigidity, and establishing limits for approximating multivariate functions with tensor products.
Contribution
It introduces novel lower bounds for tensor signum-rank and multivariate function approximation errors, extending matrix rigidity results to tensors and analyzing approximation limits for specific function classes.
Findings
Walsh system functions can be approximated with error n^{-eta} by low-dimensional linear spaces for p<2
Most signum-tensors have high signum-rank, resisting low-rank approximation in norm
Established lower bounds for m-term approximation errors of multivariate functions with tensor products
Abstract
In this paper we apply methods originated in Complexity theory to some problems of Approximation. We notice that the construction of Alman and Williams that disproves the rigidity of Walsh-Hadamard matrices, provides good -approximation for . It follows that the first functions of Walsh system can be approximated with an error by a linear space of dimension : We do not know if this is possible for the trigonometric system. We show that the algebraic method of Alon--Frankl--R\"odl for bounding the number of low-signum-rank matrices, works for tensors: almost all signum-tensors have large signum-rank and can't be -approximated by low-rank tensors. This implies lower bounds for ~ -- the error of -term approximation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Mathematical Approximation and Integration · Matrix Theory and Algorithms
