Github user manishamde commented on a diff in the pull request:
https://github.com/apache/spark/pull/475#discussion_r12109202
--- Diff: docs/mllib-classification-regression.md ---
@@ -294,12 +294,9 @@ The recursive tree construction is stopped at a node
when one of the two conditi
1. The node depth is equal to the `maxDepth` training paramemter
2. No split candidate leads to an information gain at the node.
-### Practical Limitations
-
-The tree implementation stores an Array[Double] of size *O(#features \*
#splits \* 2^maxDepth)* in memory for aggregating histograms over partitions.
The current implementation might not scale to very deep trees since the memory
requirement grows exponentially with tree depth.
-
-Please drop us a line if you encounter any issues. We are planning to
solve this problem in the near future and real-world examples will be great.
+### Implementation Details
--- End diff --
Thanks.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---