Some comparisons of complexity in dictionary-based and linear computational models (Q553254): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q51635113, #quickstatements; #temporary_batch_1710286847436
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.neunet.2010.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981815973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877167 / 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: Q4039885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for functional optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Variational Norm Tailored to Variable-Basis Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponential convergence of matching pursuits in quasi-incoherent dictionaries / 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: Complexity of Gaussian-radial-basis networks approximating smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and topology of continuous best and near best approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuity of approximation by neural networks in \(L_p\) spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400833 / 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: Error Estimates for Approximate Optimization by the Extended Ritz Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Upper Bounds on Rates of Variable-Basis Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random approximants and neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3843871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative Theorems in Approximation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating networks and extended Ritz method for the solution of functional optimization problems / rank
 
Normal rank

Latest revision as of 07:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Some comparisons of complexity in dictionary-based and linear computational models
scientific article

    Statements

    Some comparisons of complexity in dictionary-based and linear computational models (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2011
    0 references
    linear approximation schemes
    0 references
    variable-basis approximation schemes
    0 references
    model complexity
    0 references
    worst-case errors
    0 references
    neural networks
    0 references
    kernel models
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers