Neither Consent nor Property: A Policy Lab for Data Law

• URL: http://arxiv.org/abs/2510.26727v1
• Date: Thu, 30 Oct 2025 17:27:03 GMT
• Title: Neither Consent nor Property: A Policy Lab for Data Law
• Abstract summary: This paper makes the opaque data market in the AI economy empirically legible for the first time.<n>The pipeline begins with multi-year fieldwork to extract the market's hidden logic.<n>It is validated against reality, reproducing observed trade patterns.
• Score: 4.588656982178105
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper makes the opaque data market in the AI economy empirically legible for the first time, constructing a computational testbed to address a core epistemic failure: regulators governing a market defined by structural opacity, fragile price discovery, and brittle technical safeguards that have paralyzed traditional empirics and fragmented policy. The pipeline begins with multi-year fieldwork to extract the market's hidden logic, and then embeds these grounded behaviors into a high-fidelity ABM, parameterized via a novel LLM-based discrete-choice experiment that captures the preferences of unsurveyable populations. The pipeline is validated against reality, reproducing observed trade patterns. This policy laboratory delivers clear, counter-intuitive results. First, property-style relief is a false promise: ''anonymous-data'' carve-outs expand trade but ignore risk, causing aggregate welfare to collapse once external harms are priced in. Second, social welfare peaks when the downstream buyer internalizes the full substantive risk. This least-cost avoider approach induces efficient safeguards, simultaneously raising welfare and sustaining trade, and provides a robust empirical foundation for the legal drift toward two-sided reachability. The contribution is a reproducible pipeline designed to end the reliance on intuition. It converts qualitative insight into testable, comparative policy experiments, obsoleting armchair conjecture by replacing it with controlled evidence on how legal rules actually shift risk and surplus. This is the forward-looking engine that moves the field from competing intuitions to direct, computational analysis.

Related papers

• AI Slop and Hallucinations in Vulnerability Assessment: A Survey on Reasoning Failures and Trustworthy Mitigation [48.55515767840701]
  "AI slop" is artifacts, hallucinated vulnerabilities, plausible but incorrect patches, and semantically repackaged bug reports.<n>This paper surveys the empirical evidence, identifies a unifying mechanism, and traces a path toward trustworthy triage.
  arXiv  Detail & Related papers  (2026-08-26T11:48:38Z)
• Steering LLM Viewpoints through Fabricated Evidence Injection [61.22850755490993]
  We introduce a two-phase attack framework that first repackages misleading statements with fabricated rationales, then instruct target LLMs to incorporate these viewpoints when responding to relevant queries.<n>Experiments on BBQ, ToxiGen, and our specialized dataset reveal that commercial LLMs without external safety classifiers remain highly vulnerable.<n>Building on this, we explore multiple defense strategies, among which a tailored safety policy enablesgpt-oss-safeguard to achieve 81% detection rate.
  arXiv  Detail & Related papers  (2026-06-04T14:48:23Z)
• LC-ERD: Mining Latent Logic for Self-Evolving Reasoning via Consistency-Regulated Reward Decomposition [55.572260012037084]
  We introduce LC-ERD (Logic-Consistent Endogenous Reward Decomposition), a framework framing self-alignment as latent structure mining.<n>We derive a Variational Logic Potential by aggregating consensus from the model's Latent Logic Expertise.<n>Experiments show LC-ERD delivers a robust self-evolution path, uncovering trade-offs between logic consistency and accuracy.
  arXiv  Detail & Related papers  (2026-05-19T07:27:50Z)
• Representation Signatures and Risk-Feedback Alignment in LLM Trading Agents [0.0635655952373977]
  We study behavioral alignment and representation dynamics of large language model (LLM) agents in financial decision environments.<n>We find that planning embeddings drift from normal-state centroids, fused plan-risk representations separate normal from pre-drawdown states, and diagnostics show effective-rank contraction before failures.<n>We also find that structured risk feedback can act as an external alignment signal without fine-tuning, but not as a universal performance enhancer.
  arXiv  Detail & Related papers  (2026-05-16T16:53:34Z)
• Decomposing Discrimination: Causal Mediation Analysis for AI-Driven Credit Decisions [0.0]
  Statistical fairness metrics in AI-driven credit decisions conflate two causally distinct mechanisms.<n>We formalise this distinction using Pearl's framework of natural direct and indirect effects applied to the credit decision setting.<n>We show that interventional direct and indirect effects (IDE/IIE) are identified under the weaker Modified Sequential Ignorability assumption.
  arXiv  Detail & Related papers  (2026-03-29T04:20:09Z)
