Adaptive mixture methods based on Bregman divergences
Digital Signal Processing: A Review Journal
86 - 97
Item Usage Stats
We investigate adaptive mixture methods that linearly combine outputs of m constituent filters running in parallel to model a desired signal. We use Bregman divergences and obtain certain multiplicative updates to train the linear combination weights under an affine constraint or without any constraints. We use unnormalized relative entropy and relative entropy to define two different Bregman divergences that produce an unnormalized exponentiated gradient update and a normalized exponentiated gradient update on the mixture weights, respectively. We then carry out the mean and the mean-square transient analysis of these adaptive algorithms when they are used to combine outputs of m constituent filters. We illustrate the accuracy of our results and demonstrate the effectiveness of these updates for sparse mixture systems.
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.dsp.2012.09.006
Showing items related by title, author, creator and subject.
Turgut, Esma; Gezici, Sinan (IEEE, 2013)In this paper, spectrum sensing in cognitive radio systems is studied for non-Gaussian channels in the presence of prior distribution uncertainty. In most practical cases, some amount of prior information about signals of ...
Tanatar, Bilal; Erdemir, E. (Elsevier Science B.V., 2003)The density profiles of bosonic and fermionic components in a system of trapped two-dimensional (2D) boson-fermion (BF) mixture are studied. We employ the variational approach to minimize the total energy functional of the ...
Mercan, Caner (Bilkent University, 2014-07)Density estimation is the process of estimating the parameters of a probability density function from data. The Gaussian mixture model (GMM) is one of the most preferred density families. We study the estimation of a ...