[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Enhanced Line Search: A Novel Method to Accelerate PARAFAC

Published: 01 September 2008 Publication History

Abstract

Several modifications have been proposed to speed up the alternating least squares (ALS) method of fitting the PARAFAC model. The most widely used is line search, which extrapolates from linear trends in the parameter changes over prior iterations to estimate the parameter values that would be obtained after many additional ALS iterations. We propose some extensions of this approach that incorporate a more sophisticated extrapolation, using information on nonlinear trends in the parameters and changing all the parameter sets simultaneously. The new method, called “enhanced line search (ELS),” can be implemented at different levels of complexity, depending on how many different extrapolation parameters (for different modes) are jointly optimized during each iteration. We report some tests of the simplest parameter version, using simulated data. The performance of this lowest-level of ELS depends on the nature of the convergence difficulty. It significantly outperforms standard LS when there is a “convergence bottleneck,” a situation where some modes have almost collinear factors but others do not, but is somewhat less effective in classic “swamp” situations where factors are highly collinear in all modes. This is illustrated by examples. To demonstrate how ELS can be adapted to different N-way decompositions, we also apply it to a four-way array to perform a blind identification of an under-determined mixture (UDM). Since analysis of this dataset happens to involve a serious convergence “bottleneck” (collinear factors in two of the four modes), it provides another example of a situation in which ELS dramatically outperforms standard line search.

Cited By

View all
  • (2024)Nested Tensor-Based Integrated Sensing and Communication in RIS-Assisted THz MIMO SystemsIEEE Transactions on Signal Processing10.1109/TSP.2024.335932372(1141-1157)Online publication date: 1-Jan-2024
  • (2022)Computation of the nonnegative canonical tensor decomposition with two accelerated proximal gradient algorithmsDigital Signal Processing10.1016/j.dsp.2022.103682129:COnline publication date: 1-Sep-2022
  • (2022)On global convergence of alternating least squares for tensor approximationComputational Optimization and Applications10.1007/s10589-022-00428-184:2(509-529)Online publication date: 27-Oct-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Matrix Analysis and Applications  Volume 30, Issue 3
September 2008
341 pages

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 September 2008

Author Tags

  1. PARAFAC
  2. acceleration
  3. alternating least squares (ALS)
  4. bottlenecks
  5. collinear factors
  6. degeneracy
  7. enhanced line search (ELS)
  8. line search
  9. swamps

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Nested Tensor-Based Integrated Sensing and Communication in RIS-Assisted THz MIMO SystemsIEEE Transactions on Signal Processing10.1109/TSP.2024.335932372(1141-1157)Online publication date: 1-Jan-2024
  • (2022)Computation of the nonnegative canonical tensor decomposition with two accelerated proximal gradient algorithmsDigital Signal Processing10.1016/j.dsp.2022.103682129:COnline publication date: 1-Sep-2022
  • (2022)On global convergence of alternating least squares for tensor approximationComputational Optimization and Applications10.1007/s10589-022-00428-184:2(509-529)Online publication date: 27-Oct-2022
  • (2022)RETRACTED ARTICLE: Blind code estimation of multi-antenna direct-spread CDMA with long-code signal using decomposition techniqueSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-022-07147-z26:12(5815-5822)Online publication date: 1-Jun-2022
  • (2021)Computation of low-rank tensor approximation under existence constraint via a forward-backward algorithmSignal Processing10.1016/j.sigpro.2021.108178188:COnline publication date: 1-Nov-2021
  • (2020)Using the proximal gradient and the accelerated proximal gradient as a canonical polyadic tensor decomposition algorithms in difficult situationsSignal Processing10.1016/j.sigpro.2020.107472171:COnline publication date: 1-Jun-2020
  • (2020)An ATLD–ALS method for the trilinear decomposition of large third-order tensorsSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-019-04320-924:18(13535-13546)Online publication date: 1-Sep-2020
  • (2020)Using Derivatives of Second Generating Function for Underdetermined Blind IdentificationCircuits, Systems, and Signal Processing10.1007/s00034-020-01385-y39:9(4578-4595)Online publication date: 1-Sep-2020
  • (2018)Nesterov-Based Alternating Optimization for Nonnegative Tensor FactorizationIEEE Transactions on Signal Processing10.1109/TSP.2017.277739966:4(944-953)Online publication date: 1-Feb-2018
  • (2018)Low-complexity tensor-based blind receivers for MIMO systemsTelecommunications Systems10.1007/s11235-017-0357-567:4(593-604)Online publication date: 1-Apr-2018
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media