Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and machine learning. With few recent exceptions, all tensor factorization algorithms were originally developed for centralized, in-memory compu...
Uloženo v:
| Vydáno v: | IEEE transactions on signal processing Ročník 63; číslo 20; s. 5450 - 5463 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
15.10.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1053-587X, 1941-0476 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and machine learning. With few recent exceptions, all tensor factorization algorithms were originally developed for centralized, in-memory computation on a single machine; and the few that break away from this mold do not easily incorporate practically important constraints, such as non-negativity. A new constrained tensor factorization framework is proposed in this paper, building upon the Alternating Direction Method of Multipliers (ADMoM). It is shown that this simplifies computations, bypassing the need to solve constrained optimization problems in each iteration; and it naturally leads to distributed algorithms suitable for parallel implementation. This opens the door for many emerging big data-enabled applications. The methodology is exemplified using non-negativity as a baseline constraint, but the proposed framework can incorporate many other types of constraints. Numerical experiments are encouraging, indicating that ADMoM-based non-negative tensor factorization (NTF) has high potential as an alternative to state-of-the-art approaches. |
|---|---|
| AbstractList | Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and machine learning. With few recent exceptions, all tensor factorization algorithms were originally developed for centralized, in-memory computation on a single machine; and the few that break away from this mold do not easily incorporate practically important constraints, such as non-negativity. A new constrained tensor factorization framework is proposed in this paper, building upon the Alternating Direction Method of Multipliers (ADMoM). It is shown that this simplifies computations, bypassing the need to solve constrained optimization problems in each iteration; and it naturally leads to distributed algorithms suitable for parallel implementation. This opens the door for many emerging big data-enabled applications. The methodology is exemplified using non-negativity as a baseline constraint, but the proposed framework can incorporate many other types of constraints. Numerical experiments are encouraging, indicating that ADMoM-based non-negative tensor factorization (NTF) has high potential as an alternative to state-of-the-art approaches. |
| Author | Sidiropoulos, Nicholas D. Liavas, Athanasios P. |
| Author_xml | – sequence: 1 givenname: Athanasios P. surname: Liavas fullname: Liavas, Athanasios P. email: liavas@telecom.tuc.gr organization: Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania, Greece – sequence: 2 givenname: Nicholas D. surname: Sidiropoulos fullname: Sidiropoulos, Nicholas D. email: nikos@ece.umn.edu organization: Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA |
| BookMark | eNp9kMFLwzAUh4NMcJveBS8Fz51Jk6btcUynwoYDJ3grafq6ZWTNTDJB_3rTbXjw4Ckvyfc93vsNUK81LSB0TfCIEFzcLV8XowSTdJSwlLGMn6E-KRiJcah7ocYpjdM8e79AA-c2GBPGCt5H64WwQmvQ0VivjFV-vXVRY2w0Ma3zVqgW6mgJrQtPUyF9QL6FV6aNPpUIjgfbhnu7iu6VBXn4mYNfmzoyTTTfa692WoF1l-i8EdrB1ekcorfpw3LyFM9eHp8n41ksk4L4mGGBAVLAFVCayzyrCUmYlDyhDDhUlDVVzRrMKKO0kQWtOqTmeVNBmheYDtHtse_Omo89OF9uzD7MqF1JMhK6cMZIoPiRktY4Z6EppfKHvbqddUlw2aVahlTLLtXylGoQ8R9xZ9VW2K__lJujogDgF89ImhQ8pz-l_4Yu |
| CODEN | ITPRED |
| CitedBy_id | crossref_primary_10_1002_cpe_4473 crossref_primary_10_1109_TIM_2025_3600699 crossref_primary_10_1007_s11045_021_00818_4 crossref_primary_10_1016_j_dsp_2018_08_021 crossref_primary_10_1109_TKDE_2019_2941716 crossref_primary_10_1109_JPROC_2018_2846568 crossref_primary_10_1109_TASE_2020_3040400 crossref_primary_10_1109_TSP_2017_2690524 crossref_primary_10_1109_TVT_2021_3089418 crossref_primary_10_1007_s11075_018_0601_4 crossref_primary_10_1007_s11263_016_0985_3 crossref_primary_10_1016_j_ipm_2019_102068 crossref_primary_10_1109_TSP_2017_2777399 crossref_primary_10_1007_s10898_019_00828_4 crossref_primary_10_1109_JSTSP_2020_3045848 crossref_primary_10_1109_TSP_2016_2576427 crossref_primary_10_1145_2915921 crossref_primary_10_1145_3448302 crossref_primary_10_1109_TGRS_2020_3008320 crossref_primary_10_1109_JSTSP_2021_3061937 crossref_primary_10_1109_ACCESS_2019_2894267 crossref_primary_10_1016_j_ins_2019_06_024 crossref_primary_10_1109_JSYST_2018_2879321 crossref_primary_10_1080_10556788_2017_1304548 crossref_primary_10_1109_TSP_2022_3198863 crossref_primary_10_1007_s10915_018_0757_z crossref_primary_10_3390_sym10100521 crossref_primary_10_1016_j_chemolab_2022_104550 crossref_primary_10_1109_JSTSP_2021_3059521 crossref_primary_10_1016_j_chemolab_2025_105487 crossref_primary_10_1088_2632_2153_ab8241 crossref_primary_10_1145_3355089_3356491 crossref_primary_10_1137_18M1229973 crossref_primary_10_1109_JSTSP_2015_2503260 crossref_primary_10_1007_s10107_019_01365_4 crossref_primary_10_1007_s11431_020_1840_4 crossref_primary_10_1109_TSP_2020_2982321 crossref_primary_10_1137_17M1152371 crossref_primary_10_1007_s00500_016_2423_4 crossref_primary_10_1109_TSP_2016_2593681 crossref_primary_10_3390_app11041591 crossref_primary_10_1007_s10957_021_01919_7 crossref_primary_10_1109_TCNS_2017_2657460 crossref_primary_10_1080_10556788_2019_1576177 crossref_primary_10_1109_TGRS_2019_2936486 crossref_primary_10_1080_00207160_2016_1227432 crossref_primary_10_1016_j_patcog_2020_107516 crossref_primary_10_1080_00207179_2017_1316016 crossref_primary_10_1109_TCYB_2019_2894283 crossref_primary_10_1186_s13634_022_00928_6 crossref_primary_10_1109_TGRS_2015_2503737 crossref_primary_10_1109_TSP_2020_2975353 crossref_primary_10_1109_TNNLS_2019_2910991 |
| Cites_doi | 10.1137/060676489 10.1002/cem.1335 10.1109/ACSSC.2014.7094512 10.1109/TASL.2009.2031694 10.1145/1327452.1327492 10.1007/BF02289464 10.1137/120868323 10.1109/78.824675 10.1109/MSP.2014.2329196 10.1007/978-3-642-23126-1_8 10.1109/78.852018 10.1016/j.csda.2004.11.013 10.1561/2200000016 10.1109/MSP.2013.2297439 10.1145/2339530.2339583 10.1016/S0169-7439(00)00071-X 10.1002/0470012110 10.1109/ICASSP.2015.7178413 10.1109/ICDM.2008.89 10.1002/(SICI)1099-128X(199807/08)12:4<223::AID-CEM511>3.3.CO;2-U 10.1109/ICASSP.2014.6853551 10.1137/070690729 10.1109/CAMSAP.2013.6714050 10.1145/2020408.2020426 10.1007/BF02310791 10.1109/ICASSP.2014.6853546 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2015 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2015 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TSP.2015.2454476 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1941-0476 |
| EndPage | 5463 |
| ExternalDocumentID | 3807042271 10_1109_TSP_2015_2454476 7152968 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Division of Information and Intelligent Systems grantid: IIS-1247632 funderid: 10.13039/100000145 |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK ACNCT AENEX AGQYO AGSQL AHBIQ AJQPL AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 EBS EJD F5P HZ~ IFIPE IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 3EH 53G 5VS AAYXX ABFSI ACKIV AETIX AI. AIBXA AKJIK ALLEH CITATION E.L H~9 ICLAB IFJZH VH1 7SC 7SP 8FD JQ2 L7M L~C L~D RIG |
| ID | FETCH-LOGICAL-c291t-40a0ee5e0be338c87d1124cc6234e6eb34fbd4f043433fc93b87d1d68fbe58903 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 74 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000361703100012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1053-587X |
| IngestDate | Mon Jun 30 10:18:33 EDT 2025 Sat Nov 29 04:10:36 EST 2025 Tue Nov 18 20:58:10 EST 2025 Tue Aug 26 16:40:39 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 20 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c291t-40a0ee5e0be338c87d1124cc6234e6eb34fbd4f043433fc93b87d1d68fbe58903 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1712346441 |
| PQPubID | 85478 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_1712346441 crossref_primary_10_1109_TSP_2015_2454476 crossref_citationtrail_10_1109_TSP_2015_2454476 ieee_primary_7152968 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-10-15 |
| PublicationDateYYYYMMDD | 2015-10-15 |
| PublicationDate_xml | – month: 10 year: 2015 text: 2015-10-15 day: 15 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on signal processing |
| PublicationTitleAbbrev | TSP |
| PublicationYear | 2015 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref35 ref13 ref34 ref12 ref14 ref30 ref11 harshman (ref9) 1970; 16 ref2 ref1 ref17 ref16 liavas (ref32) 2014 ref18 xu (ref31) 2010; 51 bader (ref29) 2012 ref24 ref23 ref26 ref25 ref20 fevotte (ref5) 2011; 6684 ref22 ref21 ref28 ref27 papalexakis (ref6) 2012; 7523 (ref19) 0 hillar (ref15) 2009 sorber (ref36) 0 ref8 ref7 ref4 ref3 xu (ref33) 2013 harshman (ref10) 1972; 22 |
| References_xml | – ident: ref27 doi: 10.1137/060676489 – ident: ref17 doi: 10.1002/cem.1335 – ident: ref30 doi: 10.1109/ACSSC.2014.7094512 – ident: ref4 doi: 10.1109/TASL.2009.2031694 – ident: ref20 doi: 10.1145/1327452.1327492 – year: 2013 ident: ref33 publication-title: ?An alternating direction and projection algorithm for structure-enforced matrix factorization ? – ident: ref12 doi: 10.1007/BF02289464 – ident: ref18 doi: 10.1137/120868323 – ident: ref3 doi: 10.1109/78.824675 – ident: ref23 doi: 10.1109/MSP.2014.2329196 – volume: 6684 start-page: 102 year: 2011 ident: ref5 publication-title: Exploring Music Contents doi: 10.1007/978-3-642-23126-1_8 – ident: ref2 doi: 10.1109/78.852018 – ident: ref16 doi: 10.1016/j.csda.2004.11.013 – ident: ref26 doi: 10.1561/2200000016 – ident: ref8 doi: 10.1109/MSP.2013.2297439 – ident: ref21 doi: 10.1145/2339530.2339583 – year: 2014 ident: ref32 publication-title: ?Parallel algorithms for constrained tensor factorization via the alternating direction method of multipliers ? – ident: ref35 doi: 10.1016/S0169-7439(00)00071-X – volume: 16 start-page: 1 year: 1970 ident: ref9 article-title: Foundations of the PARAFAC procedure: Models and conditions for an ?explanatory? multimodal factor analysis publication-title: UCLA Working Papers in Phonetics – ident: ref14 doi: 10.1002/0470012110 – year: 2009 ident: ref15 publication-title: ?Most tensor problems are NP-hard ? – ident: ref1 doi: 10.1109/ICASSP.2015.7178413 – year: 0 ident: ref19 publication-title: Hadoop – ident: ref28 doi: 10.1109/ICDM.2008.89 – ident: ref7 doi: 10.1002/(SICI)1099-128X(199807/08)12:4<223::AID-CEM511>3.3.CO;2-U – volume: 22 start-page: 111 year: 1972 ident: ref10 article-title: Determination and proof of minimum uniqueness conditions for PARAFAC-1 publication-title: UCLA Working Papers in Phonetics – volume: 51 start-page: 365 year: 2010 ident: ref31 article-title: An alternating direction algorithm for matrix completion with nonnegative factors publication-title: Frontiers Math China – year: 2012 ident: ref29 publication-title: MATLAB Tensor Toolbox – ident: ref25 doi: 10.1109/ICASSP.2014.6853551 – ident: ref13 doi: 10.1137/070690729 – ident: ref24 doi: 10.1109/CAMSAP.2013.6714050 – volume: 7523 start-page: 521 year: 2012 ident: ref6 publication-title: ECML/PKDD (1) – ident: ref34 doi: 10.1145/2020408.2020426 – ident: ref11 doi: 10.1007/BF02310791 – ident: ref22 doi: 10.1109/ICASSP.2014.6853546 – year: 0 ident: ref36 publication-title: Tensorlab |
| SSID | ssj0014496 |
| Score | 2.4882948 |
| Snippet | Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 5450 |
| SubjectTerms | Algorithms Analytical models Computer architecture Matrices Optimization PARAFAC model parallel algorithms Signal processing algorithms Sparse matrices Tensile stress Tensor decomposition |
| Title | Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers |
| URI | https://ieeexplore.ieee.org/document/7152968 https://www.proquest.com/docview/1712346441 |
| Volume | 63 |
| WOSCitedRecordID | wos000361703100012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE/IET Electronic Library customDbUrl: eissn: 1941-0476 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014496 issn: 1053-587X databaseCode: RIE dateStart: 19910101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB6qeNCDb7G-yMGL4NrsbtJsjiIWL5WCFXpbdpOJFrSVPvz9TtK0CIrgbdmdLJt8m8xMJjMfwKV1OqP5XCXGqjwRhaQ55zKVqDqzFcoMJXeBbEI9PhaDge414HqVC4OI4fAZ3vjLEMu3YzP3W2UtlfooYbEGa0q1F7laq4iBEIGLi8yFPJGFGixDkly3-k89f4ZL3mRCCuGri3xTQYFT5cdCHLRLZ-d_37UL29GKZLcL2PeggaN92PpWW_AAXnvVxPOkkNTby3gynL2-TxlZqMxTdAZiCLSsT04s3eoE0p2Ykck-hxW1iRuFoxcWV0V60g1002zsWHdxDtHzaB_Cc-e-f_eQRFqFxGQ6nZHHWHFEibxG8k9NoSzZXMIYMoQEtsm5Fq62wnGfc5o7o_Pai9h24WqUheb5EayPxiM8BlZrx9tVzVNrcyF1VaXSSE1jLDKkFdg1obUc6dLEmuO-h29l8D24Lgmb0mNTRmyacLVq8bGot_GH7IHHYiUXYWjC2RLMMk7IaZkqUtHCG38nv7c6hU3_bq-WUnkG67PJHM9hw3zOhtPJRfjXvgCnatN5 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9swED-6rLDuYR9NS7Olmx72UqgT2ZZi63GUhpY2IbAU8mZs6ZQG2qQkaf7-nRQlBFoKfTP2Hf74Wbo7ne5-AH-MVQmN5zLSJksjkUsaczbJoqxKTIkyQcmtJ5vI-v18NFKDPTjf1sIgot98hi136HP5Zqaf3VJZO4tdljD_AB-lEAlfV2ttcwZCeDYuchjSSObZaJOU5Ko9_Ddwu7hkKxGk6fqL7Bghz6ryYir29qX79X1P9g2-BD-S_V0D_x32cHoIn3e6C9bhflDOHVMKST2MZ_PJ8v5xwchHZY6k01NDoGFDCmPpVNfT7oSaTLaalKQTlgqnYxbmRbrS84TTbGZZb70T0TFpH8Fd93J4cRUFYoVIJypeUsxYckSJvEKKUHWeGfK6hNbkCgnsUHgtbGWE5a7qNLVapZUTMZ3cVihzxdNjqE1nUzwBVinLO2XFY2NSIVVZxlJLRd9YJEhzsG1Ae_OlCx26jrs3fCh89MFVQdgUDpsiYNOAs63G07rjxhuydYfFVi7A0IDmBswiDMlFEWdkpIVz_368rvUbPl0Ne7fF7XX_5iccuPs4IxXLJtSW82c8hX29Wk4W81_-v_sPzlXWwA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+Algorithms+for+Constrained+Tensor+Factorization+via+Alternating+Direction+Method+of+Multipliers&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Liavas%2C+Athanasios+P&rft.au=Sidiropoulos%2C+Nicholas+D&rft.date=2015-10-15&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1053-587X&rft.eissn=1941-0476&rft.volume=63&rft.issue=20&rft.spage=5450&rft_id=info:doi/10.1109%2FTSP.2015.2454476&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3807042271 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon |