Rates of convex approximation in non-Hilbert spaces
From MaRDI portal
Publication:1357857
DOI10.1007/BF02678464zbMath0876.41016MaRDI QIDQ1357857
Publication date: 2 December 1997
Published in: Constructive Approximation (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic methods in Banach space theory (46B09) Rate of convergence, degree of approximation (41A25)
Related Items (44)
Optimality of the rescaled pure greedy learning algorithms ⋮ Numerical integration and discrepancy under smoothness assumption and without it ⋮ The Marcinkiewicz-type discretization theorems ⋮ Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ A remark on entropy numbers ⋮ Biorthogonal greedy algorithms in convex optimization ⋮ Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm ⋮ Greedy expansions in Banach spaces ⋮ Greedy approximation of characteristic functions ⋮ Nonlinear approximation in finite-dimensional spaces ⋮ An inequality for the entropy numbers and its application ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy ⋮ Unified error estimate for weak biorthogonal Greedy algorithms ⋮ Proximinality and uniformly approximable sets in \(L^p\) ⋮ Incremental Greedy Algorithm and Its Applications in Numerical Integration ⋮ Cubature formulas, discrepancy, and nonlinear approximation ⋮ Complexity estimates based on integral transforms induced by computational units ⋮ Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality ⋮ A survey on compressed sensing approach to systems and control ⋮ On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces ⋮ Vector greedy algorithms ⋮ Approximation by finite mixtures of continuous density functions that vanish at infinity ⋮ Non-Negative Sparse Regression and Column Subset Selection with L1 Error ⋮ On \(n\)-term approximation with positive coefficients ⋮ Unnamed Item ⋮ On the mathematical foundations of learning ⋮ A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces ⋮ Simultaneous greedy approximation in Banach spaces ⋮ Approximation on anisotropic Besov classes with mixed norms by standard information ⋮ Simultaneous approximation by greedy algorithms ⋮ Greedy approximation ⋮ Semi-nonparametric approximation and index options ⋮ Boosting the margin: a new explanation for the effectiveness of voting methods ⋮ An Integral Upper Bound for Neural Network Approximation ⋮ Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries ⋮ A unified way of analyzing some greedy algorithms ⋮ Learning a function from noisy samples at a finite sparse set of points ⋮ Sequences of \(m\)-term deviations in Hilbert space ⋮ Local greedy approximation for nonlinear regression and neural network training. ⋮ Efficiency of the weak Rescaled Pure Greedy Algorithm ⋮ Rates of minimization of error functionals over Boolean variable-basis functions ⋮ On the coincidence of pure greedy and best \(m\)-term approximations ⋮ A New Function Space from Barron Class and Application to Neural Network Approximation
Cites Work
- Introduction to robust and quasi-robust statistical methods
- On the uniform convexity of \(L^p\) and \(l^p\)
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Nonreflexive spaces of type 2
- The best constants in the Khintchine inequality
- A Characterization of Banach Spaces Containing l 1
- A subsequence principle characterizing\\ Banach spaces containing $c_0$
- On modular sequence spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rates of convex approximation in non-Hilbert spaces
