The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Scaling up machine learning: parallel and distributed approaches
Abstract
This tutorial gives a broad view of modern approaches for scaling up machine learning and data mining methods on parallel/distributed platforms. Demand for scaling up machine learning is task-specific: for some tasks it is driven by the enormous dataset sizes, for others by model complexity or by the requirement for real-time prediction. Selecting a task-appropriate parallelization platform and algorithm requires understanding their benefits, trade-offs and constraints. This tutorial focuses on providing an integrated overview of state-of-the-art platforms and algorithm choices. These span a range of hardware options (from FPGAs and GPUs to multi-core systems and commodity clusters), programming frameworks (including CUDA, MPI, MapReduce, and DryadLINQ), and learning settings (e.g., semi-supervised and online learning). The tutorial is example-driven, covering a number of popular algorithms (e.g., boosted trees, spectral clustering, belief propagation) and diverse applications (e.g., recommender systems and object recognition in vision).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Mining high-speed data streams
Domingos, P., & Hulten, G. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347107 · Cited by 2,185
From RankNet to LambdaRank to LambdaMART: An Overview
Burges, C. J. C. (2010) · Cited by 1,448
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
Boosting Algorithms for Parallel and Distributed Learning
Lazarević, A. M., & Zoran Obradovic, A. (2002) · Distributed and Parallel Databases · doi:10.1023/a:1013992203485 · Cited by 93
The distributed boosting algorithm
Lazarević, A. M., & Zoran Obradovic, A. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502557 · Cited by 88
Caragea, D., Silvescu, A., & Honavar, V. (2004) · International Journal of Hybrid Intelligent Systems · doi:10.3233/his-2004-11-210 · Cited by 85
Cited by
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1603.02754 · Cited by 7,104
Data-intensive applications, challenges, techniques and technologies: A survey on Big Data
Philip Chen, C. L., & Zhang, C.-Y. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.015 · Cited by 3,047
Federated Optimization: Distributed Machine Learning for On-Device Intelligence
Konečný, J., McMahan, H. B., Ramage, D., & Richtárik, P. (2016) · arXiv · doi:10.48550/arxiv.1610.02527 · Cited by 1,563
A survey of machine learning for big data processing
Qiu, J., Wu, Q., Ding, G., Xu, Y., & Feng, S. (2016) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-016-0355-x · Cited by 894
Ad click prediction: a view from the trenches
McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., et al. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2488200 · Cited by 867
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
Ensembles for feature selection: A review and future trends
Bolón-Canedo, V., & Alonso-Betanzos, A. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.008 · Cited by 541
Decision forest: Twenty years of research
Rokach, L. (2016) · Information Fusion · doi:10.1016/j.inffus.2015.06.005 · Cited by 472
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
A survey on platforms for big data analytics
Singh, D., & Reddy, C. K. (2015) · Journal of Big Data · doi:10.1186/s40537-014-0008-6 · Cited by 433
A survey of open source tools for machine learning with big data in the Hadoop ecosystem
Landset, S., Khoshgoftaar, T. M., Richter, A. N., & Hasanin, T. (2015) · Journal of Big Data · doi:10.1186/s40537-015-0032-1 · Cited by 432
Communication-Efficient Distributed Optimization using an Approximate Newton-type Method
Shamir, O., Srebro, N., & Zhang, T. (2013) · arXiv · doi:10.48550/arxiv.1312.7853 · Cited by 424
Federated Learning for 6G: Applications, Challenges, and Opportunities
Yang, Z., Chen, M., Wong, K.-K., Poor, H. V., & Cui, S. (2022) · Engineering · doi:10.1016/j.eng.2021.12.002 · Cited by 374
Recent advances and emerging challenges of feature selection in the context of big data
Bolón-Canedo, V., Sánchez-Maroño, N., & Alonso-Betanzos, A. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.05.014 · Cited by 320
Big data analytics: Computational intelligence techniques and application areas
Iqbal, R., Doctor, F., More, B., Mahmud, S., & Yousuf, U. (2020) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2018.03.024 · Cited by 263
A Reliable Effective Terascale Linear Learning System
Agarwal, A., Chapelle, O., Dudı́k, M., & Langford, J. C. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.4198 · Cited by 260
Self-citationTrends and Future Perspective Challenges in Big Data
Naeem, M., Jamal, T., Diaz-Martinez, J., Butt, S. A., Montesano, N., Tariq, M. I., De-la-Hoz-Franco, E., & De-La-Hoz-Valdiris, E. (2022) · Smart Innovation, Systems and Technologies · doi:10.1007/978-981-16-5036-9_30 · Cited by 255
Communication Complexity of Distributed Convex Learning and Optimization
Arjevani, Y., & Shamir, O. (2015) · arXiv · doi:10.48550/arxiv.1506.01900 · Cited by 133
“As datasets continue to increase in size, and parallel computing platforms becoming more and more common (from multiple cores on a single CPU to large-scale and geographically distributed computing grids), distributed learning and optimization methods have been the focus of much research in recent years, with just a f…”
BackgroundCommunication-Efficient Distributed Optimization of Self-Concordant Empirical Loss
Zhang, Y., & Xiao, L. (2015) · arXiv · doi:10.48550/arxiv.1501.00263 · Cited by 55
Metadata
- Authors
- Bekkerman, R., Bilenko, M., & Langford, J.
- Venue
- Proceedings of the 17th ACM SIGKDD International Conference Tutorials
- Publisher
- ACM
- Published
- 2011-08-21
- Pages
- 1-1
- OpenAlex
- W2009537245
- Cited by
- 282
- References
- 7
- Type
- conference abstract
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.