.png){kind=icon}
.png){kind=icon}
Return
Fast kernel entropy estimation and optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2004.11.022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Differential entropy is a quantity used in many signal processing problems. Often we need to calculate not only the entropy itself. but also its gradient with respect to various variables, for efficient optimization, sensitivity analysis, etc. Entropy estimation can be based on an estimate of the probability density function, which is computationally costly if done naively. Some prior algorithms use computationally efficient non-parametric entropy estimators. However, differentiation of the previously proposed estimators is difficult and may even be undefined. To counter these obstacles, we consider non-parametric kernel entropy estimation that is differentiable. We present two different accelerated kernel algorithms. The first accelerates the entropy gradient calculation based on a back propagation principle. It allows calculating the differential entropy g.-adient in the same complexity as that of calculating the entropy itself. The second algorithm accelerates the estimation of both entropy and its gradient by using fast convolution over a uniform grid. As an example, we apply both algorithms to blind source separation. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
non-parametric entropy estimation
Parzen windows
automatic differentiation
blind source separation
independent component analysis
mutual information
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
Organization
No organization information available