Approximation and learning by greedy algorithms (Q2477053): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrew R. Barron / rank
 
Normal rank
Property / author
 
Property / author: Albert Cohen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037842665 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0803.1718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive greedy approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal approximation bounds for superpositions of a sigmoidal function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4112938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elements of statistical learning. Data mining, inference, and prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on rates of variable-basis and neural-network approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of worst case errors in linear and neural network approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient agnostic learning of neural networks with bounded fan-in / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two lower estimates in greedy approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by Ridge Functions and Neural Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear methods of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5754213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank

Latest revision as of 18:19, 27 June 2024

scientific article
Language Label Description Also known as
English
Approximation and learning by greedy algorithms
scientific article

    Statements

    Approximation and learning by greedy algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 March 2008
    0 references
    statistical learning
    0 references
    convergence rates for greedy algorithms
    0 references
    interpolation spaces
    0 references
    neural networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references