Rescaled pure greedy algorithm for Hilbert and Banach spaces
From MaRDI portal
Publication:326773
DOI10.1016/j.acha.2015.10.008zbMath1350.41022arXiv1505.03604OpenAlexW2963246996MaRDI QIDQ326773
Publication date: 12 October 2016
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.03604
Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items
Optimality of the rescaled pure greedy learning algorithms, Biorthogonal greedy algorithms in convex optimization, Unified error estimate for weak biorthogonal Greedy algorithms, Rescaled pure greedy algorithm for convex optimization, A unified way of analyzing some greedy algorithms, Efficiency of the weak Rescaled Pure Greedy Algorithm
Cites Work
- Unnamed Item
- On the rate of convergence of greedy algorithms.
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Rates of convex approximation in non-Hilbert spaces
- Two lower estimates in greedy approximation
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Greedy strategies for convex optimization
- Rescaled pure greedy algorithm for convex optimization
- Approximation and learning by greedy algorithms
- Greedy Approximation
- Lower bounds for the rate of convergence of greedy algorithms
- Universal approximation bounds for superpositions of a sigmoidal function
- Efficient agnostic learning of neural networks with bounded fan-in
- Approximate weak greedy algorithms
