Prediction-sharing During Training and Inference

• URL: http://arxiv.org/abs/2403.17515v1
• Date: Tue, 26 Mar 2024 09:18:50 GMT
• Title: Prediction-sharing During Training and Inference
• Authors: Yotam Gafni, Ronen Gradwohl, Moshe Tennenholtz,
• Abstract summary: We study the differences between contracts that share prediction models only, contracts to share inference-time predictions only, and contracts to share both. Our analysis proceeds on three levels. First, we develop a general Bayesian framework that facilitates our study. In the third level of our analysis we demonstrate the applicability of our concepts in a synthetic simulation using real loan data.
• Score: 12.461217702808202
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Two firms are engaged in a competitive prediction task. Each firm has two sources of data -- labeled historical data and unlabeled inference-time data -- and uses the former to derive a prediction model, and the latter to make predictions on new instances. We study data-sharing contracts between the firms. The novelty of our study is to introduce and highlight the differences between contracts that share prediction models only, contracts to share inference-time predictions only, and contracts to share both. Our analysis proceeds on three levels. First, we develop a general Bayesian framework that facilitates our study. Second, we narrow our focus to two natural settings within this framework: (i) a setting in which the accuracy of each firm's prediction model is common knowledge, but the correlation between the respective models is unknown; and (ii) a setting in which two hypotheses exist regarding the optimal predictor, and one of the firms has a structural advantage in deducing it. Within these two settings we study optimal contract choice. More specifically, we find the individually rational and Pareto-optimal contracts for some notable cases, and describe specific settings where each of the different sharing contracts emerge as optimal. Finally, in the third level of our analysis we demonstrate the applicability of our concepts in a synthetic simulation using real loan data.

Related papers

• Prediction Markets with Intermittent Contributions [2.7429630700600893]
  We place ourselves in a more general framework, based on prediction markets.<n>There, independent agents trade forecasts of uncertain future events in exchange for rewards.<n>We introduce and analyse a prediction market that (i) accounts for the historical performance of the agents, (ii) adapts to time-varying conditions, while (iii) permitting agents to enter and exit the market at will.
  arXiv  Detail & Related papers  (2025-10-15T10:23:28Z)
• When Does Multimodality Lead to Better Time Series Forecasting? [96.26052272121615]
  We investigate whether and under what conditions such multimodal integration consistently yields gains.<n>Our findings reveal that the benefits of multimodality are highly condition-dependent.<n>Our study offers a rigorous, quantitative foundation for understanding when multimodality can be expected to aid forecasting tasks.
  arXiv  Detail & Related papers  (2025-06-20T23:55:56Z)
• Individualised Counterfactual Examples Using Conformal Prediction Intervals [12.895240620484572]
  High-dimensional feature spaces that are typical of machine learning classification models admit many possible counterfactual examples to a decision.<n>We explicitly model the knowledge of the individual, and assess the uncertainty of predictions which the individual makes by the width of a conformal prediction interval.<n>We present a synthetic data set on a hypercube which allows us to fully visualise the decision boundary.<n>Second, in this synthetic data set we explore the impact of a single CPICF on the knowledge of an individual locally around the original query.
  arXiv  Detail & Related papers  (2025-05-28T13:13:52Z)
• Reconciling Model Multiplicity for Downstream Decision Making [24.335927243672952]
  We show that even when the two predictive models approximately agree on their individual predictions almost everywhere, it is still possible for their induced best-response actions to differ on a substantial portion of the population. We propose a framework that calibrates the predictive models with regard to both the downstream decision-making problem and the individual probability prediction.
  arXiv  Detail & Related papers  (2024-05-30T03:36:46Z)
• Predictive Churn with the Set of Good Models [61.00058053669447]
  This paper explores connections between two seemingly unrelated concepts of predictive inconsistency. The first, known as predictive multiplicity, occurs when models that perform similarly produce conflicting predictions for individual samples. The second concept, predictive churn, examines the differences in individual predictions before and after model updates.
  arXiv  Detail & Related papers  (2024-02-12T16:15:25Z)
