A Cram'er-von Mises Approach to Incentivizing Truthful Data Sharing
Not on the map. Why?
Abstract (arXiv)
Modern data marketplaces and data sharing consortia increasingly rely on incentive mechanisms to encourage agents to contribute data. However, schemes that reward agents based on the quantity of submitted data are vulnerable to manipulation, as agents may submit fabricated or low-quality data to inflate their rewards. Prior work has proposed comparing each agent's data against others' to promote honesty: when others contribute genuine data, the best way to minimize discrepancy is to do the same. Yet prior implementations of this idea rely on very strong assumptions about the data distribution (e.g. Gaussian), limiting their applicability. In this work, we develop reward mechanisms based on a novel, two-sample test inspired by the Cram'er-von Mises statistic. Our methods strictly incentivize agents to submit more genuine data, while disincentivizing data fabrication and other types of untruthful reporting. We establish that truthful reporting constitutes a (possibly approximate) Nash equilibrium in both Bayesian and prior-agnostic settings. We theoretically instantiate our method in three canonical data sharing problems and show that it relaxes key assumptions made by prior work. Empirically, we demonstrate that our mechanism incentivizes truthful data sharing via simulations and on real-world language and image data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 47 references that are in the map. First posted on arXiv 8 Jun 2025.
Builds on
24 of 47 references.
References · 24
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2020Free-rider Attacks on Model Aggregation in Federated Learningcited by 57
- 2024Progressive Knowledge Distillation Of Stable Diffusion XL Using Layer Level Losscited by 52
- 2019Free-riders in Federated Learning: Attacks and Defensescited by 49
- 2021One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learningcited by 39
- 2022Mechanisms that Incentivize Data Sharing in Federated Learningcited by 39
- 2013Crowdsourced Judgement Elicitation with Endogenous Proficiencycited by 30
12 more
- 2014Optimum Statistical Estimation with Strategic Data Sourcescited by 28
- 2022Optimal and Differentially Private Data Acquisition: Central and Local Mechanismscited by 24
- 2020Truthful Data Acquisition via Peer Predictioncited by 14
- 2018Water from Two Rocks: Maximizing the Mutual Informationcited by 10
- 2017Optimal Data Acquisition for Statistical Estimationcited by 9
- 2014Buying Private Data without Verificationcited by 8
- 2023Evaluating and Incentivizing Diverse Data Contributions in Collaborative Learningcited by 8
- 2023Mechanism Design for Collaborative Normal Mean Estimationcited by 7
- 2023Incentivizing Honesty among Competitors in Collaborative Learning and Optimizationcited by 6
- 2024Collaborative Mean Estimation Among Heterogeneous Strategic Agents: Individual Rationality, Fairness, and Truthful Contributioncited by 4
- 2024Carrot and Stick: Eliciting Comparison Data and Beyondcited by 2
- 2025Incentivizing Truthful Data Contributions in a Marketplace for Mean Estimationcited by 1
Built on by
Not cited yet.