2022
DOI: 10.1109/tsp.2022.3233724
|View full text |Cite
|
Sign up to set email alerts
|

Computationally Efficient Approximations for Matrix-Based Rényi's Entropy

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 43 publications
0
1
0
Order By: Relevance
“…As shown in Figure 8, the time consumption of the estimators scales up with an increase in sample size. Because of the trace operator on Gram matrix (G) to power α (tr(G α )) in TE θ kα , it poses a great challenge in terms of both storage and computing when using TE θ kα in practice [45]. In TE θ bin , a sample binning method rather than more complex technology is used to reconstruct the time series state-space, so, compared with other methods, the time cost of TE θ bin is within an acceptable range.…”
Section: Discussionmentioning
confidence: 99%
“…As shown in Figure 8, the time consumption of the estimators scales up with an increase in sample size. Because of the trace operator on Gram matrix (G) to power α (tr(G α )) in TE θ kα , it poses a great challenge in terms of both storage and computing when using TE θ kα in practice [45]. In TE θ bin , a sample binning method rather than more complex technology is used to reconstruct the time series state-space, so, compared with other methods, the time cost of TE θ bin is within an acceptable range.…”
Section: Discussionmentioning
confidence: 99%