paper-with-me

홈 › Papers

Data Quality Profiling at Scale with Progressive Sampling: A Benchmark for Data-Centric AI Pipelines

2026-07-28 · Laure Berti-Equille arxiv

Data quality profiling -- computing missing-value rates, duplicate fractions, outlier densities, and functional-dependency violations -- is foundational for data-centric AI pipelines, yet exhaustive scans over millions of rows are prohibitively slow for near-real-time monitoring. Progressive sampling is the standard alternative; the open question is which strategy best preserves profile fidelity at scale. We benchmark nine sampling strategies -- blind (random uniform, geometric, Yamane, cluster) and proxy-guided (Metropolis-Hastings, DAG, stratified by column type or quality score, importance-weighted) -- on three real-world datasets (NYC 311, NYPD arrests, UCI Adult; up to 500K rows), an IoT sensor stream (2.3M rows), two ultra-large real datasets including Ultra-Marathon Running (up to 7.4M rows), and synthetic data scaled to 5x10^6 rows. Contrary to the assumption sharpens estimates, blind representative samplers dominate uniformly. At a 5% budget, random uniform achieves 0.49% mean relative error on NYC 311; DAG-guided MCMC yields 19.5% (approx. 40x worse), and across all real datasets DAG is 11-49x worse (Wilcoxon W=0, p=0.002, n=9 pairs). Cluster sampling matches random uniform (MRE 0.110 vs. 0.111); proxy-guided methods share DAG's failure mode (MRE 0.20-0.35). At scale, random uniform is near-linear (O(N^{0.964})) while DAG is super-linear (O(N^{1.272})), running 28--47x slower on ultra-large data with 6x worse accuracy. The root cause is an IQR proxy mismatch: proxy-guided samplers over-pursue numeric outliers, while quality defects concentrate in categorical columns invisible to the proxy. The actionable finding: representativeness, not domain knowledge, determines sampler quality -- schema-free random uniform or cluster sampling suffices for production-grade quality profiling at scale.

📄 PDF Abstract BibTeX arXiv:2607.25356

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Fully Progressive Approach to Single-Image Super-Resolution

2018-04-09 · Yifan Wang, Federico Perazzi, Brian McWilliams, Alexander Sorkine-Hornung 외

Recent deep learning approaches to single image super-resolution have achieved impressive results in terms of traditional error measures and perceptual quality. However, in each case it remains challenging to achieve hig…

Generative Adversarial NetworkImage Super-ResolutionSSIMSuper-Resolution

Predicting the stability of profiling signals of small RNAs

2024-03-19 · Qiuyun Li, Manda Riehl

Profiling is a process that finds similarities between different RNA secondary structures by extracting signals from the Boltzmann sampling. The reproducibility of profiling can be identified by the standard deviation of…

ProSPy: A Profiling-Driven SQL-Python Agentic Framework for Enterprise Text-to-SQL

2026-06-04 · Zhaorui Yang, Huawei Zheng, Sen Yang, Yuhui Zhang 외 arxiv

Large language models have substantially advanced Text-to-SQL systems, yet applying them to enterprise-scale databases remains challenging. Real-world databases often contain large and heterogeneous schemas, incomplete m…

Progressive Supernet Training for Efficient Visual Autoregressive Modeling

2025-11-20 · Xiaoyue Chen, Yuling Shi, Kaiyuan Li, Huandong Wang 외 arxiv

Visual Auto-Regressive (VAR) models significantly reduce inference steps through the "next-scale" prediction paradigm. However, progressive multi-scale generation incurs substantial memory overhead due to cumulative KV c…

LSRS: Latent Scale Rejection Sampling for Visual Autoregressive Modeling

2025-12-03 · Hong-Kai Zheng, Piji Li arxiv

Visual Autoregressive (VAR) modeling approach for image generation proposes autoregressive processing across hierarchical scales, decoding multiple tokens per scale in parallel. This method achieves high-quality generati…

Computational EfficiencyImage Generation