Chebyshev Center Computation on Probability Simplex With alpha-Divergence Measure

Date

2020-01-01

Author

Candan, Çağatay

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

163
views

0
downloads

Chebyshev center computation problem, i.e. finding the point which is at minimum distance to a set of given points, on the probability simplex with alpha-divergence distancemeasure is studied. The proposed solution generalizes the ArimotoBlahut (AB) algorithm utilizing Kullback-Leibler divergence to alpha-divergence, and reduces to the AB method as a. 1. Similar to the AB algorithm, themethod is an ascent method with a guarantee onthe objective value (alpha-mutual information or Chebyshev radius) improvement at every iteration. A practical application area for the method is the fusion of probability mass functions lacking a joint probability description. Another application area is the error exponent calculation.

Subject Keywords

Signal Processing, Electrical and Electronic Engineering, Applied Mathematics

URI

https://hdl.handle.net/11511/37796

Journal

IEEE SIGNAL PROCESSING LETTERS

DOI

https://doi.org/10.1109/lsp.2020.3018661

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Chebyshev spectral collocation method approximations of the Stokes eigenvalue problem based on penalty techniques Türk, Önder (Elsevier BV, 2019-11-01) Numerical solution strategies for the Stokes eigenvalue problem based on the use of penalty formulations are investigated in this study. It is shown that the penalty method approach can successfully be adapted for the eigenproblem to rectify the associated problems such as the existence of zero diagonal entries in the resulting algebraic system. Two different schemes, namely, the standard penalisation with a small penalty parameter, and the iterative penalisation that enables relatively large parameters, ar...
On higher order approximations for hermite-gaussian functions and discrete fractional Fourier transforms Candan, Çağatay (Institute of Electrical and Electronics Engineers (IEEE), 2007-10-01) Discrete equivalents of Hermite-Gaussian functions play a critical role in the definition of a discrete fractional Fourier transform. The discrete equivalents are typically calculated through the eigendecomposition of a commutator matrix. In this letter, we first characterize the space of DFT-commuting matrices and then construct matrices approximating the Hermite-Gaussian generating differential equation and use the matrices to accurately generate the discrete equivalents of Hermite-Gaussians.
Factor Graph Based LMMSE Filtering for Colored Gaussian Processes Sen, Pinar; Yılmaz, Ali Özgür (Institute of Electrical and Electronics Engineers (IEEE), 2014-10-01) We propose a reduced complexity, graph based linear minimum mean square error (LMMSE) filter in which the non-white statistics of a random noise process are taken into account. Our method corresponds to block LMMSE filtering, and has the advantage of complexity linearly increasing with the block length and the ease of incorporating the a priori information of the input signals whenever possible. The proposed method can be used with any random process with a known autocorrelation function by use of an approx...
Properly Handling Complex Differentiation in Optimization and Approximation Problems Candan, Çağatay (Institute of Electrical and Electronics Engineers (IEEE), 2019-03-01) Functions of complex variables arise frequently in the formulation of signal processing problems. The basic calculus rules on differentiation and integration for functions of complex variables resemble, but are not identical to, the rules of their real variable counterparts. On the contrary, the standard calculus rules on differentiation, integration, series expansion, and so on are the special cases of the complex analysis with the restriction of the complex variable to the real line. The goal of this lect...
Maximum likelihood estimation of transition probabilities of jump Markov linear systems Orguner, Umut (Institute of Electrical and Electronics Engineers (IEEE), 2008-10-01) This paper describes an online maximum likelihood estimator for the transition probabilities associated with a jump Markov linear system (JMLS). The maximum likelihood estimator is derived using the reference probability method, which exploits an hypothetical probability measure to find recursions for complex expectations. Expectation maximization (EM) procedure is utilized for maximizing the likelihood function. In order to avoid the exponential increase in the number of statistics of the optimal EM algori...

Citation Formats

Ç. Candan, “Chebyshev Center Computation on Probability Simplex With alpha-Divergence Measure,” IEEE SIGNAL PROCESSING LETTERS, pp. 1515–1519, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37796.