Unconditional bases and bit-level compression

DOI10.1006/ACHA.1996.0032MaRDI QIDQ2564044zbMATH OpenOpenAlexFDO

Authors David Donoho

Publication date 18 May 2000

Published in Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/0e048e70c56c4b98c58657505b75af5e6b6f9296

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Source coding (94A29) General harmonic expansions, frames (42C15)

Recommendations

• Unconditional bases are optimal bases for data compression and for statistical estimation
• Universal Compression of Memoryless Sources Over Unknown Alphabets
• Compression and hadamard power inequalities
• Inequalities and algorithms for universal data compression
• Compressibility and uniform complexity
• scientific article; zbMATH DE number 78498
• Universal almost sure data compression
• scientific article; zbMATH DE number 3463524
• Universal Algorithms for Channel Decoding of Uncompressed Sources

Cited in

(24)

• Dimensionality reduction and greedy learning of convoluted stochastic dynamics
• On the representation of smooth functions on the sphere using finitely many bits
• Bayesian maximum entropy based algorithm for digital X-ray mammogram processing
• Optimally sparse data representations
• Unconditional convergence of Fourier expansions in systems of product bases in Orlicz spaces
• Tree approximation with anisotropic decompositions
• New tight frames of curvelets and optimal representations of objects with piecewise C² singularities
• FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS
• Replicant compression coding in Besov spaces
• On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces
• Metric entropy limits on recurrent neural network learning of linear dynamical systems
• Efficient hedging of options with probabilistic Haar wavelets
• Greedy bases are best for \(m\)-term approximation
• Wedgelets: Nearly minimax estimation of edges
• On the entropy numbers between the anisotropic spaces and the spaces of functions with mixed smoothness
• Tree approximation and optimal encoding
• Thresholding procedure with priors based on Pareto distributions
• Entropy numbers of functions on \([-1,1]\) with Jacobi weights
• Information-theoretic determination of minimax rates of convergence
• Entropy numbers of Besov classes of generalized smoothness on the sphere
• Estimates for entropy numbers of sets of smooth functions on the torus \(\mathbb{T}^d\)
• Thresholding algorithms, maxisets and well-concentrated bases
• Unconditional bases are optimal bases for data compression and for statistical estimation
• Nonlinear estimation over weak Besov spaces and minimax Bayes

This page was built for publication: Unconditional bases and bit-level compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564044)