The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models and many others. In this work, we estimate log determinants under the framework of maximum entropy, given information in the form of moment constraints from stochastic trace estimation. The estimates demonstrate a significant improvement on state-of-the-art alternative methods, as shown on a wide variety of matrices from the SparseSuite Matrix Collection. By taking the example of a general Markov random field, we also demonstrate how this approach can significantly accelerate inference in large-scale learning methods involving the log determinant.
CITATION STYLE
Fitzsimons, J., Granziol, D., Cutajar, K., Osborne, M., Filippone, M., & Roberts, S. (2017). Entropic Trace Estimates for Log Determinants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10534 LNAI, pp. 323–338). Springer Verlag. https://doi.org/10.1007/978-3-319-71249-9_20
Mendeley helps you to discover research relevant for your work.