{"id":"https://openalex.org/W7225622769","doi":"https://doi.org/10.5281/zenodo.24082495","title":"A cross-based alternating least squares method for CP tensor decomposition","display_name":"A cross-based alternating least squares method for CP tensor decomposition","publication_year":2026,"publication_date":"2026-11-09","ids":{"openalex":"https://openalex.org/W7225622769","doi":"https://doi.org/10.5281/zenodo.24082495"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24082495","doi":"https://doi.org/10.5281/zenodo.24082495","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24082495","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24082495","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060985095","display_name":"Peter Benner","orcid":"https://orcid.org/0000-0003-3362-4103","observed_orcids":["https://orcid.org/0000-0003-3362-4103"]},"institutions":[{"id":"https://openalex.org/I4210127568","display_name":"Max Planck Institute for Dynamics of Complex Technical Systems","ror":"https://ror.org/030h7k016","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210127568"]},{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Benner, Peter","raw_affiliation_strings":["Otto-von-Guericke-Universit\u00e4t Magdeburg","Max Planck Institute for Dynamics of Complex Technical Systems"],"raw_orcid":"https://orcid.org/0000-0003-3362-4103","affiliations":[{"raw_affiliation_string":"Otto-von-Guericke-Universit\u00e4t Magdeburg","institution_ids":["https://openalex.org/I95793202"]},{"raw_affiliation_string":"Max Planck Institute for Dynamics of Complex Technical Systems","institution_ids":["https://openalex.org/I4210127568"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020508243","display_name":"Bonan Sun","orcid":"https://orcid.org/0000-0002-7852-2920","observed_orcids":["https://orcid.org/0000-0002-7852-2920","https://orcid.org/0009-0002-2761-0661"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Bonan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0002-2761-0661","affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":1.0,"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":1.0,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/alternating-least-squares","display_name":"alternating least squares","score":0.890999972820282},{"id":"https://openalex.org/keywords/hierarchical-sampling","display_name":"hierarchical sampling","score":0.7440000176429749},{"id":"https://openalex.org/keywords/khatri-rao-product","display_name":"Khatri-Rao product","score":0.9509999752044678},{"id":"https://openalex.org/keywords/deterministic-sampling","display_name":"deterministic sampling","score":0.6010000109672546},{"id":"https://openalex.org/keywords/computational-cost-reduction","display_name":"computational complexity reduction","score":0.6729999780654907}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6434999704360962},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.6032999753952026},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5902000069618225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5712000131607056},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.557699978351593},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4625999927520752},{"id":"https://openalex.org/C58663186","wikidata":"https://www.wikidata.org/wiki/Q6553462","display_name":"Linear least squares","level":3,"score":0.4595000147819519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43950000405311584},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.4196999967098236},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3880999982357025},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3718999922275543},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C165838908","wikidata":"https://www.wikidata.org/wiki/Q736777","display_name":"Calibration","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3084999918937683},{"id":"https://openalex.org/C169241690","wikidata":"https://www.wikidata.org/wiki/Q7828122","display_name":"Total least squares","level":3,"score":0.3034999966621399},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.29179999232292175},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C126090379","wikidata":"https://www.wikidata.org/wiki/Q6094424","display_name":"Iteratively reweighted least squares","level":4,"score":0.2865000069141388},{"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/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C188649462","wikidata":"https://www.wikidata.org/wiki/Q2246261","display_name":"Generalized least squares","level":3,"score":0.2565999925136566},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2563999891281128}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.24082495","doi":"https://doi.org/10.5281/zenodo.24082495","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24082495","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.5281/zenodo.24082496","doi":"https://doi.org/10.5281/zenodo.24082496","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24082496","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24082495","doi":"https://doi.org/10.5281/zenodo.24082495","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24082495","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2582365613","https://openalex.org/W2552210686","https://openalex.org/W3207715399","https://openalex.org/W4286904076","https://openalex.org/W2666740842","https://openalex.org/W7171382828","https://openalex.org/W4381799528","https://openalex.org/W3212664077","https://openalex.org/W4388295765","https://openalex.org/W4416608656"],"abstract_inverted_index":{"Canonical":[0],"Polyadic":[1],"(CP)":[2],"tensor":[3,31],"decomposition":[4],"is":[5],"a":[6,73,92,117],"fundamental":[7],"tool":[8],"for":[9,23,112],"analyzing":[10],"high-dimensional":[11],"data.":[12],"The":[13],"standard":[14,133],"Alternating":[15],"Least":[16],"Squares":[17],"(ALS)":[18],"algorithm":[19],"becomes":[20],"computationally":[21],"prohibitive":[22],"large-scale":[24],"tensors":[25],"as":[26],"it":[27],"requires":[28],"accessing":[29],"all":[30],"entries":[32],"to":[33,53,85,105,126,132],"solve":[34,54],"the":[35,67,79,107,123,143],"linear":[36],"least":[37,57],"squares":[38,58],"subproblems":[39],"at":[40],"each":[41,113],"iteration.":[42],"To":[43],"mitigate":[44],"this":[45,88],"cost,":[46],"randomized":[47,135],"sampling":[48,68,119],"methods":[49],"have":[50],"been":[51],"introduced":[52],"smaller,":[55],"sampled":[56],"problems.":[59],"However,":[60],"these":[61,129],"approaches":[62],"often":[63],"depend":[64],"heavily":[65],"on":[66],"distribution":[69],"and":[70,134],"typically":[71],"require":[72],"sample":[74],"size":[75],"significantly":[76,146],"larger":[77],"than":[78],"target":[80],"rank":[81],"($s":[82],"\\gg":[83],"k$)":[84],"ensure":[86],"accuracy.In":[87],"talk,":[89],"we":[90],"present":[91],"novel":[93],"deterministic":[94],"cross-based":[95],"ALS":[96,136],"method":[97,139],"(CP-ACLS)":[98],"that":[99,121],"utilizes":[100],"maximum":[101],"volume-based":[102],"pivot":[103],"selection":[104],"identify":[106],"most":[108],"$R$":[109],"informative":[110],"rows":[111],"subproblem.":[114],"We":[115],"propose":[116],"hierarchical":[118],"strategy":[120],"exploits":[122],"Khatri-Rao":[124],"structure":[125],"efficiently":[127],"select":[128],"pivots.":[130],"Compared":[131],"approaches,":[137],"our":[138],"can":[140],"potentially":[141],"reduce":[142],"computational":[144],"cost":[145],"without":[147],"sacrificing":[148],"accuracy":[149]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-11-10T00:00:00"}