Skip to main content

2017 | OriginalPaper | Buchkapitel

Entropic Trace Estimates for Log Determinants

verfasst von : Jack Fitzsimons, Diego Granziol, Kurt Cutajar, Michael Osborne, Maurizio Filippone, Stephen Roberts

Erschienen in: Machine Learning and Knowledge Discovery in Databases

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Code for algorithms proposed in this paper are available at https://​github.​com/​OxfordML/​EntropicTraceEst​imation.
 
Literatur
1.
Zurück zum Zitat Atallah, M.J., Grigorescu, E., Wu, Y.: A lower-variance randomized algorithm for approximate string matching. Inf. Process. Lett. 113(18), 690–692 (2013)MathSciNetCrossRefMATH Atallah, M.J., Grigorescu, E., Wu, Y.: A lower-variance randomized algorithm for approximate string matching. Inf. Process. Lett. 113(18), 690–692 (2013)MathSciNetCrossRefMATH
2.
Zurück zum Zitat Aune, E., Simpson, D.P., Eidsvik, J.: Parameter estimation in high dimensional Gaussian distributions. Stat. Comput. 24(2), 247–263 (2014)MathSciNetCrossRefMATH Aune, E., Simpson, D.P., Eidsvik, J.: Parameter estimation in high dimensional Gaussian distributions. Stat. Comput. 24(2), 247–263 (2014)MathSciNetCrossRefMATH
3.
Zurück zum Zitat Avron, H.: Counting triangles in large graphs using randomized matrix trace estimation. In: Workshop on Large-Scale Data Mining: Theory and Applications, vol. 10, pp. 10–9 (2010) Avron, H.: Counting triangles in large graphs using randomized matrix trace estimation. In: Workshop on Large-Scale Data Mining: Theory and Applications, vol. 10, pp. 10–9 (2010)
4.
Zurück zum Zitat Avron, H., Toledo, S.: Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. J. ACM (JACM) 58(2), 8:1–8:34 (2011)MathSciNetCrossRefMATH Avron, H., Toledo, S.: Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. J. ACM (JACM) 58(2), 8:1–8:34 (2011)MathSciNetCrossRefMATH
5.
Zurück zum Zitat Bai, Z., Golub, G.H.: Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices. Ann. Numer. Math. 4, 29–38 (1997)MathSciNetMATH Bai, Z., Golub, G.H.: Bounds for the trace of the inverse and the determinant of symmetric positive definite matrices. Ann. Numer. Math. 4, 29–38 (1997)MathSciNetMATH
6.
Zurück zum Zitat Bandyopadhyay, K., Bhattacharya, A.K., Biswas, P., Drabold, D.: Maximum entropy and the problem of moments: a stable algorithm. Phys. Rev. E 71(5), 057701 (2005)CrossRef Bandyopadhyay, K., Bhattacharya, A.K., Biswas, P., Drabold, D.: Maximum entropy and the problem of moments: a stable algorithm. Phys. Rev. E 71(5), 057701 (2005)CrossRef
7.
Zurück zum Zitat Boutsidis, C., Drineas, P., Kambadur, P., Zouzias, A.: A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix. CoRR abs/1503.00374 (2015) Boutsidis, C., Drineas, P., Kambadur, P., Zouzias, A.: A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix. CoRR abs/1503.00374 (2015)
8.
Zurück zum Zitat Buchen, P.W., Kelly, M.: The maximum entropy distribution of an asset inferred from option prices. J. Financ. Quant. Anal. 31(01), 143–159 (1996)CrossRef Buchen, P.W., Kelly, M.: The maximum entropy distribution of an asset inferred from option prices. J. Financ. Quant. Anal. 31(01), 143–159 (1996)CrossRef
9.
Zurück zum Zitat Caticha, A.: Entropic Inference and the Foundations of Physics (monograph commissioned by the 11th Brazilian Meeting on Bayesian Statistics-EBEB-2012) (2012) Caticha, A.: Entropic Inference and the Foundations of Physics (monograph commissioned by the 11th Brazilian Meeting on Bayesian Statistics-EBEB-2012) (2012)
10.
Zurück zum Zitat Chen, J., Anitescu, M., Saad, Y.: Computing f(A)b via least squares polynomial approximations. SIAM J. Sci. Comput. 33(1), 195–222 (2011)MathSciNetCrossRefMATH Chen, J., Anitescu, M., Saad, Y.: Computing f(A)b via least squares polynomial approximations. SIAM J. Sci. Comput. 33(1), 195–222 (2011)MathSciNetCrossRefMATH
11.
Zurück zum Zitat Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)MathSciNetMATH Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)MathSciNetMATH
12.
Zurück zum Zitat Fitzsimons, J., Cutajar, K., Osborne, M., Roberts, S., Filippone, M.: Bayesian inference of log determinants (2017) Fitzsimons, J., Cutajar, K., Osborne, M., Roberts, S., Filippone, M.: Bayesian inference of log determinants (2017)
13.
Zurück zum Zitat Fitzsimons, J., Osborne, M., Roberts, S., Fitzsimons, J.: Improved stochastic trace estimation using mutually unbiased bases. arXiv preprint arXiv:1608.00117 (2016) Fitzsimons, J., Osborne, M., Roberts, S., Fitzsimons, J.: Improved stochastic trace estimation using mutually unbiased bases. arXiv preprint arXiv:​1608.​00117 (2016)
14.
Zurück zum Zitat Gershgorin, S.: Uber die Abgrenzung der Eigenwerte einer matrix. Izvestija Akademii Nauk SSSR Serija Matematika 7(3), 749–754 (1931)MATH Gershgorin, S.: Uber die Abgrenzung der Eigenwerte einer matrix. Izvestija Akademii Nauk SSSR Serija Matematika 7(3), 749–754 (1931)MATH
16.
Zurück zum Zitat Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)MATH Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)MATH
17.
Zurück zum Zitat González, D., Davis, S., Gutiérrez, G.: Newtonian dynamics from the principle of maximum caliber. Found. Phys. 44(9), 923–931 (2014)MathSciNetCrossRefMATH González, D., Davis, S., Gutiérrez, G.: Newtonian dynamics from the principle of maximum caliber. Found. Phys. 44(9), 923–931 (2014)MathSciNetCrossRefMATH
18.
Zurück zum Zitat Granziol, D., Roberts, S.: An information and field theoretic approach to the grand canonical ensemble (2017) Granziol, D., Roberts, S.: An information and field theoretic approach to the grand canonical ensemble (2017)
19.
Zurück zum Zitat Guinness, J., Ipsen, I.C.F.: Efficient computation of Gaussian likelihoods for stationary Markov random fields (2015) Guinness, J., Ipsen, I.C.F.: Efficient computation of Gaussian likelihoods for stationary Markov random fields (2015)
20.
Zurück zum Zitat Han, I., Malioutov, D., Shin, J.: Large-scale log-determinant computation through stochastic Chebyshev expansions. In: Bach, F.R., Blei, D.M. (eds.) Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6–11 July 2015 Han, I., Malioutov, D., Shin, J.: Large-scale log-determinant computation through stochastic Chebyshev expansions. In: Bach, F.R., Blei, D.M. (eds.) Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6–11 July 2015
21.
Zurück zum Zitat Hutchinson, M.: A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Commun. Stat. - Simul. Comput. 19(2), 433–450 (1990)MathSciNetCrossRefMATH Hutchinson, M.: A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Commun. Stat. - Simul. Comput. 19(2), 433–450 (1990)MathSciNetCrossRefMATH
23.
Zurück zum Zitat Lindgren, F., Rue, H., Lindström, J.: An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach. J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.) 73(4), 423–498 (2011)MathSciNetCrossRefMATH Lindgren, F., Rue, H., Lindström, J.: An explicit link between Gaussian fields and Gaussian Markov random fields: the stochastic partial differential equation approach. J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.) 73(4), 423–498 (2011)MathSciNetCrossRefMATH
25.
Zurück zum Zitat Meurer, A., Smith, C.P., Paprocki, M., Čertík, O., Kirpichev, S.B., Rocklin, M., Kumar, A., Ivanov, S., Moore, J.K., Singh, S., Rathnayake, T., Vig, S., Granger, B.E., Muller, R.P., Bonazzi, F., Gupta, H., Vats, S., Johansson, F., Pedregosa, F., Curry, M.J., Terrel, A.R., Roučka, Š., Saboo, A., Fernando, I., Kulal, S., Cimrman, R., Scopatz, A.: SymPy: symbolic computing in Python. PeerJ Comput. Sci. 3, e103 (2017). https://doi.org/10.7717/peerj-cs.103 CrossRef Meurer, A., Smith, C.P., Paprocki, M., Čertík, O., Kirpichev, S.B., Rocklin, M., Kumar, A., Ivanov, S., Moore, J.K., Singh, S., Rathnayake, T., Vig, S., Granger, B.E., Muller, R.P., Bonazzi, F., Gupta, H., Vats, S., Johansson, F., Pedregosa, F., Curry, M.J., Terrel, A.R., Roučka, Š., Saboo, A., Fernando, I., Kulal, S., Cimrman, R., Scopatz, A.: SymPy: symbolic computing in Python. PeerJ Comput. Sci. 3, e103 (2017). https://​doi.​org/​10.​7717/​peerj-cs.​103 CrossRef
27.
Zurück zum Zitat Neri, C., Schneider, L.: Maximum entropy distributions inferred from option portfolios on an asset. Finan. Stochast. 16(2), 293–318 (2012)MathSciNetCrossRefMATH Neri, C., Schneider, L.: Maximum entropy distributions inferred from option portfolios on an asset. Finan. Stochast. 16(2), 293–318 (2012)MathSciNetCrossRefMATH
28.
Zurück zum Zitat Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002) Nielsen, M.A., Chuang, I.: Quantum computation and quantum information (2002)
31.
Zurück zum Zitat Rasmussen, C.E., Williams, C.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2006)MATH Rasmussen, C.E., Williams, C.: Gaussian Processes for Machine Learning. MIT Press, Cambridge (2006)MATH
32.
Zurück zum Zitat Rue, H., Held, L.: Gaussian Markov Random Fields: Theory and Applications, Monographs on Statistics and Applied Probability, vol. 104. Chapman & Hall, London (2005)MATH Rue, H., Held, L.: Gaussian Markov Random Fields: Theory and Applications, Monographs on Statistics and Applied Probability, vol. 104. Chapman & Hall, London (2005)MATH
33.
Zurück zum Zitat Saatçi, Y.: Scalable inference for structured Gaussian process models. Ph.D. thesis, University of Cambridge (2011) Saatçi, Y.: Scalable inference for structured Gaussian process models. Ph.D. thesis, University of Cambridge (2011)
34.
Zurück zum Zitat Shore, J., Johnson, R.: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Trans. Inf. Theory 26(1), 26–37 (1980)MathSciNetCrossRefMATH Shore, J., Johnson, R.: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Trans. Inf. Theory 26(1), 26–37 (1980)MathSciNetCrossRefMATH
35.
Zurück zum Zitat Ubaru, S., Chen, J., Saad, Y.: Fast estimation of tr(F(A)) via stochastic Lanczos quadrature (2016) Ubaru, S., Chen, J., Saad, Y.: Fast estimation of tr(F(A)) via stochastic Lanczos quadrature (2016)
36.
Zurück zum Zitat Wainwright, M.J., Jordan, M.I.: Log-determinant relaxation for approximate inference in discrete Markov random fields. IEEE Trans. Signal Process. 54(6–1), 2099–2109 (2006)CrossRefMATH Wainwright, M.J., Jordan, M.I.: Log-determinant relaxation for approximate inference in discrete Markov random fields. IEEE Trans. Signal Process. 54(6–1), 2099–2109 (2006)CrossRefMATH
Metadaten
Titel
Entropic Trace Estimates for Log Determinants
verfasst von
Jack Fitzsimons
Diego Granziol
Kurt Cutajar
Michael Osborne
Maurizio Filippone
Stephen Roberts
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-71249-9_20