Name
Abstract | ||
|---|---|---|
Machine learning contains many computational bottlenecks in the form of nested summations over datasets. Computation of these summations is typically O(n2) or higher, which severely limits application to large datasets. We present a multi- stage stratified Monte Carlo method for approximating such summations with probabilistic relative error control. The essential idea is fast approximation by sampling in trees. This method differs from many previous scalability techniques (such as multi-tree methods) in that its error is stochastic, but we derive conditions for error control and demonstrate that they work. Further, we give a theoretical sample complexity for the method that is independent of dataset size, and show that this appears to hold in experiments, where speedups reach as high as 1014, many orders of magnitude beyond the previous state of the art. |
Year | Venue | DocType |
|---|---|---|
2007 | NIPS | Conference |
Citations | PageRank | References |
1 | 0.39 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael P. Holmes | 1 | 115 | 7.15 |
| Alexander G. Gray | 2 | 990 | 80.16 |
| Charles L. Isbell | 3 | 504 | 65.79 |