.png){kind=icon}
返回
Classification by Sparse Neural Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2018.2888517.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The 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.
Keyword:
Binary classification
Chernoff-Hoeffding bound
dictionaries of computational units
feedforward networks
measures of sparsity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
.png){kind=icon}
Cytosine DNA methylation influences drug resistance inEscherichia colithrough increasedsugEexpression胞嘧啶DNA甲基化通过增加 sugE 表达来影响 大肠杆菌 的耐药性
OAAI
OAAI分享收藏Real-time and offline techniques for identifying obstructive sleep apnea patients用于识别阻塞性睡眠呼吸暂停患者的实时和离线技术
PREAI
分享收藏分享收藏
查看更多内容