You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@spark.apache.org by "Sean Owen (JIRA)" <ji...@apache.org> on 2019/07/24 01:21:00 UTC
[jira] [Resolved] (SPARK-28421) SparseVector.apply performance
optimization
[ https://issues.apache.org/jira/browse/SPARK-28421?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Sean Owen resolved SPARK-28421.
-------------------------------
Resolution: Fixed
Fix Version/s: 3.0.0
Issue resolved by pull request 25178
[https://github.com/apache/spark/pull/25178]
> SparseVector.apply performance optimization
> -------------------------------------------
>
> Key: SPARK-28421
> URL: https://issues.apache.org/jira/browse/SPARK-28421
> Project: Spark
> Issue Type: Improvement
> Components: ML
> Affects Versions: 3.0.0
> Reporter: zhengruifeng
> Assignee: zhengruifeng
> Priority: Major
> Fix For: 3.0.0
>
>
> Current impl of SparseVector.apply is inefficient:
> on each call, breeze.linalg.SparseVector & breeze.collection.mutable.SparseArray are created internally, then binary-search is used to search the input position.
>
> This place should be optimized like .ml.SparseMatrix, which directly use binary search, without conversion to breeze.linalg.Matrix.
>
> I tested the performance and found that if we avoid the internal conversions, then a 2.5~5X speed up can be obtained.
--
This message was sent by Atlassian JIRA
(v7.6.14#76016)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org