Adaptive greedy approximations

DOI10.1007/BF02678430zbMATH Open0885.41006OpenAlexW2021302824MaRDI QIDQ5961558FDOQ5961558

Marco Avellaneda, Stéphane 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

Recommendations

• Vector greedy algorithms
• Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
• On greedy algorithms for dictionaries with bounded cumulative coherence
• Simultaneous approximation by greedy algorithms
• Approximate weak greedy algorithms

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms.
• Matching pursuits with time-frequency dictionaries
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Title not available (Why is that?)
• Image compression through wavelet transform coding
• Title not available (Why is that?)
• Compression of Wavelet Decompositions
• Ergodic theory. Introductory lectures
• Probabilistic Properties of Deterministic Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orthogonal least squares methods and their application to non-linear system identification
• Signal representation using adaptive normalized Gaussian functions

Cited In (only showing first 100 items - show all)

• Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms
• 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
• Approximate wavelets and the approximation of pseudodifferential operators
• Sparse Legendre expansions via \(\ell_1\)-minimization
• On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
• On the divergence of greedy algorithms with respect to Walsh subsystems in \(L\)
• Sparse Representation of Signals in Hardy Space
• Statistical arbitrage in the US equities market
• Low-Rank and Sparse Dictionary Learning
• An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos
• Deconvolution by matching pursuit using spline wavelet packets dictionaries
• On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
• Micro-macro models for viscoelastic fluids: modelling, mathematics and numerics
• A novel sparsity reconstruction method from Poisson data for 3D bioluminescence tomography
• Sparse reconstruction for bioluminescence tomography based on the semigreedy method
• Cyclic AFD algorithm for the best rational approximation
• Vector greedy algorithms
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
• FUNCTIONAL APPROXIMATION IN MULTISCALE COMPLEX SYSTEMS
• Functional dissipation microarrays for classification
• Gradient-based method with active set strategy for $\ell _1$ optimization
• A non-adapted sparse approximation of PDEs with stochastic inputs
• The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials
• Greedy-like algorithms for the cosparse analysis model
• Approximation and learning by greedy algorithms
• Disparity and optical flow partitioning using extended Potts priors
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• Cardinal B-spline dictionaries on a compact interval
• Sparse Approximation by Greedy Algorithms
• Some remarks on greedy algorithms
• Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
• On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
• Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing
• Positive-instantaneous frequency and approximation
• Average performance of the approximation in a dictionary using an \(\ell _0\) objective
• An adaptive collect algorithm with applications
• Title not available (Why is that?)
• Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations
• Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space
• 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
• Column subset selection via sparse approximation of SVD
• Sampling in the analysis transform domain
• Sparse approximation is provably hard under coherent dictionaries
• Greedy randomized adaptive search procedures
• On the conditioning of random subdictionaries
• Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
• Simultaneous approximation by greedy algorithms
• On performance of greedy algorithms
• Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
• Adaptive Fourier series---a variation of greedy algorithm
• Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data
• Greedy approximation
• Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty
• Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
• A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
• Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
• On the coincidence of pure greedy and best \(m\)-term approximations
• Error in the reconstruction of nonsparse images
• Nonlinear tensor product approximation of functions
• Greedy signal space methods for incoherence and beyond
• Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression
• Sparsity in time-frequency representations
• Nonlinear approximation in finite-dimensional spaces
• On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem
• Two‐dimensional adaptive Fourier decomposition
• Average Performance of the Sparsest Approximation Using a General Dictionary
• FRIST—flipping and rotation invariant sparsifying transform learning and applications
• Active learning polynomial chaos expansion for reliability analysis by maximizing expected indicator function prediction error
• Estimation of \(l_0\) norm penalized models: a statistical treatment
• Approximately normalized iterative hard thresholding for nonlinear compressive sensing
• A cubic spline penalty for sparse approximation under tight frame balanced model
• Alpha-expansions: A class of frame decompositions
• Learning an adaptive dictionary using a projected gradient method and its application on image de-noising
• Title not available (Why is that?)
• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
• Title not available (Why is that?)
• An automatic and parameter-free information-based method for sparse representation in wavelet bases
• A note on the hardness of sparse approximation
• Tsallis entropy based uncertainty relations on sparse representation for vector and matrix signals
• Reconstruction of sparse signals in impulsive disturbance environments
• Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
• Optimizing Image Quality
• On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression
• Bag of Pursuits and Neural Gas for Improved Sparse Coding
• Concentration of the Frobenius Norm of Generalized Matrix Inverses
• Mathematical theory of signal analysis vs. complex analysis method of harmonic analysis
• Sparse approximation based on a random overcomplete basis
• Alternating direction method of multipliers for solving dictionary learning models
• Title not available (Why is that?)
• Adaptive frame methods for nonlinear variational problems
• A tree-based dictionary learning framework
• Sparsity Based Methods for Overparameterized Variational Problems
• Matching pursuit with unbounded parameter domains
• A reduced conjugate gradient basis method for fractional diffusion
• Sparse reconstruction of Hardy signal and applications to time-frequency distribution
• 3D face recognition with sparse spherical representations
• REMARKS ON ADAPTIVE FOURIER DECOMPOSITION

This page was built for publication: Adaptive greedy approximations

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