[ 
https://issues.apache.org/jira/browse/SPARK-7210?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14609002#comment-14609002
 ] 

Shivaram Venkataraman commented on SPARK-7210:
----------------------------------------------

A more stable way would probably be do a QR decomposition and then get the SVD 
from it. There are a bunch of QR algorithms implemented at 
https://github.com/amplab/ml-matrix in case anybody wants to take a shot at 
this.

> Test matrix decompositions for speed vs. numerical stability for Gaussians
> --------------------------------------------------------------------------
>
>                 Key: SPARK-7210
>                 URL: https://issues.apache.org/jira/browse/SPARK-7210
>             Project: Spark
>          Issue Type: Improvement
>          Components: MLlib
>            Reporter: Joseph K. Bradley
>            Priority: Minor
>
> We currently use SVD for inverting the Gaussian's covariance matrix and 
> computing the determinant.  SVD is numerically stable but slow.  We could 
> experiment with Cholesky, etc. to figure out a better option, or a better 
> option for certain settings.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to