ProvQML: Efficient Provenance Capture for Machine Learning as Recursive Aggregate SQL [Extended Version]
Nkechi J. Akinwale, Seokki Lee
Abstract
Expressing ML algorithms as recursive aggregate SQL queries over distributed systems enables large-scale declarative data analytics, yet no existing system supports scalable provenance capture, necessary for ML explainability. We present ProvQML, a provenance-aware recursive aggregate SQL engine that efficiently captures fine-grained provenance while evaluating ML algorithms as recursive aggregate queries. We capture two types of provenance: (i) local provenance that records the contribution of each training instance to gradient computation at a specific model state, and (ii) global provenance that encodes the sequence of model parameter updates across the iterations. Extensive experiments on widely used ML datasets demonstrate that our approach efficiently captures both provenance for various ML models over widely used ML datasets.
Create a lesson
Related papers
Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Oktie Hassanzadeh, Dharmashankar Subramanian
Benchmarking Content-Defined Chunking Algorithms for Data Deduplication
Marcel Gregoriadis, Leonhard Balduf, Björn Scheuermann et al.
Time-Varying Favorite-Longshot Bias in Polymarket Weather Markets
Shouchen Qiu, Huaijun Qiu
MatQuery: Execution-Grounded Natural-Language Querying over Heterogeneous Materials Databases
Chen Jason Zhang, Qi Chen
CALQA: Conformal Screening of Forecast-Ensemble Configurations from One Mergeable State
Xiufeng Liu, Ruyu Liu, Yusen Liu et al.
Semantic Views: Certified Reuse of LLM Labels Across Semantic Queries
Oktie Hassanzadeh, Dharmashankar Subramanian