Some remarks on greedy algorithms
From MaRDI portal
Publication:1923887
DOI10.1007/BF02124742zbMath0857.65016MaRDI QIDQ1923887
Ronald A. DeVore, Vladimir N. Temlyakov
Publication date: 9 March 1997
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Algorithms for approximation of functions (65D15)
Related Items
Optimality of the rescaled pure greedy learning algorithms, The Fourier type expansions on tubes, Neural network approximation, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, Unified error estimate for weak biorthogonal Greedy algorithms, Orthogonalization in Clifford Hilbert modules and applications, Characterization of the variation spaces corresponding to shallow neural networks, Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries, A convergence rate estimate for remotest projections on three subspaces, ReLU neural network Galerkin BEM, Matching pursuit with unbounded parameter domains, Adaptive Fourier decomposition‐type sparse representations versus the Karhunen–Loève expansion for decomposing stochastic processes, Besov regularity for elliptic boundary value problems, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, Greedy Algorithms and Rational Approximation in One and Several Variables, REMARKS ON ADAPTIVE FOURIER DECOMPOSITION, Adapted bases of time-frequency local cosines., Two‐dimensional adaptive Fourier decomposition, Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems, A counter-example to the general convergence of partially greedy algorithms, Greedy Algorithms for Optimal Measurements Selection in State Estimation Using Reduced Models, Adaptive Approximation by Optimal Weighted Least-Squares Methods, Binary Component Decomposition Part I: The Positive-Semidefinite Case, Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion, Unnamed Item, Efficiency of the weak Rescaled Pure Greedy Algorithm, A New Computational Method for the Sparsest Solutions to Systems of Linear Equations, Sharp Z-eigenvalue inclusion set-based method for testing the positive definiteness of multivariate homogeneous forms, Adaptive wavelet methods for elliptic operator equations: Convergence rates, Greedy algorithms for prediction, Greedy strategies for convex optimization, Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications, Efficiency of weak greedy algorithms for \(m\)-term approximations, Modeling of electric disturbance signals using damped sinusoids via atomic decompositions and its applications, Shearlet coorbit spaces and associated Banach frames, Frames and non linear approximations in Hilbert spaces, Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations, Book Review: A mathematical introduction to compressive sensing, Bounds for the Z-eigenpair of general nonnegative tensors, Rescaled pure greedy algorithm for Hilbert and Banach spaces, A NONPARAMETRIC ESTIMATOR FOR THE COVARIANCE FUNCTION OF FUNCTIONAL DATA, On Lebesgue-type inequalities for greedy approximation, Uniform approximation rates and metric entropy of shallow neural networks, Orthorecursive expansions and their properties, Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations, Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm, On the absolute convergence of orthogonal series, High-dimensional change-point estimation: combining filtering with convex optimization, Convergence of orthogonal greedy algorithm with errors in projectors, The rate of convergence of weak greedy approximations over orthogonal dictionaries, Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems, When does OMP achieve exact recovery with continuous dictionaries?, On greedy algorithms for dictionaries with bounded cumulative coherence, On the divergence of greedy algorithms with respect to Walsh subsystems in \(L\), Greedy expansions in Banach spaces, Greedy approximation of characteristic functions, Nonlinear approximation in finite-dimensional spaces, Super greedy type algorithms, Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators, The convex geometry of linear inverse problems, On the uniform convergence of the greedy algorithm in a generalized Walsh system, Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms, System identification by discrete rational atoms, Quasi-Banach algebras and Wiener properties for pseudodifferential and generalized metaplectic operators, Sharp recovery bounds for convex demixing, with applications, \(E\)-eigenvalue localization sets for tensors, Adaptive Fourier decomposition of slice regular functions, Wavelet compressive sampling signal reconstruction using upside-down tree structure, Rescaled pure greedy algorithm for convex optimization, Cubature formulas, discrepancy, and nonlinear approximation, Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary, Micro-macro models for viscoelastic fluids: modelling, mathematics and numerics, Decay and smoothness for eigenfunctions of localization operators, On the convergence of orthorecursive expansions in nonorthogonal wavelets, Nonlinear approximation of functions from the class \(L^r\) with respect to the Vilenkin system, On the \(L^p\)-greedy universal functions with respect to the generalized Walsh system, Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy, Greedy training algorithms for neural networks and applications to PDEs, Sparse approximation of individual functions, Alternating projections, remotest projections, and greedy approximation, Frequency-domain identification: An algorithm based on an adaptive rational orthogonal system, A fast adaptive model reduction method based on Takenaka-Malmquist systems, Approximation rates for the hierarchical tensor format in periodic Sobolev spaces, Greedy expansions in Hilbert spaces, Vector greedy algorithms, Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space, Further study on \(Z\)-eigenvalue localization set and positive definiteness of fourth-order tensors, A wavelet-based nested iteration-inexact conjugate gradient algorithm for adaptively solving elliptic PDEs, Optimal \(Z\)-eigenvalue inclusion intervals for even order tensors and their applications, A new Brauer-type \(Z\)-eigenvalue inclusion set for tensors, On \(n\)-term approximation with positive coefficients, Learning semidefinite regularizers, On rearranged series by Haar system, Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set, Positive-definite functions, exponential sums and the greedy algorithm: a curious phenomenon, A non linear approximation method for solving high dimensional partial differential equations: application in finance, Approximation and learning by greedy algorithms, Schwarz iterative methods: infinite space splittings, Democracy functions and optimal embeddings for approximation spaces, Analysis of the self projected matching pursuit algorithm, Simultaneous greedy approximation in Banach spaces, Approximation on anisotropic Besov classes with mixed norms by standard information, Simultaneous approximation by greedy algorithms, \(Z\)-eigenvalue localization sets for even order tensors and their applications, On performance of greedy algorithms, Identification of discrete Hammerstein systems by using adaptive finite rational orthogonal basis functions, On Faber-Schauder coefficients of continuous functions and divergence of greedy algorithm, When do stepwise algorithms meet subset selection criteria?, On behavior of Fourier coefficients and uniform convergence of Fourier series in the Haar system, The strong \(L^{1}\)- greedy property of the Walsh system, On \(N\) -termed approximations in \(H^s\)-norms with respect to the Haar system, Sparsity of Gabor representation of Schrödinger propagators, \(E\)-eigenvalue localization sets for fourth-order tensors, Compression and denoising using \(l _{0}\)-norm, Efficiency of orthogonal super greedy algorithm under the restricted isometry property, \(L^p\)-convergence of greedy algorithm by generalized Walsh system, The regularized weak functional matching pursuit for linear inverse problems, Localization of frames. II, Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries, A unified way of analyzing some greedy algorithms, Adaptive Fourier decomposition of functions in quaternionic Hardy spaces, Optimal \(Z\)-eigenvalue inclusion intervals of tensors and their applications, Sequences of \(m\)-term deviations in Hilbert space, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Local greedy approximation for nonlinear regression and neural network training., On universal estimators in learning theory, On the coincidence of pure greedy and best \(m\)-term approximations, Sampling based approximation of linear functionals in reproducing kernel Hilbert spaces, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
Cites Work
