mlsanityData to 7 Oct 2026

Learning to Limit Data Collection via Scaling Laws: A Computational Interpretation for the Legal Principle of Data Minimization

arXiv 2107.08096 ↗First posted 16 Jul 2021cs.LG cs.CY cs.IRcited by 9

Not on the map. Why?

Abstract (arXiv)

Modern machine learning systems are increasingly characterized by extensive personal data collection, despite the diminishing returns and increasing societal costs of such practices. Yet, data minimisation is one of the core data protection principles enshrined in the European Union's General Data Protection Regulation ('GDPR') and requires that only personal data that is adequate, relevant and limited to what is necessary is processed. However, the principle has seen limited adoption due to the lack of technical interpretation. In this work, we build on literature in machine learning and law to propose FIDO, a Framework for Inhibiting Data Overcollection. FIDO learns to limit data collection based on an interpretation of data minimization tied to system performance. Concretely, FIDO provides a data collection stopping criterion by iteratively updating an estimate of the performance curve, or the relationship between dataset size and performance, as data is acquired. FIDO estimates the performance curve via a piecewise power law technique that models distinct phases of an algorithm's performance throughout data collection separately. Empirical experiments show that the framework produces accurate performance curves and data collection stopping criteria across datasets and feature acquisition algorithms. We further demonstrate that many other families of curves systematically overestimate the return on additional data. Results and analysis from our investigation offer deeper insights into the relevant considerations when designing a data minimization framework, including the impacts of active feature acquisition on individual users and the feasability of user-specific data minimization. We conclude with practical recommendations for the implementation of data minimization.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 12 of its 46 references that are in the map. First posted on arXiv 16 Jul 2021.

Builds on

12 of 46 references.

References · 12

  1. 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
  2. 2018Why Is My Classifier Discriminatory?cited by 143
  3. 2017Translation-based Recommendationcited by 70
  4. 2020Towards Robust and Reproducible Active Learning Using Neural Networkscited by 53
  5. 2020Data Minimization for GDPR Compliance in Machine Learning Modelscited by 21
  6. 2020Operationalizing the Legal Principle of Data Minimization for Personalizationcited by 19
  7. 2020Learning to Rank Learning Curvescited by 16
  8. 2018Active Feature Acquisition with Supervised Matrix Completioncited by 11
  9. 2021Reviving Purpose Limitation and Data Minimisation in Data-Driven Systemscited by 11
  10. 2013Differential Data Analysis for Recommender Systemscited by 3
  11. 2014A Utility-Theoretic Approach to Privacy in Online Servicescited by 3
  12. 2018Understanding Software Developers' Approach towards Implementing Data Minimizationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 3; 2026: 1.

9 papers.