Pages that link to "Item:Q1357857"

The following pages link to Rates of convex approximation in non-Hilbert spaces (Q1357857):

Displaying 44 items.

• Rescaled pure greedy algorithm for Hilbert and Banach spaces (Q326773) (← links)
• An inequality for the entropy numbers and its application (Q390538) (← links)
• Simultaneous greedy approximation in Banach spaces (Q558004) (← links)
• Approximation on anisotropic Besov classes with mixed norms by standard information (Q558005) (← links)
• Greedy approximation of characteristic functions (Q605979) (← links)
• Vector greedy algorithms (Q652444) (← links)
• Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm (Q863343) (← links)
• Greedy expansions in Banach spaces (Q877783) (← links)
• On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces (Q905956) (← links)
• On \(n\)-term approximation with positive coefficients (Q942052) (← links)
• Learning a function from noisy samples at a finite sparse set of points (Q1048968) (← links)
• Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries (Q1288881) (← links)
• Nonlinear approximation in finite-dimensional spaces (Q1383443) (← links)
• Cubature formulas, discrepancy, and nonlinear approximation (Q1401998) (← links)
• The Marcinkiewicz-type discretization theorems (Q1615927) (← links)
• Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
• Local greedy approximation for nonlinear regression and neural network training. (Q1848831) (← links)
• Complexity estimates based on integral transforms induced by computational units (Q1941596) (← links)
• Sequences of \(m\)-term deviations in Hilbert space (Q2093010) (← links)
• On the coincidence of pure greedy and best \(m\)-term approximations (Q2113418) (← links)
• Numerical integration and discrepancy under smoothness assumption and without it (Q2120589) (← links)
• Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
• Semi-nonparametric approximation and index options (Q2292040) (← links)
• A unified way of analyzing some greedy algorithms (Q2329295) (← links)
• Simultaneous approximation by greedy algorithms (Q2498388) (← links)
• Rates of minimization of error functionals over Boolean variable-basis functions (Q2583503) (← links)
• On the mathematical foundations of learning (Q2761194) (← links)
• Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
• Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
• Incremental Greedy Algorithm and Its Applications in Numerical Integration (Q2957058) (← links)
• An Integral Upper Bound for Neural Network Approximation (Q3399370) (← links)
• Greedy approximation (Q3612044) (← links)
• Non-Negative Sparse Regression and Column Subset Selection with L1 Error (Q4993270) (← links)
• Efficiency of the weak Rescaled Pure Greedy Algorithm (Q5010120) (← links)
• (Q5053323) (← links)
• A remark on entropy numbers (Q5066719) (← links)
• Unified error estimate for weak biorthogonal Greedy algorithms (Q5097875) (← links)
• Approximation by finite mixtures of continuous density functions that vanish at infinity (Q5133990) (← links)
• A New Function Space from Barron Class and Application to Neural Network Approximation (Q5878925) (← links)
• Optimality of the rescaled pure greedy learning algorithms (Q5880599) (← links)
• A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces (Q5941369) (← links)
• Proximinality and uniformly approximable sets in \(L^p\) (Q6093308) (← links)
• Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality (Q6155895) (← links)
• A survey on compressed sensing approach to systems and control (Q6188524) (← links)