2017
DOI: 10.48550/arxiv.1704.07223
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Entropic Trace Estimates for Log Determinants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…We note that there exist methods to estimate log-determinants of matrices based on power series expansions (e.g. Han et al 2015;Fitzsimons et al 2017;Granziol et al 2018). However, these methods rely on stochastic trace estimations using random probing vectors.…”
Section: Log-determinant Approximationmentioning
confidence: 99%
“…We note that there exist methods to estimate log-determinants of matrices based on power series expansions (e.g. Han et al 2015;Fitzsimons et al 2017;Granziol et al 2018). However, these methods rely on stochastic trace estimations using random probing vectors.…”
Section: Log-determinant Approximationmentioning
confidence: 99%
“…For the problem of log determinant, this signifies that the entropy of the spectral approximation should decrease with the addition of every moment constraint. We implement the MaxEnt algorithm proposed in Bandyopadhyay et al [2], which we refer to as OMxnt, in the same manner as applied for log determinant estimation in Fitzsimons et al [30], and compare it against the proposed MEMe approach. Specifically, we show results on the Ecology dataset [31], with n = 999, 999, for which the true log determinant can be calculated.…”
Section: Log Determinant Estimation On Real Datamentioning
confidence: 99%