Shaban; Amirreza; Mehrdad; Farajtabar (Maximum Likelihood Methods in Unknown Latent Variables; multi-view model, discrete observations Maximum Likelihood Methods in Unknown Latent Variables): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2} log^{2} n)$ == Space Complexity == $O(kd+d^{3})$?? words (vector of parameters has size at least Theta(kd), and tensor M has size at least Theta(d^3) in paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 2015 == Reference == https://faculty.cc.gatech.edu/~bboots3/files/SpectralExteriorPoint-NIPSWorkshop.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2} log^{2} n)$ | $O(n^{2} \log^{2} n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:48, 10 April 2023
Time Complexity
$O(n^{2} \log^{2} n)$
Space Complexity
$O(kd+d^{3})$?? words
(vector of parameters has size at least Theta(kd), and tensor M has size at least Theta(d^3) in paper)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
2015
Reference
https://faculty.cc.gatech.edu/~bboots3/files/SpectralExteriorPoint-NIPSWorkshop.pdf