Adaptive mixture methods based on Bregman divergences
Digital Signal Processing: A Review Journal
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/21144
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. © 2012 Elsevier Inc. All rights reserved.
- Research Paper 7144
Showing items related by title, author, creator and subject.
Tanatar, B.; Erdemir, E. (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 ...
Turgut, E.; Gezici, S. (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 ...
Ozkan H.; Donmez, M.A.; Tunc, S.; Kozat, S.S. (Institute of Electrical and Electronics Engineers Inc., 2015)We analyze an online learning algorithm that adaptively combines outputs of two constituent algorithms (or the experts) running in parallel to estimate an unknown desired signal. This online learning algorithm is shown to ...