• The Inference Bottleneck: Antitrust and Neutrality Duties in the Age of Cognitive Infrastructure [0.0]
  As generative AI commercializes, competitive advantage is shifting from one-time model training toward continuous inference, distribution, and routing.<n>This essay defines cognitive infrastructure as a falsifiable concept built around measurable reliance, vertical incentives, and discrimination capacity.<n>It frames theories of harm using raising-rivals'-costs logic for vertically related and platform markets, where foreclosure can be profitable without anticompetitive pricing.
  arXiv  Detail & Related papers  (2026-02-26T08:37:32Z)
• Prediction Laundering: The Illusion of Neutrality, Transparency, and Governance in Polymarket [17.356126657763806]
  This paper presents a qualitative sociotechnical audit of Polymarket (N = 27), combining digital ethnography, interpretive walkthroughs, and semi-structured interviews.<n>We show how subjective, high-uncertainty bets, strategic hedges, and capital-heavy whale activity are stripped of their original noise through algorithmic aggregation.
  arXiv  Detail & Related papers  (2026-02-05T01:19:25Z)
• Copyright Laundering Through the AI Ouroboros: Adapting the 'Fruit of the Poisonous Tree' Doctrine to Recursive AI Training [0.31061678033205636]
  Copyright enforcement rests on an evidentiary bargain.<n>It comes under strain when AI systems are trained through multi-generational pipelines.<n>This Article adapts the "fruit of the poisonous tree" (FOPT) principle to propose a AI-FOPT standard.
  arXiv  Detail & Related papers  (2026-01-06T01:02:50Z)
• Sell Data to AI Algorithms Without Revealing It: Secure Data Valuation and Sharing via Homomorphic Encryption [10.12846924939717]
  We introduce the Trustworthy Influence Protocol (TIP), a privacy-preserving framework that enables buyers to quantify the utility of external data without decrypting the raw assets.<n>By integrating Homomorphic Encryption with gradient-based influence functions, our approach allows for the precise, blinded scoring of data points against a buyer's specific AI model.<n> Empirical simulations in healthcare and generative AI domains validate the framework's economic potential.
  arXiv  Detail & Related papers  (2025-12-04T16:35:09Z)
• Profit over Proxies: A Scalable Bayesian Decision Framework for Optimizing Multi-Variant Online Experiments [0.0352925259310339]
  Online controlled experiments (A/B tests) are fundamental to data-driven decision-making in the digital economy.<n>"p-value" inflates false positive rates, and an over-reliance on proxy metrics like conversion rates can lead to decisions that inadvertently harm core business profitability.<n>This paper introduces a comprehensive and scalable Bayesian decision framework designed for profit optimization in multi-variant (A/B/n) experiments.
  arXiv  Detail & Related papers  (2025-09-16T02:24:20Z)
• Verification-Guided Falsification for Safe RL via Explainable Abstraction and Risk-Aware Exploration [8.246285288584625]
  We propose a hybrid framework that integrates explainability, model checking, and risk-guided falsification to achieve both rigor and coverage.<n>Our approach begins by constructing a human-interpretable abstraction of the RL policy using Comprehensible Abstract Policy Summarization (CAPS)<n>If no violation is detected, we cannot conclude satisfaction due to potential limitation in the abstraction and coverage of the offline dataset.
  arXiv  Detail & Related papers  (2025-06-04T00:54:01Z)
• Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs [71.7892165868749]
  Commercial Large Language Model (LLM) APIs create a fundamental trust problem.<n>Users pay for specific models but have no guarantee that providers deliver them faithfully.<n>We formalize this model substitution problem and evaluate detection methods under realistic adversarial conditions.<n>We propose and evaluate the use of Trusted Execution Environments (TEEs) as one practical and robust solution.
  arXiv  Detail & Related papers  (2025-04-07T03:57:41Z)
• Counterfactual Realizability [52.85109506684737]
  We introduce a formal definition of realizability, the ability to draw samples from a distribution, and then develop a complete algorithm to determine whether an arbitrary counterfactual distribution is realizable.<n>We illustrate the implications of this new framework for counterfactual data collection using motivating examples from causal fairness and causal reinforcement learning.
  arXiv  Detail & Related papers  (2025-03-14T20:54:27Z)
