Unconditional bases and bit-level compression
From MaRDI portal
Publication:2564044
DOI10.1006/acha.1996.0032zbMath0936.62004OpenAlexW2021586389MaRDI QIDQ2564044
Publication date: 18 May 2000
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0e048e70c56c4b98c58657505b75af5e6b6f9296
General harmonic expansions, frames (42C15) Statistical aspects of information-theoretic topics (62B10) Source coding (94A29)
Related Items
Metric entropy limits on recurrent neural network learning of linear dynamical systems, Entropy numbers of functions on \([-1,1\) with Jacobi weights], Nonlinear estimation over weak Besov spaces and minimax Bayes, Optimally Sparse Data Representations, Bayesian maximum entropy based algorithm for digital X-ray mammogram processing, Estimates for entropy numbers of sets of smooth functions on the torus \(\mathbb{T}^d\), Thresholding procedure with priors based on Pareto distributions, On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces, Tree approximation with anisotropic decompositions, Efficient hedging of options with probabilistic Haar wavelets, Entropy numbers of Besov classes of generalized smoothness on the sphere, On the entropy numbers between the anisotropic spaces and the spaces of functions with mixed smoothness, FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS, Thresholding algorithms, maxisets and well-concentrated bases, Replicant compression coding in Besov spaces, Tree approximation and optimal encoding, On the representation of smooth functions on the sphere using finitely many bits, Unconditional convergence of Fourier expansions in systems of product bases in Orlicz spaces, Dimensionality reduction and greedy learning of convoluted stochastic dynamics, New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities, Wedgelets: Nearly minimax estimation of edges, Greedy bases are best for \(m\)-term approximation, Information-theoretic determination of minimax rates of convergence
