2021 IEEE High Performance Extreme Computing Conference (HPEC) 2021
DOI: 10.1109/hpec49654.2021.9622828
|View full text |Cite
|
Sign up to set email alerts
|

An All–at–Once CP Decomposition Method for Count Tensors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…Alternating least squares methods are relatively easy to implement and effective when used with LASSOtype regularization [12,23]. The method of Ranadive et al [55], CP-POPT-DGN, is an allat-once active set trust-region gradient-projection method. CP-POPT-DGN is functionally very similar to CPAPR-PDN.…”
Section: 4mentioning
confidence: 99%
“…Alternating least squares methods are relatively easy to implement and effective when used with LASSOtype regularization [12,23]. The method of Ranadive et al [55], CP-POPT-DGN, is an allat-once active set trust-region gradient-projection method. CP-POPT-DGN is functionally very similar to CPAPR-PDN.…”
Section: 4mentioning
confidence: 99%