• Sequential Manipulation Against Rank Aggregation: Theory and Algorithm [119.57122943187086]
  We leverage an online attack on the vulnerable data collection process. From the game-theoretic perspective, the confrontation scenario is formulated as a distributionally robust game. The proposed method manipulates the results of rank aggregation methods in a sequential manner.
  arXiv  Detail & Related papers  (2024-07-02T03:31:21Z)
• From Mean to Extreme: Formal Differential Privacy Bounds on the Success of Real-World Data Reconstruction Attacks [54.25638567385662]
  Differential Privacy in machine learning is often interpreted as guarantees against membership inference.<n> translating DP budgets into quantitative protection against the more damaging threat of data reconstruction remains a challenging open problem.<n>This paper bridges the critical gap by deriving the first formal privacy bounds tailored to the mechanics of demonstrated "from-scratch" attacks.
  arXiv  Detail & Related papers  (2024-02-20T09:52:30Z)
• Off-Policy Evaluation for Large Action Spaces via Policy Convolution [60.6953713877886]
  Policy Convolution family of estimators uses latent structure within actions to strategically convolve the logging and target policies. Experiments on synthetic and benchmark datasets demonstrate remarkable mean squared error (MSE) improvements when using PC.
  arXiv  Detail & Related papers  (2023-10-24T01:00:01Z)
• Theoretically Principled Trade-off for Stateful Defenses against Query-Based Black-Box Attacks [26.905553663353825]
  We offer a theoretical characterization of the trade-off between detection and false positive rates for stateful defenses. We analyze the impact of this trade-off on the convergence of black-box attacks.
  arXiv  Detail & Related papers  (2023-07-30T22:31:01Z)
• Hallucinated Adversarial Control for Conservative Offline Policy Evaluation [64.94009515033984]
  We study the problem of conservative off-policy evaluation (COPE) where given an offline dataset of environment interactions, we seek to obtain a (tight) lower bound on a policy's performance. We introduce HAMBO, which builds on an uncertainty-aware learned model of the transition dynamics. We prove that the resulting COPE estimates are valid lower bounds, and, under regularity conditions, show their convergence to the true expected return.
  arXiv  Detail & Related papers  (2023-03-02T08:57:35Z)
• Equilibrium of Data Markets with Externality [5.383900608313559]
  We model real-world data markets, where sellers post fixed prices and buyers are free to purchase from any set of sellers. A key component here is the negative externality buyers induce on one another due to data purchases. We prove that platforms intervening through a transaction cost can lead to a pure equilibrium with strong welfare guarantees.
  arXiv  Detail & Related papers  (2023-02-16T00:57:49Z)
• Debiasing Recommendation by Learning Identifiable Latent Confounders [49.16119112336605]
  Confounding bias arises due to the presence of unmeasured variables that can affect both a user's exposure and feedback. Existing methods either (1) make untenable assumptions about these unmeasured variables or (2) directly infer latent confounders from users' exposure. We propose a novel method, i.e., identifiable deconfounder (iDCF), which leverages a set of proxy variables to resolve the aforementioned non-identification issue.
  arXiv  Detail & Related papers  (2023-02-10T05:10:26Z)
• Provable Unrestricted Adversarial Training without Compromise with Generalizability [44.02361569894942]
  Adversarial training (AT) is widely considered as the most promising strategy to defend against adversarial attacks. The existing AT methods often achieve adversarial robustness at the expense of standard generalizability. We propose a novel AT approach called Provable Unrestricted Adversarial Training (PUAT)
  arXiv  Detail & Related papers  (2023-01-22T07:45:51Z)
• Towards Futuristic Autonomous Experimentation--A Surprise-Reacting Sequential Experiment Policy [7.485913259227432]
  An autonomous experimentation platform in manufacturing is supposedly capable of conducting a sequential search for suitable manufacturing conditions by itself or for discovering new materials with minimal human intervention. The core of the intelligent control of such platforms is a policy to decide where to conduct the next experiment based on what has been done thus far. We discuss whether it is beneficial to trade off exploitation versus exploration by measuring the element and degree of surprise associated with the immediate past observation.
  arXiv  Detail & Related papers  (2021-12-01T16:14:49Z)

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.