Performative Prediction with
Selective Labels
Giovani Valdrighi¹ Isabel Valera² Marcos Medeiros Raimundo¹
¹Universidade Estadual de Campinas ²Saarland University
NeurIPS 2026
The problem
Client profile
features x
Model
parameters \theta
Prediction
will they repay?
Decision
loan accepted
Decisions change people
Training data ≠
Post-deployment data
The problem
Each deployed model \theta induces its own distribution D(\theta)
Repeated retraining Retraining model \theta_t with newly collected data from D(\theta_{t-1})
Stable point
Repeated training converges to a model that is optimal for the distribution it induces
click or press R to replay
The problem
Accepted
Outcome observed: repaid or default
Rejected
Outcome never observed
It happens in
Lendingrepayment of rejected applicants
Hiringperformance of candidates not hired
Medical testingdiagnosis of untested patients
Selective labels: observation of labels (outcomes) is defined by model acceptance.
Can we still reach the stable point when labels are selective?
Accept-only retraining can end arbitrarily far from the stable point
click or press R to replay
l(x) \;\le\; \alpha(x) \;\le\; u(x)
For each profile x, the decision-maker knows a range that contains the probability of repaying.
click or press R to replay
Our method
Accepted
loss with the observed outcome
Rejected
worst-case loss over the plausible range
The distance to the stable solution is small when:
click or press R to replay
Takeaway
When models shape the population and we only see outcomes of those we accept, naive retraining can go wrong. A robust worst-case objective gets us close to the right answer.
Performative Prediction with Selective Labels
Giovani Valdrighi, Isabel Valera, Marcos Medeiros Raimundo