Backend
The Stability of Online Algorithms in Performative Prediction
arXiv stat.ML0 views
arXiv:2602.24207v3 Announce Type: replace-cross Abstract: The use of algorithmic predictions in decision-making leads to a feedback loop where the models we deploy actively influence the data distributions we see, and later use to retrain on. This dynamic was formalized by Perdomo et al. 2020 in their work on performative prediction. Our main result is an unconditional reduction showing that any no-regret algorithm deployed in performative settings converges to a (mixed) performatively stable equilibrium: a solution in which models actively shape data distributions in ways that their own predictions look optimal in hindsight. Prior to our work, all positive results in this area imposed strong restrictions on how models influenced distributions. By using a martingale argument and allowing randomization, we avoid any assumption on how populations respond to predictions and sidestep recent hardness results showing that deterministic stable models are in general PPAD-hard to compute. Lastly, on a more conceptual note, our connection sheds light on why common algorithms, like gradient descent, are naturally stabilizing and prevent runaway feedback loops. We hope our work enables future technical transfer of ideas between online optimization and performativity.
Source:https://arxiv.org/abs/2602.24207PreviousOracle-Robust Online Alignment for Large Language ModelsNextOne Method Does Not Fit All: A Large-Scale Benchmark of Imputation Methods for Single-Cell RNA Sequencing Data
Related posts

We rewrote zg in Rust, cutting indexing time by 65% and peak memory by 53%
0Rust Users Forum

Michiu (now at v0.2.2!): An experimental GUI library for Windows focused on DirectComposition, wgpu, and DOD
0Rust Users Forum
Mocking a 410 Gone for a Retired Resource vs a Plain 404
0dev.to
Three MCP Python SDK Advisories, and the One an Upgrade Will Not Fix
0dev.to
We Benchmarked GPT-Image-2.6 Native <svg> Output: Path Counts, Cost & Real Edge Cases
0dev.to
When an MCP Tool Needs a Missing Value: Elicitation vs Failing the Call
0dev.to