Yi, X., Caramanis, C., & Sanghavi, S. (2016). Solving a mixture of many random linear equations by tensor decomposition and alternating minimization (Report No. D-STOP/2016/109). University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP). https://rosap.ntl.bts.gov/view/dot/32603
Yi, Xinyang, Constantine Caramanis, and Sujay Sanghavi. Solving a mixture of many random linear equations by tensor decomposition and alternating minimization. Report no. D-STOP/2016/109. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016. https://rosap.ntl.bts.gov/view/dot/32603.
Yi, Xinyang, et al. Solving a mixture of many random linear equations by tensor decomposition and alternating minimization. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016, Report no. D-STOP/2016/109, ROSA P. https://rosap.ntl.bts.gov/view/dot/32603.
Details
Alternative Title:
Project title : models for high dimensional mixed regression.
We consider the problem of solving mixed random linear equations with k components. This is the noiseless setting of mixed linear regression. The goal is to estimate multiple linear models from mixed samples in the case where the labels (which sample corresponds to which model) are not observed. We give a tractable algorithm for the mixed linear equation problem, and show that under some technical conditions, our algorithm is guaranteed to solve the problem exactly with sample complexity linear in the dimension, and polynomial in k, the number of components. Previous approaches have required either exponential dependence on k, or super-linear dependence on the dimension. The proposed algorithm is a combination of tensor decomposition and alternating minimization. Our analysis involves proving that the initialization provided by the tensor method allows alternating minimization, which is equivalent to EM in our setting, to converge to the global optimum at a linear rate.
Yi, X., Caramanis, C., & Sanghavi, S. (2016). Solving a mixture of many random linear equations by tensor decomposition and alternating minimization (Report No. D-STOP/2016/109). University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP). https://rosap.ntl.bts.gov/view/dot/32603
Yi, Xinyang, Constantine Caramanis, and Sujay Sanghavi. Solving a mixture of many random linear equations by tensor decomposition and alternating minimization. Report no. D-STOP/2016/109. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016. https://rosap.ntl.bts.gov/view/dot/32603.
Yi, Xinyang, et al. Solving a mixture of many random linear equations by tensor decomposition and alternating minimization. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2016, Report no. D-STOP/2016/109, ROSA P. https://rosap.ntl.bts.gov/view/dot/32603.
ROSA P serves as an archival repository of USDOT-published products including scientific
findings, journal articles, guidelines, recommendations, or other information authored or co-authored by
USDOT or funded partners. As a repository, ROSA P retains documents in their original published format to
ensure public access to scientific information.
Links with this icon indicate that you are leaving a Bureau of Transportation
Statistics (BTS)/National Transportation Library (NTL)
Web-based service.
Thank you for visiting.
You are about to access a non-government link outside of
the U.S. Department of Transportation's National
Transportation Library.
Please note: While links to Web sites outside of DOT are
offered for your convenience, when you exit DOT Web sites,
Federal privacy policy and Section 508 of the Rehabilitation
Act (accessibility requirements) no longer apply. In
addition, DOT does not attest to the accuracy, relevance,
timeliness or completeness of information provided by linked
sites. Linking to a Web site does not constitute an
endorsement by DOT of the sponsors of the site or the
products presented on the site. For more information, please
view DOT's Web site linking policy.
To get back to the page you were previously viewing, click
your Cancel button.