no code implementations • 6 Sep 2022 • F. Serhan Daniş, A. Teoman Naskali, A. Taylan Cemgil, Cem Ersoy
The technique implements an augmented reality (AR) based positioning system that is used to annotate the wireless signal parameter data samples with high precision position data.
1 code implementation • 7 Dec 2020 • A. Taylan Cemgil, Sumedh Ghaisas, Krishnamurthy Dvijotham, Sven Gowal, Pushmeet Kohli
We provide experimental results on the ColorMnist and CelebA benchmark datasets that quantify the properties of the learned representations and compare the approach with a baseline that is specifically trained for the desired property.
no code implementations • ICML 2018 • Umut Şimşekli, Çağatay Yıldız, Thanh Huy Nguyen, Gaël Richard, A. Taylan Cemgil
The results support our theory and show that the proposed algorithm provides a significant speedup over the recently proposed synchronous distributed L-BFGS algorithm.
no code implementations • 10 Feb 2016 • Umut Şimşekli, Roland Badeau, A. Taylan Cemgil, Gaël Richard
These second order methods directly approximate the inverse Hessian by using a limited history of samples and their gradients.
no code implementations • 5 Sep 2015 • Kamer Kaya, Figen Öztoprak, Ş. İlker Birbil, A. Taylan Cemgil, Umut Şimşekli, Nurdan Kuru, Hazal Koptagel, M. Kaan Öztürk
We propose HAMSI (Hessian Approximated Multiple Subsets Iteration), which is a provably convergent, second order incremental algorithm for solving large-scale partially separable optimization problems.
no code implementations • 3 Jun 2015 • Umut Şimşekli, Hazal Koptagel, Hakan Güldaş, A. Taylan Cemgil, Figen Öztoprak, Ş. İlker Birbil
For large matrix factorisation problems, we develop a distributed Markov Chain Monte Carlo (MCMC) method based on stochastic gradient Langevin dynamics (SGLD) that we call Parallel SGLD (PSGLD).
no code implementations • 29 Sep 2014 • Beyza Ermis, A. Taylan Cemgil
Probabilistic approaches for tensor factorization aim to extract meaningful structure from incomplete data by postulating low rank constraints.
no code implementations • 11 Jan 2014 • Sinan Yildirim, A. Taylan Cemgil, Sumeetpal S. Singh
In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters.