Yigit Ugur

Mr. Yigit Ugur

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 February 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
YUYigit Ugur
Yigit Ugur
IAInaki Estella Aguerri
Inaki Estella Aguerri
AZAbdellatif Zaidi
Abdellatif Zaidi

13 February 2020 in Entropy
Verified
Journal Article
Open access
PDF file
YUYigit Ugur
Yigit Ugur
GAGeorge Arvanitakis
George Arvanitakis
AZAbdellatif Zaidi
Abdellatif Zaidi
In this paper, we develop an unsupervised generative clustering framework that combines the variational information bottleneck and the Gaussian mixture model. Specifically, in our approach, we use the variational information bottleneck method and model the latent space as a mixture of Gaussians. We derive a bound on the cost function of our model that generalizes the Evidence Lower Bound (ELBO) and provide a variational inference type algorithm that allows computing it. In the algorithm, the coders’ mappings are parametrized using neural networks, and the bound is approximated by Markov sampling and optimized with stochastic gradient descent. Numerical results on real datasets are provided to support the efficiency of our method.

27 February 2020 in arXiv
Verified
Preprint
Open access
PDF file
YUYigit Ugur
Yigit Ugur
GAGeorge Arvanitakis
George Arvanitakis
AZAbdellatif Zaidi
Abdellatif Zaidi
In this paper, we develop an unsupervised generative clustering framework that combines the Variational Information Bottleneck and the Gaussian Mixture Model. Specifically, in our approach, we use the Variational Information Bottleneck method and model the latent space as a mixture of Gaussians. We derive a bound on the cost function of our model that generalizes the Evidence Lower Bound (ELBO) and provide a variational inference type algorithm that allows computing it. In the algorithm, the coders' mappings are parametrized using neural networks, and the bound is approximated by Monte Carlo sampling and optimized with stochastic gradient descent. Numerical results on real datasets are provided to support the efficiency of our method.