{"id":"https://openalex.org/W7160414908","doi":"https://doi.org/10.48550/arxiv.2605.03736","title":"Low Rank Tensor Completion via Adaptive ADMM","display_name":"Low Rank Tensor Completion via Adaptive ADMM","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160414908","doi":"https://doi.org/10.48550/arxiv.2605.03736"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03736","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03736","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.03736","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092581977","display_name":"Niclas F\u00fchrling","orcid":"https://orcid.org/0000-0003-1942-8691"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F\u00fchrling, Niclas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097335689","display_name":"Getuar Rexhepi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rexhepi, Getuar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135452195","display_name":"Giuseppe Thadeu Freitas de Abreu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Abreu, Giuseppe Thadeu Freitas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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":0.5121999979019165,"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.5121999979019165,"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.45500001311302185,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.005900000222027302,"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/matrix-completion","display_name":"Matrix completion","score":0.6819999814033508},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6816999912261963},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6499999761581421},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.599399983882904},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.5863999724388123},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5008999705314636},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4779999852180481},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.42989999055862427},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.4250999987125397}],"concepts":[{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.6819999814033508},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6816999912261963},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6499999761581421},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.599399983882904},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.5863999724388123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.567799985408783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5311999917030334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5151000022888184},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5008999705314636},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4779999852180481},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.42309999465942383},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3709999918937683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35420000553131104},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.31869998574256897},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C139945424","wikidata":"https://www.wikidata.org/wiki/Q1940696","display_name":"Mean squared error","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C117765406","wikidata":"https://www.wikidata.org/wiki/Q5362437","display_name":"Generalization error","level":3,"score":0.26170000433921814},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2556999921798706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03736","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03736","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.03736","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03736","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.40632322430610657,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2,14,126,132],"novel":[3],"algorithm,":[4],"for":[5],"the":[6,28,39,51,88,92,97,101,114,129,145,148,151],"completion":[7,23],"of":[8,16,43,72,91,100,106,128,150],"partially":[9],"observed":[10],"low-rank":[11,21,34],"tensors,":[12],"as":[13,123,125],"generalization":[15],"matrix":[17,133],"completion.":[18],"The":[19],"proposed":[20],"tensor":[22],"(TC)":[24],"method":[25,42,103],"builds":[26],"on":[27],"conventional":[29,115],"nuclear":[30],"norm":[31],"(NN)":[32],"minimization-based":[33],"TC":[35],"paradigm,":[36],"by":[37,143],"leveraging":[38],"alternating":[40],"direction":[41],"multipliers":[44],"(ADMM)":[45],"optimization":[46],"framework.":[47],"To":[48],"that":[49],"extend":[50],"original":[52],"NN":[53,120],"minimization":[54,121],"problem":[55],"is":[56],"reformulated":[57],"into":[58],"multiple":[59],"subproblems,":[60],"which":[61],"are":[62],"then":[63],"solved":[64],"iteratively":[65],"via":[66],"closed-form":[67],"proximal":[68],"operators,":[69],"making":[70],"use":[71],"over-relaxation":[73],"and":[74,86],"an":[75],"adaptive":[76],"penalty":[77],"parameter":[78],"update":[79],"scheme,":[80],"to":[81,113],"further":[82],"speed":[83],"up":[84],"convergence":[85,138],"improve":[87],"overall":[89],"performance":[90,99],"method.":[93],"Simulation":[94],"results":[95],"demonstrate":[96],"superior":[98],"new":[102],"in":[104],"terms":[105],"normalized":[107],"mean":[108],"square":[109],"error":[110],"(NMSE),":[111],"compared":[112],"state-of-the-art":[116],"(SotA)":[117],"techniques,":[118],"including":[119],"approaches,":[122],"well":[124],"mixture":[127],"latter":[130],"with":[131,147],"factorization":[134],"approach,":[135],"while":[136],"its":[137],"can":[139],"be":[140],"significantly":[141],"improved":[142],"initializing":[144],"algorithm":[146],"solution":[149],"SotA.":[152]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-07T00:00:00"}