Jeongyeol Kwon;Wei Qian;Yudong Chen;Constantine Caramanis;Damek Davis;Nhat Ho
{"title":"Global Optimality of the EM Algorithm for Mixtures of Two-Component Linear Regressions","authors":"Jeongyeol Kwon;Wei Qian;Yudong Chen;Constantine Caramanis;Damek Davis;Nhat Ho","doi":"10.1109/TIT.2024.3435522","DOIUrl":null,"url":null,"abstract":"Recent results established that EM enjoys global convergence for Gaussian Mixture Models. For Mixed Linear Regression, however, only local convergence results have been established, and those only for the high signal-to-noise ratio (SNR) regime. In this work, we completely characterize the global optimality of EM: we show that starting from any randomly initialized point, the EM algorithm converges to the true parameter \n<inline-formula> <tex-math>${\\beta }^{*}$ </tex-math></inline-formula>\n at the minimax statistical rates under all SNR regimes. Toward this goal, we first show the global convergence of the EM algorithm at the population level. Then we provide a complete characterization of statistical and computational behaviors of EM under all SNR regimes with finite samples. In particular: (i) When the SNR is sufficiently large, the EM updates converge to the true parameter \n<inline-formula> <tex-math>$ {\\beta }^{*}$ </tex-math></inline-formula>\n at the standard parametric convergence rate \n<inline-formula> <tex-math>$O((d/n)^{1/2})$ </tex-math></inline-formula>\n after \n<inline-formula> <tex-math>$O(\\log (n/d))$ </tex-math></inline-formula>\n iterations. (ii) In the regime where the SNR is above \n<inline-formula> <tex-math>$O((d/n)^{1/4})$ </tex-math></inline-formula>\n and below some constant, the EM iterates converge to a \n<inline-formula> <tex-math>$O({\\mathrm { SNR}}^{-1} (d/n)^{1/2})$ </tex-math></inline-formula>\n neighborhood of the true parameter, when the number of iterations is of the order \n<inline-formula> <tex-math>$O({\\mathrm { SNR}}^{-2} \\log (n/d))$ </tex-math></inline-formula>\n. (iii) In the low SNR regime where the SNR is below \n<inline-formula> <tex-math>$O((d/n)^{1/4})$ </tex-math></inline-formula>\n, we show that EM converges to a \n<inline-formula> <tex-math>$O((d/n)^{1/4})$ </tex-math></inline-formula>\n neighborhood of the true parameters, after \n<inline-formula> <tex-math>$O((n/d)^{1/2})$ </tex-math></inline-formula>\n iterations. By providing tight convergence guarantees of the EM algorithm in middle-to-low SNR regimes, we reveal that in low SNR, EM changes rate, matching the \n<inline-formula> <tex-math>$n^{-1/4}$ </tex-math></inline-formula>\n rate of the MLE, a behavior that previous work had been unable to show.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 9","pages":"6519-6546"},"PeriodicalIF":2.2000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10614292/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Recent results established that EM enjoys global convergence for Gaussian Mixture Models. For Mixed Linear Regression, however, only local convergence results have been established, and those only for the high signal-to-noise ratio (SNR) regime. In this work, we completely characterize the global optimality of EM: we show that starting from any randomly initialized point, the EM algorithm converges to the true parameter
${\beta }^{*}$
at the minimax statistical rates under all SNR regimes. Toward this goal, we first show the global convergence of the EM algorithm at the population level. Then we provide a complete characterization of statistical and computational behaviors of EM under all SNR regimes with finite samples. In particular: (i) When the SNR is sufficiently large, the EM updates converge to the true parameter
$ {\beta }^{*}$
at the standard parametric convergence rate
$O((d/n)^{1/2})$
after
$O(\log (n/d))$
iterations. (ii) In the regime where the SNR is above
$O((d/n)^{1/4})$
and below some constant, the EM iterates converge to a
$O({\mathrm { SNR}}^{-1} (d/n)^{1/2})$
neighborhood of the true parameter, when the number of iterations is of the order
$O({\mathrm { SNR}}^{-2} \log (n/d))$
. (iii) In the low SNR regime where the SNR is below
$O((d/n)^{1/4})$
, we show that EM converges to a
$O((d/n)^{1/4})$
neighborhood of the true parameters, after
$O((n/d)^{1/2})$
iterations. By providing tight convergence guarantees of the EM algorithm in middle-to-low SNR regimes, we reveal that in low SNR, EM changes rate, matching the
$n^{-1/4}$
rate of the MLE, a behavior that previous work had been unable to show.
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.