Making Decisions under Outcome Performativity

• URL: http://arxiv.org/abs/2210.01745v2
• Date: Sat, 7 Jan 2023 02:41:22 GMT
• Title: Making Decisions under Outcome Performativity
• Authors: Michael P. Kim and Juan C. Perdomo
• Abstract summary: We introduce a new optimality concept -- performative omniprediction. A performative omnipredictor is a single predictor that simultaneously encodes the optimal decision rule. We show that efficient performative omnipredictors exist, under a natural restriction of performative prediction.
• Score: 9.962472413291803
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Decision-makers often act in response to data-driven predictions, with the goal of achieving favorable outcomes. In such settings, predictions don't passively forecast the future; instead, predictions actively shape the distribution of outcomes they are meant to predict. This performative prediction setting raises new challenges for learning "optimal" decision rules. In particular, existing solution concepts do not address the apparent tension between the goals of forecasting outcomes accurately and steering individuals to achieve desirable outcomes. To contend with this concern, we introduce a new optimality concept -- performative omniprediction -- adapted from the supervised (non-performative) learning setting. A performative omnipredictor is a single predictor that simultaneously encodes the optimal decision rule with respect to many possibly-competing objectives. Our main result demonstrates that efficient performative omnipredictors exist, under a natural restriction of performative prediction, which we call outcome performativity. On a technical level, our results follow by carefully generalizing the notion of outcome indistinguishability to the outcome performative setting. From an appropriate notion of Performative OI, we recover many consequences known to hold in the supervised setting, such as omniprediction and universal adaptability.

Related papers

• Performative Prediction on Games and Mechanism Design [69.7933059664256]
  We study a collective risk dilemma where agents decide whether to trust predictions based on past accuracy. As predictions shape collective outcomes, social welfare arises naturally as a metric of concern. We show how to achieve better trade-offs and use them for mechanism design.
  arXiv  Detail & Related papers  (2024-08-09T16:03:44Z)
• The Relative Value of Prediction in Algorithmic Decision Making [0.0]
  We ask: What is the relative value of prediction in algorithmic decision making? We identify simple, sharp conditions determining the relative value of prediction vis-a-vis expanding access. We illustrate how these theoretical insights may be used to guide the design of algorithmic decision making systems in practice.
  arXiv  Detail & Related papers  (2023-12-13T20:52:45Z)
• Performative Time-Series Forecasting [71.18553214204978]
  We formalize performative time-series forecasting (PeTS) from a machine-learning perspective. We propose a novel approach, Feature Performative-Shifting (FPS), which leverages the concept of delayed response to anticipate distribution shifts. We conduct comprehensive experiments using multiple time-series models on COVID-19 and traffic forecasting tasks.
  arXiv  Detail & Related papers  (2023-10-09T18:34:29Z)
• Predicting from Predictions [18.393971232725015]
  We study how causal effects of predictions on outcomes can be identified from observational data. We show that supervised learning that predict from predictions can find transferable functional relationships between features, predictions, and outcomes.
  arXiv  Detail & Related papers  (2022-08-15T16:57:02Z)
• What Should I Know? Using Meta-gradient Descent for Predictive Feature Discovery in a Single Stream of Experience [63.75363908696257]
  computational reinforcement learning seeks to construct an agent's perception of the world through predictions of future sensations. An open challenge in this line of work is determining from the infinitely many predictions that the agent could possibly make which predictions might best support decision-making. We introduce a meta-gradient descent process by which an agent learns what predictions to make, 2) the estimates for its chosen predictions, and 3) how to use those estimates to generate policies that maximize future reward.
  arXiv  Detail & Related papers  (2022-06-13T21:31:06Z)
• Private Prediction Sets [72.75711776601973]
  Machine learning systems need reliable uncertainty quantification and protection of individuals' privacy. We present a framework that treats these two desiderata jointly. We evaluate the method on large-scale computer vision datasets.
  arXiv  Detail & Related papers  (2021-02-11T18:59:11Z)
• Right Decisions from Wrong Predictions: A Mechanism Design Alternative to Individual Calibration [107.15813002403905]
  Decision makers often need to rely on imperfect probabilistic forecasts. We propose a compensation mechanism ensuring that the forecasted utility matches the actually accrued utility. We demonstrate an application showing how passengers could confidently optimize individual travel plans based on flight delay probabilities.
  arXiv  Detail & Related papers  (2020-11-15T08:22:39Z)
• Counterfactual Predictions under Runtime Confounding [74.90756694584839]
  We study the counterfactual prediction task in the setting where all relevant factors are captured in the historical data. We propose a doubly-robust procedure for learning counterfactual prediction models in this setting.
  arXiv  Detail & Related papers  (2020-06-30T15:49:05Z)
• Fast, Optimal, and Targeted Predictions using Parametrized Decision Analysis [0.0]
  We develop a class of parametrized actions for Bayesian decision analysis that produce optimal, scalable, and simple targeted predictions. Predictions are constructed for physical activity data from the National Health and Nutrition Examination Survey.
  arXiv  Detail & Related papers  (2020-06-23T15:55:47Z)

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.