{"id":"https://openalex.org/W2582365613","doi":"https://doi.org/10.1137/17m1112303","title":"A Practical Randomized CP Tensor Decomposition","display_name":"A Practical Randomized CP Tensor Decomposition","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2582365613","doi":"https://doi.org/10.1137/17m1112303","mag":"2582365613"},"language":"en","primary_location":{"id":"doi:10.1137/17m1112303","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1112303","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.06600","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Casey Battaglino","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Casey Battaglino","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Grey Ballard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grey Ballard","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Tamara G. Kolda","orcid":"https://orcid.org/0000-0003-4176-2493"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tamara G. Kolda","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6737,"has_fulltext":false,"cited_by_count":159,"citation_normalized_percentile":{"value":0.98626374,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"39","issue":"2","first_page":"876","last_page":"901"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9682000279426575,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9682000279426575,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0052999998442828655,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.0031999999191612005,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/overdetermined-system","display_name":"Overdetermined system","score":0.8841000199317932},{"id":"https://openalex.org/keywords/tensor-product","display_name":"Tensor product","score":0.6283000111579895},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.602400004863739},{"id":"https://openalex.org/keywords/linear-least-squares","display_name":"Linear least squares","score":0.5113999843597412},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.5045999884605408},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.49219998717308044},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.44130000472068787},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4271000027656555},{"id":"https://openalex.org/keywords/numerical-linear-algebra","display_name":"Numerical linear algebra","score":0.3790999948978424}],"concepts":[{"id":"https://openalex.org/C81901731","wikidata":"https://www.wikidata.org/wiki/Q331348","display_name":"Overdetermined system","level":2,"score":0.8841000199317932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7802000045776367},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.6283000111579895},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.602400004863739},{"id":"https://openalex.org/C58663186","wikidata":"https://www.wikidata.org/wiki/Q6553462","display_name":"Linear least squares","level":3,"score":0.5113999843597412},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.5045999884605408},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.49219998717308044},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.44130000472068787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43140000104904175},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4309999942779541},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C163834973","wikidata":"https://www.wikidata.org/wiki/Q2004891","display_name":"Numerical linear algebra","level":3,"score":0.3790999948978424},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.37389999628067017},{"id":"https://openalex.org/C130956294","wikidata":"https://www.wikidata.org/wiki/Q2101158","display_name":"Polar decomposition","level":3,"score":0.35019999742507935},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C45923927","wikidata":"https://www.wikidata.org/wiki/Q3319230","display_name":"Non-linear least squares","level":3,"score":0.28630000352859497},{"id":"https://openalex.org/C169241690","wikidata":"https://www.wikidata.org/wiki/Q7828122","display_name":"Total least squares","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C84545080","wikidata":"https://www.wikidata.org/wiki/Q1147936","display_name":"Condition number","level":3,"score":0.28119999170303345},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C126090379","wikidata":"https://www.wikidata.org/wiki/Q6094424","display_name":"Iteratively reweighted least squares","level":4,"score":0.2556999921798706},{"id":"https://openalex.org/C49766605","wikidata":"https://www.wikidata.org/wiki/Q207643","display_name":"Linear map","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/17m1112303","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1112303","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Matrix Analysis and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1701.06600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.06600","pdf_url":"https://arxiv.org/pdf/1701.06600","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.06600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.06600","pdf_url":"https://arxiv.org/pdf/1701.06600","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1963826206","https://openalex.org/W1993482030","https://openalex.org/W2000215628","https://openalex.org/W2005741518","https://openalex.org/W2007399394","https://openalex.org/W2008114373","https://openalex.org/W2008776938","https://openalex.org/W2008972618","https://openalex.org/W2024165284","https://openalex.org/W2037271374","https://openalex.org/W2044777402","https://openalex.org/W2047680880","https://openalex.org/W2061370212","https://openalex.org/W2086064090","https://openalex.org/W2099641086","https://openalex.org/W2107599050","https://openalex.org/W2108138101","https://openalex.org/W2119741678","https://openalex.org/W2124608575","https://openalex.org/W2157382843","https://openalex.org/W2159745673","https://openalex.org/W2258054274","https://openalex.org/W2282347063","https://openalex.org/W2964341462","https://openalex.org/W3112410551"],"related_works":[],"abstract_inverted_index":{"The":[0,14],"CANDECOMP/PARAFAC":[1],"(CP)":[2],"decomposition":[3,23],"is":[4],"a":[5,26,55,72],"leading":[6],"method":[7],"for":[8,20,62,85,107],"the":[9,21,46,87,96,101],"analysis":[10],"of":[11,28,48,75],"multiway":[12],"data.":[13],"standard":[15],"alternating":[16],"least":[17,32,38,69],"squares":[18,33,39,70],"algorithm":[19],"CP":[22],"(CP-ALS)":[24],"involves":[25],"series":[27],"highly":[29],"overdetermined":[30],"linear":[31],"problems.":[34],"We":[35,59,90],"extend":[36],"randomized":[37,68],"methods":[40],"to":[41,126],"tensors":[42],"and":[43,66,122],"show":[44,92],"that":[45,95],"workload":[47],"CP-ALS":[49,102],"can":[50],"be":[51],"drastically":[52],"reduced":[53],"without":[54],"sacrifice":[56],"in":[57,116,119],"quality.":[58],"introduce":[60],"techniques":[61],"efficiently":[63],"preprocessing,":[64],"sampling,":[65],"computing":[67],"on":[71],"dense":[73],"tensor":[74],"arbitrary":[76],"order,":[77],"as":[78,80],"well":[79],"an":[81],"efficient":[82],"sampling-based":[83],"technique":[84],"checking":[86],"stopping":[88],"condition.":[89],"also":[91],"more":[93],"generally":[94],"Khatri--Rao":[97],"product":[98],"(used":[99],"within":[100],"iteration)":[103],"produces":[104],"conditions":[105],"favorable":[106],"direct":[108],"sampling.":[109],"In":[110],"numerical":[111],"results,":[112],"we":[113],"see":[114],"improvements":[115],"speed,":[117],"reductions":[118],"memory":[120],"requirements,":[121],"robustness":[123],"with":[124],"respect":[125],"initialization.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":14},{"year":2024,"cited_by_count":26},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":34},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-02-03T00:00:00"}