Number of the records: 1  

Classification by Sparse Neural Networks

  1. 1.
    SYSNO ASEP0485611
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleClassification by Sparse Neural Networks
    Author(s) Kůrková, Věra (UIVT-O) RID, SAI, ORCID
    Sanguineti, M. (IT)
    Source TitleIEEE Transactions on Neural Networks and Learning Systems - ISSN 2162-237X
    Roč. 30, č. 9 (2019), s. 2746-2754
    Number of pages9 s.
    Languageeng - English
    CountryUS - United States
    KeywordsBinary classification ; Chernoff–Hoeffding bound ; dictionaries of computational units ; feedforward networks ; measures of sparsity
    Subject RIVIN - Informatics, Computer Science
    OECD categoryComputer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    R&D ProjectsGA15-18108S GA ČR - Czech Science Foundation (CSF)
    GA18-23827S GA ČR - Czech Science Foundation (CSF)
    Method of publishingLimited access
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000482589400015
    EID SCOPUS85071708566
    DOI10.1109/TNNLS.2018.2888517
    AnnotationThe choice of dictionaries of computational units suitable for efficient computation of binary classification tasks is investigated. To deal with exponentially growing sets of tasks with increasingly large domains, a probabilistic model is introduced. The relevance of tasks for a given application area is modeled by a product probability distribution on the set of all binary-valued functions. Approximate measures of network sparsity are studied in terms of variational norms tailored to dictionaries of computational units. Bounds on these norms are proven using the Chernoff–Hoeffding bound on sums of independent random variables that need not be identically distributed. Consequences of the probabilistic results for the choice of dictionaries of computational units are derived. It is shown that when a priori knowledge of a type of classification tasks is limited, then the sparsity may be achieved only at the expense of large sizes of dictionaries.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2020
    Electronic addresshttp://dx.doi.org/10.1109/TNNLS.2018.2888517
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.