Adaptive greedy approximations

DOI10.1007/BF02678430zbMath0885.41006OpenAlexW2021302824MaRDI QIDQ5961558

Marco Avellaneda, Stephane Mallat, G. Davis

Publication date: 5 April 1998

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02678430

Mathematics Subject Classification ID

Applications of stochastic analysis (to PDEs, etc.) (60H30) Approximation by polynomials (41A10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Ergodic theory (37A99) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

Optimizing Image Quality, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, FRIST—flipping and rotation invariant sparsifying transform learning and applications, In memoriam: Marco Avellaneda (1955–2022), Unconditional basis constructed from parameterised Szegö kernels in analytic $\mathbb{H}^p(D)$, Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals, Unnamed Item, Matching pursuit with unbounded parameter domains, Disparity and optical flow partitioning using extended Potts priors, Gradient-based method with active set strategy for $\ell _1$ optimization, Sparse Approximation by Greedy Algorithms, Concentration of the Frobenius Norm of Generalized Matrix Inverses, A tree-based dictionary learning framework, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, REMARKS ON ADAPTIVE FOURIER DECOMPOSITION, Cyclic AFD algorithm for the best rational approximation, Two‐dimensional adaptive Fourier decomposition, Unnamed Item, Unnamed Item, Unnamed Item, Global sensitivity analysis based on high-dimensional sparse surrogate construction, LEARNING AN ADAPTIVE DICTIONARY USING A PROJECTED GRADIENT METHOD AND ITS APPLICATION ON IMAGE DE-NOISING, Low-Rank and Sparse Dictionary Learning, Average Performance of the Sparsest Approximation Using a General Dictionary, Positive-instantaneous frequency and approximation, Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions, Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations, Sparsity Based Methods for Overparameterized Variational Problems, Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging, Time-frequency atom decomposition with quantum-inspired evolutionary algorithms, Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing, Sparse approximation is provably hard under coherent dictionaries, A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem, 3D face recognition with sparse spherical representations, Reconstruction of sparse signals in impulsive disturbance environments, On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis, Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data, On the divergence of greedy algorithms with respect to Walsh subsystems in $L$, Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, Some remarks on greedy algorithms, Nonlinear approximation in finite-dimensional spaces, Fast stepwise regression based on multidimensional indexes, Nonlinear tensor product approximation of functions, Iterative hard thresholding for compressed data separation, A simple homotopy proximal mapping algorithm for compressive sensing, Sampling in the analysis transform domain, Sparse Legendre expansions via $\ell_1$-minimization, Micro-macro models for viscoelastic fluids: modelling, mathematics and numerics, A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography, Adaptive Fourier series---a variation of greedy algorithm, On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem, On sparse recovery algorithms in unions of orthonormal bases, Greedy-like algorithms for the cosparse analysis model, Analysis of target data-dependent greedy kernel algorithms: convergence rates for $f$-, $f \cdot P$- and $f/P$-greedy, On Linguistic Variables and Sparse Representations, On the statistics of matching pursuit angles, Sparse reconstruction for bioluminescence tomography based on the semigreedy method, Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF, Delay-coordinates embeddings as a data mining tool for denoising speech signals, A note on the hardness of sparse approximation, Solve exactly an under determined linear system by minimizing least squares regularized with an $\ell_0$ penalty, Cascade systems de-noising and greedy calibrated approximation, Vector greedy algorithms, Error in the reconstruction of nonsparse images, On the conditioning of random subdictionaries, Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space, Bag of Pursuits and Neural Gas for Improved Sparse Coding, Sparse approximation based on a random overcomplete basis, Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data, Beyond sparsity: recovering structured representations by ${\ell}^1$ minimization and greedy algorithms, A cubic spline penalty for sparse approximation under tight frame balanced model, Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing, Approximation and learning by greedy algorithms, An automatic and parameter-free information-based method for sparse representation in wavelet bases, Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO, Adaptive frame methods for nonlinear variational problems, Sparse signals recovery from noisy measurements by orthogonal matching pursuit, Sparsity in time-frequency representations, A non-adapted sparse approximation of PDEs with stochastic inputs, Deconvolution by matching pursuit using spline wavelet packets dictionaries, Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis, On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them, Simultaneous approximation by greedy algorithms, Statistical arbitrage in the US equities market, Cardinal B-spline dictionaries on a compact interval, On performance of greedy algorithms, Capped $\ell_p$ approximations for the composite $\ell_0$ regularization problem, Sparse representation-based patient-specific diagnosis and treatment for esophageal squamous cell carcinoma, Functional dissipation microarrays for classification, Greedy approximation, Approximately normalized iterative hard thresholding for nonlinear compressive sensing, $\ell_1$- and $\ell_2$-norm joint regularization based sparse signal reconstruction scheme, On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain, Regularized coplanar discriminant analysis for dimensionality reduction, Structured overcomplete sparsifying transform learning with convergence guarantees and applications, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, Average performance of the approximation in a dictionary using an $\ell _0$ objective, Locality-constrained sparse representation for hyperspectral image classification, An active set Barzilar-Borwein algorithm for $l_0$ regularized optimization, An efficient multifidelity $\ell_1$-minimization method for sparse polynomial chaos, Column subset selection via sparse approximation of SVD, Super-resolution for doubly-dispersive channel estimation, A review on restoration of seismic wavefields based on regularization and compressive sensing, Greedy algorithms and $M$-term approximation with regard to redundant dictionaries, SPARSE RECONSTRUCTION OF HARDY SIGNAL AND APPLICATIONS TO TIME-FREQUENCY DISTRIBUTION, Approximate wavelets and the approximation of pseudodifferential operators, Sparse Representation of Signals in Hardy Space, Sequences of $m$-term deviations in Hilbert space, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, A solution for the greedy approximation of a step function with a waveform dictionary, Alternating direction method of multipliers for solving dictionary learning models, Greedy signal space methods for incoherence and beyond, Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints, On the coincidence of pure greedy and best $m$-term approximations, Alpha-expansions: A class of frame decompositions, Orthogonal one step greedy procedure for heteroscedastic linear models, Nomonotone spectral gradient method for sparse recovery, A membrane algorithm with quantum-inspired subalgorithms and its application to image processing, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces

Cites Work