paper-with-me

홈 › Papers

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

2021-07-16 · Divya Shanmugam, Samira Shabanian, Fernando Diaz, Michèle Finck, Asia Biega

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.

📄 PDF Abstract BibTeX arXiv:2107.08096

Code (0)

등록된 구현이 없습니다.

Tasks

Fairness

Similar Papers 제목 키워드 기반

Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws

2024-10-15 · Yiding Jiang, Allan Zhou, Zhili Feng, Sadhika Malladi 외

The composition of pretraining data is a key determinant of foundation models' performance, but there is no standard guideline for allocating a limited computational budget across different data sources. Most current app…

Computational Efficiency

Scaling Laws for Deep Learning

2021-08-17 · Jonathan S. Rosenfeld

Running faster will only get you so far -- it is generally advisable to first understand where the roads lead, then get a car ... The renaissance of machine learning (ML) and deep learning (DL) over the last decade is ac…

Deep Learningimage-classificationImage ClassificationLanguage Modeling+2

OWLS: Scaling Laws for Multilingual Speech Recognition and Translation Models

2025-02-14 · William Chen, Jinchuan Tian, Yifan Peng, Brian Yan 외

Neural scaling laws offer valuable insights for designing robust sequence processing architectures. While these laws have been extensively characterized in other modalities, their behavior in speech remains comparatively…

speech-recognitionSpeech RecognitionTranslation

Broken neural scaling laws in materials science

2026-02-05 · Max Großmann, Malte Grunert, Erich Runge arxiv

In materials science, data are scarce and expensive to generate, whether computationally or experimentally. Therefore, it is crucial to identify how model performance scales with dataset size and model capacity to distin…

Amortizing Scaling Law Construction Costs

2026-09-04 · Abhash Kumar Jha, Diana Alexandra Onuţu, Neeratyoy Mallik, Swagatam Haldar 외 arxiv

Scaling laws guide the design choices for training large foundation models, but deriving them involves training an exhaustive grid over hyperparameters, token budgets, and parameter counts, which is computationally expen…