Rescaled pure greedy algorithm for Hilbert and Banach spaces
From MaRDI portal
Publication:326773
DOI10.1016/J.ACHA.2015.10.008zbMATH Open1350.41022arXiv1505.03604OpenAlexW2963246996MaRDI QIDQ326773FDOQ326773
Authors: Guergana Petrova 
Publication date: 12 October 2016
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Abstract: We show that a very simple modification of the Pure Greedy Algorithm for approximating functions by sparse sums from a dictionary in a Hilbert or more generally a Banach space has optimal convergence rates on the class of convex combinations of dictionary elements
Full work available at URL: https://arxiv.org/abs/1505.03604
Recommendations
- Greedy algorithms in Banach spaces
- Rescaled pure greedy algorithm for convex optimization
- Greedy algorithms for reduced bases in Banach spaces
- Greedy approximation in Banach spaces
- Simultaneous greedy approximation in Banach spaces
- Greedy algorithms and approximation properties for frames in Hilbert spaces
- Greedy algorithms and bases from the point of view of Banach space theory
- Greedy algorithms and Kolmogorov widths in Banach spaces
- Convergence of greedy algorithms in Banach spaces
- Greedy-type approximation in Banach spaces and applications
Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Universal approximation bounds for superpositions of a sigmoidal function
- Approximation and learning by greedy algorithms
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Two lower estimates in greedy approximation
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Rate of convergence of pure greedy algorithm.
- Greedy approximation
- Greedy strategies for convex optimization
- Rates of convex approximation in non-Hilbert spaces
- Rescaled pure greedy algorithm for convex optimization
- Lower bounds for the rate of convergence of greedy algorithms
- Efficient agnostic learning of neural networks with bounded fan-in
- On the rate of convergence of greedy algorithms.
- Approximate weak greedy algorithms
Cited In (10)
- Lebesgue-type inequalities in greedy approximation
- A unified way of analyzing some greedy algorithms
- On the rate of convergence of a pure greedy algorithm.
- Vector greedy algorithms
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Biorthogonal greedy algorithms in convex optimization
- Unified error estimate for weak biorthogonal greedy algorithms
- Optimality of the rescaled pure greedy learning algorithms
- Entropy-based convergence rates of greedy algorithms
- Rescaled pure greedy algorithm for convex optimization
This page was built for publication: Rescaled pure greedy algorithm for Hilbert and Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326773)
