Dissecting Performative Prediction: A Comprehensive Survey

• URL: http://arxiv.org/abs/2602.10176v1
• Date: Tue, 10 Feb 2026 18:40:01 GMT
• Title: Dissecting Performative Prediction: A Comprehensive Survey
• Authors: Thomas Kehrenberg, Javier Sanguino, Jose A. Lozano, Novi Quadrianto,
• Abstract summary: The field of performative prediction had its beginnings in 2020 with the seminal paper "Performative Prediction" by Perdomo et al.<n>We lay out the performative prediction setting and explain the different optimization targets: performative stability and performative optimality.<n>We introduce a new way of classifying different performative prediction settings, based on how much information is available about the distribution map.
• Score: 2.348413034000433
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The field of performative prediction had its beginnings in 2020 with the seminal paper "Performative Prediction" by Perdomo et al., which established a novel machine learning setup where the deployment of a predictive model causes a distribution shift in the environment, which in turn causes a mismatch between the distribution expected by the predictive model and the real distribution. This shift is defined by a so-called distribution map. In the half-decade since, a literature has emerged which has, among other things, introduced new solution concepts to the original setup, extended the setup, offered new theoretical analyses, and examined the intersection of performative prediction and other established fields. In this survey, we first lay out the performative prediction setting and explain the different optimization targets: performative stability and performative optimality. We introduce a new way of classifying different performative prediction settings, based on how much information is available about the distribution map. We survey existing implementations of distribution maps and existing methods to address the problem of performative prediction, while examining different ways to categorize them. Finally, we point out known and previously unknown connections that can be drawn to other fields, in the hopes of stimulating future research.

Related papers

• Forests of Uncertaint(r)ees: Using tree-based ensembles to estimate probability distributions of future conflict [0.0]
  We develop a strategy to quantify uncertainty in conflict forecasting, shifting from traditional point predictions to full predictive distributions.<n>Models are able to consistently outperform a suite of benchmarks derived from conflict history in predictions up to one year in advance.<n>We emphasize the need to understand how a metric behaves for a given prediction problem, in our case characterized by extremely high zero-inflatedness.
  arXiv  Detail & Related papers  (2025-12-05T23:10:16Z)
• Understanding Fixed Predictions via Confined Regions [30.421105594069676]
  Machine learning models can assign fixed predictions that preclude individuals from changing their outcome.<n>Existing approaches to audit fixed predictions do so on a pointwise basis, which requires access to an existing dataset of individuals.<n>This work presents a new paradigm to identify fixed predictions by finding confined regions of the feature space in which all individuals receive fixed predictions.
  arXiv  Detail & Related papers  (2025-02-22T23:06:10Z)
• Distributionally Robust Performative Prediction [25.580721293862467]
  We introduce a novel framework of distributionally robust performative prediction and study a new solution concept termed as distributionally robust performative optimum (O)<n>We show provable guarantees for DRPO as a robust approximation to the true PO when the nominal distribution map is different from the actual one.<n>Results demonstrate that DRPO offers potential advantages over traditional PO approach when the distribution map is misspecified at either micro- or macro-level.
  arXiv  Detail & Related papers  (2024-12-05T17:05:49Z)
• Rejection via Learning Density Ratios [50.91522897152437]
  Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.<n>We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.<n>Our framework is tested empirically over clean and noisy datasets.
  arXiv  Detail & Related papers  (2024-05-29T01:32:17Z)
• Source-Free Unsupervised Domain Adaptation with Hypothesis Consolidation of Prediction Rationale [53.152460508207184]
  Source-Free Unsupervised Domain Adaptation (SFUDA) is a challenging task where a model needs to be adapted to a new domain without access to target domain labels or source domain data. This paper proposes a novel approach that considers multiple prediction hypotheses for each sample and investigates the rationale behind each hypothesis. To achieve the optimal performance, we propose a three-step adaptation process: model pre-adaptation, hypothesis consolidation, and semi-supervised learning.
  arXiv  Detail & Related papers  (2024-02-02T05:53:22Z)
• Confidence and Dispersity Speak: Characterising Prediction Matrix for Unsupervised Accuracy Estimation [51.809741427975105]
  This work aims to assess how well a model performs under distribution shifts without using labels. We use the nuclear norm that has been shown to be effective in characterizing both properties. We show that the nuclear norm is more accurate and robust in accuracy than existing methods.
  arXiv  Detail & Related papers  (2023-02-02T13:30:48Z)
• Patch-level Gaze Distribution Prediction for Gaze Following [49.93340533068501]
  We introduce the patch distribution prediction ( PDP) method for gaze following training. We show that our model regularizes the MSE loss by predicting better heatmap distributions on images with larger annotation variances. Experiments show that our model bridging the gap between the target prediction and in/out prediction subtasks, showing a significant improvement on both subtasks on public gaze following datasets.
  arXiv  Detail & Related papers  (2022-11-20T19:25:15Z)
• End-to-End Trajectory Distribution Prediction Based on Occupancy Grid Maps [29.67295706224478]
  In this paper, we aim to forecast a future trajectory distribution of a moving agent in the real world, given the social scene images and historical trajectories. We learn the distribution with symmetric cross-entropy using occupancy grid maps as an explicit and scene-compliant approximation to the ground-truth distribution. In experiments, our method achieves state-of-the-art performance on the Stanford Drone dataset and Intersection Drone dataset.
  arXiv  Detail & Related papers  (2022-03-31T09:24:32Z)
• CovarianceNet: Conditional Generative Model for Correct Covariance Prediction in Human Motion Prediction [71.31516599226606]
  We present a new method to correctly predict the uncertainty associated with the predicted distribution of future trajectories. Our approach, CovariaceNet, is based on a Conditional Generative Model with Gaussian latent variables.
  arXiv  Detail & Related papers  (2021-09-07T09:38:24Z)
• Which Invariance Should We Transfer? A Causal Minimax Learning Approach [18.71316951734806]
  We present a comprehensive minimax analysis from a causal perspective. We propose an efficient algorithm to search for the subset with minimal worst-case risk. The effectiveness and efficiency of our methods are demonstrated on synthetic data and the diagnosis of Alzheimer's disease.
  arXiv  Detail & Related papers  (2021-07-05T09:07:29Z)
• 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)
• Robustness via Cross-Domain Ensembles [0.5801044612920816]
  We present a method for making neural network predictions robust to shifts from the training data distribution. The proposed method is based on making predictions via a diverse set of cues and ensembling them into one strong prediction.
  arXiv  Detail & Related papers  (2021-03-19T17:28:03Z)

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.