FIR Volterra kernel neural models and PAC learning (Q1860326): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/cplx.10042 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/cplx.10042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976672383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590550 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/CPLX.10042 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:30, 16 December 2024

scientific article
Language Label Description Also known as
English
FIR Volterra kernel neural models and PAC learning
scientific article

    Statements

    FIR Volterra kernel neural models and PAC learning (English)
    0 references
    0 references
    0 references
    20 February 2003
    0 references
    Summary: The probably approximately correct (PAC) learning theory creates a framework to assess the learning properties of static models for which the data are assumed to be independently and identically distributed (i.i.d.). The present article first extends the idea of PAC learning to cover the learning of modeling tasks with m-dependent sequences of data. The data are assumed to be marginally distributed according to a fixed arbitrary probability. The resulting framework is then applied to evaluate learning of Volterra Kernel FIR models.
    0 references
    PAC learning
    0 references
    nonlinear FIR model
    0 references
    Volterra kernel polynomials
    0 references
    \(m\)-dependency
    0 references
    0 references

    Identifiers

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