• Delegated Classification [21.384062337682185]
  We propose a theoretical framework for incentive-aware delegation of machine learning tasks. We define budget-optimal contracts and prove they take a simple threshold form under reasonable assumptions. Empirically, we demonstrate that budget-optimal contracts can be constructed using small-scale data.
  arXiv  Detail & Related papers  (2023-06-20T11:59:03Z)
• DRFLM: Distributionally Robust Federated Learning with Inter-client Noise via Local Mixup [58.894901088797376]
  federated learning has emerged as a promising approach for training a global model using data from multiple organizations without leaking their raw data. We propose a general framework to solve the above two challenges simultaneously. We provide comprehensive theoretical analysis including robustness analysis, convergence analysis, and generalization ability.
  arXiv  Detail & Related papers  (2022-04-16T08:08:29Z)
• Joint Forecasting of Panoptic Segmentations with Difference Attention [72.03470153917189]
  We study a new panoptic segmentation forecasting model that jointly forecasts all object instances in a scene. We evaluate the proposed model on the Cityscapes and AIODrive datasets.
  arXiv  Detail & Related papers  (2022-04-14T17:59:32Z)
• Stock2Vec: An Embedding to Improve Predictive Models for Companies [0.5872014229110215]
  We create an embedding of company stocks, Stock2Vec, which can be easily added to any prediction model. We then conduct comprehensive experiments to evaluate this embedding in applied machine learning problems. Our experiment results demonstrate that the four features in the Stock2Vec embedding can readily augment existing cross-company models.
  arXiv  Detail & Related papers  (2022-01-27T02:57:01Z)
• Test-time Collective Prediction [73.74982509510961]
  Multiple parties in machine learning want to jointly make predictions on future test points. Agents wish to benefit from the collective expertise of the full set of agents, but may not be willing to release their data or model parameters. We explore a decentralized mechanism to make collective predictions at test time, leveraging each agent's pre-trained model.
  arXiv  Detail & Related papers  (2021-06-22T18:29:58Z)
• Characterizing Fairness Over the Set of Good Models Under Selective Labels [69.64662540443162]
  We develop a framework for characterizing predictive fairness properties over the set of models that deliver similar overall performance. We provide tractable algorithms to compute the range of attainable group-level predictive disparities. We extend our framework to address the empirically relevant challenge of selectively labelled data.
  arXiv  Detail & Related papers  (2021-01-02T02:11:37Z)
• Double Robust Representation Learning for Counterfactual Prediction [68.78210173955001]
  We propose a novel scalable method to learn double-robust representations for counterfactual predictions. We make robust and efficient counterfactual predictions for both individual and average treatment effects. The algorithm shows competitive performance with the state-of-the-art on real world and synthetic data.
  arXiv  Detail & Related papers  (2020-10-15T16:39:26Z)
• MACE: A Flexible Framework for Membership Privacy Estimation in Generative Models [14.290199072565162]
  We propose the first formal framework for membership privacy estimation in generative models. Compared to previous works, our framework makes more realistic and flexible assumptions.
  arXiv  Detail & Related papers  (2020-09-11T23:15:05Z)
• Stochastic Optimization for Performative Prediction [31.876692592395777]
  We study the difference between merely updating model parameters and deploying the new model. We prove rates of convergence for both greedily deploying models after each update and for taking several updates before redeploying. They illustrate how depending on the strength of performative effects, there exists a regime where either approach outperforms the other.
  arXiv  Detail & Related papers  (2020-06-12T00:31:16Z)
• Ambiguity in Sequential Data: Predicting Uncertain Futures with Recurrent Models [110.82452096672182]
  We propose an extension of the Multiple Hypothesis Prediction (MHP) model to handle ambiguous predictions with sequential data. We also introduce a novel metric for ambiguous problems, which is better suited to account for uncertainties.
  arXiv  Detail & Related papers  (2020-03-10T09:15:42Z)

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.