Kolmogorov width and approximate rank
From MaRDI portal
Publication:2423217
DOI10.1134/S0081543818080126zbMath1426.41016OpenAlexW2919133567MaRDI QIDQ2423217
K. S. Ryutin, Boris S. Kashin, Yuri V. Malykhin
Publication date: 21 June 2019
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543818080126
Related Items
Kolmogorov widths of the Besov classes \(B^1_{1,\theta}\) and products of octahedra ⋮ Matrix and tensor rigidity and \(L_p\)-approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for agnostic learning via approximate rank
- Remark on estimates of orthomassivity
- Complexity measures of sign matrices
- The octahedron is badly approximated by random subspaces
- Nonlinear approximation by trigonometric sums
- Estimating the optimal margins of embeddings in Euclidean half spaces
- Lower bounds for \(n\)-term approximations of plane convex sets and related topics
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- Constructive sparse trigonometric approximation for functions with small mixed smoothness
- On a norm and approximate characteristics of classes of multivariable functions
- Dyadic analogues of Hilbert matrices
- NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
- Complexity Lower Bounds using Linear Algebra
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- On the diameters of a class of functions of bounded variation in the spaceLq(0,1), 2 <q< ∞
- DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Classical Fourier Analysis
- Upper and Lower Bounds for Stochastic Processes
- The approximate rank of a matrix and its algorithmic applications
- Lower bounds in communication complexity based on factorization norms
