Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Incomplete
-
None
-
None
Description
Cholesky decomposition is unstable (for near-singular and rank deficient matrices) and only works on positive definite matrices which can not be guaranteed in all cases, it was often used when matrix A is very large and sparse due to faster calculation. QR decomposition has better numerical properties than Cholesky and can works on matrices which are not positive definite. Spark MLlib WeightedLeastSquares use Cholesky decomposition to solve normal equation currently, we should also support or move to QR solver for better stability. I'm preparing to send a PR.
Attachments
Issue Links
- depends upon
-
SPARK-17748 One-pass algorithm for linear regression with L1 and elastic-net penalties
- Resolved