BlinkML: Efficient Maximum Likelihood Estimation with Probabilistic Guarantees
Not on the map. Why?
Abstract (arXiv)
The rising volume of datasets has made training machine learning (ML) models a major computational cost in the enterprise. Given the iterative nature of model and parameter tuning, many analysts use a small sample of their entire data during their initial stage of analysis to make quick decisions (e.g., what features or hyperparameters to use) and use the entire dataset only in later stages (i.e., when they have converged to a specific model). This sampling, however, is performed in an ad-hoc fashion. Most practitioners cannot precisely capture the effect of sampling on the quality of their model, and eventually on their decision-making process during the tuning phase. Moreover, without systematic support for sampling operators, many optimizations and reuse opportunities are lost. In this paper, we introduce BlinkML, a system for fast, quality-guaranteed ML training. BlinkML allows users to make error-computation tradeoffs: instead of training a model on their full data (i.e., full model), BlinkML can quickly train an approximate model with quality guarantees using a sample. The quality guarantees ensure that, with high probability, the approximate model makes the same predictions as the full model. BlinkML currently supports any ML model that relies on maximum likelihood estimation (MLE), which includes Generalized Linear Models (e.g., linear regression, logistic regression, max entropy classifier, Poisson regression) as well as PPCA (Probabilistic Principal Component Analysis). Our experiments show that BlinkML can speed up the training of large-scale ML tasks by 6.26x-629x while guaranteeing the same predictions, with 95% probability, as the full model.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 2.
4 papers.
- 2022Differentiable and Scalable Generative Adversarial Models for Data Imputationcited by 5
- 2023Approximate Computing Survey, Part II: Application-Specific & Architectural Approximation Techniques and Applicationscited by 3
- 2025Aixel: A Unified, Adaptive and Extensible System for AI-powered Data Analysiscited by 1
- 2025Morphing-based Compression for Data-centric ML Pipelinescited by 0
- 2025Aixel: A Unified, Adaptive and Extensible System for AI-powered Data Analysis14 Oct 2025
- 2025Morphing-based Compression for Data-centric ML Pipelines15 Apr 2025
- 2023Approximate Computing Survey, Part II: Application-Specific & Architectural Approximation Techniques and Applications20 Jul 2023
- 2022Differentiable and Scalable Generative Adversarial Models for Data Imputation10 Jan 2022