.png){kind=icon}
返回
Quantized Minimum Error Entropy Criterion
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2018.2868812.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Comparing with traditional learning criteria, such as mean square error, the minimum error entropy (MEE) criterion is superior in nonlinear and non-Gaussian signal processing and machine learning. The argument of the logarithm in Renyi's entropy estimator, called information potential (IP), is a popular MEE cost in information theoretic learning. The computational complexity of IP is, however, quadratic in terms of sample number due to double summation. This creates the computational bottlenecks, especially for large-scale data sets. To address this problem, in this paper, we propose an efficient quantization approach to reduce the computational burden of IP, which decreases the complexity from O(N-2) to O(MN) with M << N. The new learning criterion is called the quantized MEE (QMEE). Some basic properties of QMEE are presented. Illustrative examples with linear-in-parameter models are provided to verify the excellent performance of QMEE.
Keyword:
Computational complexity
information theoretic learning (ITL)
minimum error entropy (MEE)
quantization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
引用论文
Tuberculosis control in resource-poor countries: alternative approaches in the era of HIV.png)
The Lancet
The LancetIF0
PREAI
分享收藏Productivity enhancement of solar still by PCM and Nanoparticles miscellaneous basin absorbing materialsDesalinationOAAI
DesalinationIF0
OAAI分享收藏PECVD-grown carbon nanotubes on silicon substrates with a nickel-seeded tip-growth structure具有镍种子尖端生长结构的硅衬底上的PECVD生长的碳纳米管
PREAI
分享收藏
查看更多内容