Buyer-Initiated Auction Mechanism for Data Redemption in Machine Unlearning

• URL: http://arxiv.org/abs/2503.23001v3
• Date: Tue, 15 Apr 2025 09:43:59 GMT
• Title: Buyer-Initiated Auction Mechanism for Data Redemption in Machine Unlearning
• Authors: Bin Han, Di Feng, Jie Wang, Hans D. Schotten,
• Abstract summary: rapid growth of artificial intelligence (AI) has raised privacy concerns.<n>Leading regulations like California Consumer Privacy Act (CCPA)<n>We propose buyer-initiated auction mechanism for data redemption.
• Score: 10.43572220941666
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rapid growth of artificial intelligence (AI) has raised privacy concerns over user data, leading to regulations like the General Data Protection Regulation (GDPR) and the California Consumer Privacy Act (CCPA). With the essential toolbox provided by machine unlearning, AI service providers are now able to remove user data from their trained models as well as the training datasets, so as to comply with such regulations. However, extensive data redemption can be costly and degrade model accuracy. To balance the cost of unlearning and the privacy protection, we propose a buyer-initiated auction mechanism for data redemption, enabling the service provider to purchase data from willing users with appropriate compensation. This approach does not require the server to have any a priori knowledge about the users' privacy preference, and provides an efficient solution for maximizing the social welfare in the investigated problem.

Related papers

• Privacy-Preserving Federated Embedding Learning for Localized Retrieval-Augmented Generation [60.81109086640437]
  We propose a novel framework called Federated Retrieval-Augmented Generation (FedE4RAG) FedE4RAG facilitates collaborative training of client-side RAG retrieval models. We apply homomorphic encryption within federated learning to safeguard model parameters.
  arXiv  Detail & Related papers  (2025-04-27T04:26:02Z)
• AgentDAM: Privacy Leakage Evaluation for Autonomous Web Agents [75.85554113398626]
  We develop a benchmark called AgentDAM to evaluate how well existing and future AI agents can limit processing of potentially private information.<n>Our benchmark simulates realistic web interaction scenarios and is adaptable to all existing web navigation agents.
  arXiv  Detail & Related papers  (2025-03-12T19:30:31Z)
• Towards Data Governance of Frontier AI Models [0.0]
  We look at how data can enable new governance capacities for frontier AI models.<n>Data is non-rival, often non-excludable, easily replicable, and increasingly synthesizable.<n>We propose a set of policy mechanisms targeting key actors along the data supply chain.
  arXiv  Detail & Related papers  (2024-12-05T02:37:51Z)
• Wasserstein Markets for Differentially-Private Data [1.4266656344673316]
  Data markets provide a means to enable wider access as well as determine the appropriate privacy-utility trade-off. Existing data market frameworks either require a trusted third party to perform expensive valuations or are unable to capture the nature of data value. This paper proposes a valuation mechanism based on the Wasserstein distance for differentially-private data, and corresponding procurement mechanisms.
  arXiv  Detail & Related papers  (2024-12-03T17:40:26Z)
• Privacy-Preserving Intrusion Detection using Convolutional Neural Networks [0.25163931116642785]
  We explore the use case of a model owner providing an analytic service on customer's private data. No information about the data shall be revealed to the analyst and no information about the model shall be leaked to the customer. We enhance an attack detection system based on Convolutional Neural Networks with privacy-preserving technology based on PriMIA framework.
  arXiv  Detail & Related papers  (2024-04-15T09:56:36Z)
• Language Models Can Reduce Asymmetry in Information Markets [100.38786498942702]
  We introduce an open-source simulated digital marketplace where intelligent agents, powered by language models, buy and sell information on behalf of external participants. The central mechanism enabling this marketplace is the agents' dual capabilities: they have the capacity to assess the quality of privileged information but also come equipped with the ability to forget. To perform well, agents must make rational decisions, strategically explore the marketplace through generated sub-queries, and synthesize answers from purchased information.
  arXiv  Detail & Related papers  (2024-03-21T14:48:37Z)
• Towards Generalizable Data Protection With Transferable Unlearnable Examples [50.628011208660645]
  We present a novel, generalizable data protection method by generating transferable unlearnable examples. To the best of our knowledge, this is the first solution that examines data privacy from the perspective of data distribution.
  arXiv  Detail & Related papers  (2023-05-18T04:17:01Z)
• Protecting User Privacy in Online Settings via Supervised Learning [69.38374877559423]
  We design an intelligent approach to online privacy protection that leverages supervised learning. By detecting and blocking data collection that might infringe on a user's privacy, we can restore a degree of digital privacy to the user.
  arXiv  Detail & Related papers  (2023-04-06T05:20:16Z)
• Towards a User Privacy-Aware Mobile Gaming App Installation Prediction Model [0.8602553195689513]
  We investigate the process of predicting a mobile gaming app installation from the point of view of a demand-side platform. We explore the trade-off between privacy preservation and model performance. We conclude that privacy-aware models might still preserve significant capabilities.
  arXiv  Detail & Related papers  (2023-02-07T09:14:59Z)
• Certified Data Removal in Sum-Product Networks [78.27542864367821]
  Deleting the collected data is often insufficient to guarantee data privacy. UnlearnSPN is an algorithm that removes the influence of single data points from a trained sum-product network.
  arXiv  Detail & Related papers  (2022-10-04T08:22:37Z)
• Preference-Based Privacy Trading [19.23266277956912]
  We propose a design of regulated efficient/bounded inefficient economic mechanisms for oligopoly data trading markets using a novel preference function bidding approach on a simplified sellers-broker market. Our methodology preserves the heterogeneous privacy preservation constraints (at a grouped consumer, i.e., app, level) upto certain compromise levels, and at the same time satisfies information demand (via the broker) of agencies.
  arXiv  Detail & Related papers  (2020-12-10T07:03:10Z)
• PCAL: A Privacy-preserving Intelligent Credit Risk Modeling Framework Based on Adversarial Learning [111.19576084222345]
  This paper proposes a framework of Privacy-preserving Credit risk modeling based on Adversarial Learning (PCAL) PCAL aims to mask the private information inside the original dataset, while maintaining the important utility information for the target prediction task performance. Results indicate that PCAL can learn an effective, privacy-free representation from user data, providing a solid foundation towards privacy-preserving machine learning for credit risk analysis.
  arXiv  Detail & Related papers  (2020-10-06T07:04:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.