Stochastic Optimization Schemes for Performative Prediction with Nonconvex Loss
Qiang Li, Hoi-To Wai

TL;DR
This paper investigates stochastic gradient descent in performative prediction with non-convex loss, analyzing convergence to biased stable solutions under distribution shifts, and introduces schemes to reduce bias.
Contribution
It is the first to analyze SGD convergence in performative prediction with non-convex loss and proposes deployment schemes to mitigate bias.
Findings
SGD-GD converges to a biased SPS solution in expectation.
Bias is proportional to gradient variance and distribution sensitivity.
Lazy deployment reduces bias and improves convergence.
Abstract
This paper studies a risk minimization problem with decision dependent data distribution. The problem pertains to the performative prediction setting in which a trained model can affect the outcome estimated by the model. Such dependency creates a feedback loop that influences the stability of optimization algorithms such as stochastic gradient descent (SGD). We present the first study on performative prediction with smooth but possibly non-convex loss. We analyze a greedy deployment scheme with SGD (SGD-GD). Note that in the literature, SGD-GD is often studied with strongly convex loss. We first propose the definition of stationary performative stable (SPS) solutions through relaxing the popular performative stable condition. We then prove that SGD-GD converges to a biased SPS solution in expectation. We consider two conditions of sensitivity on the distribution shifts: (i) the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsNeural Networks and Applications · Image and Signal Denoising Methods · Stochastic Gradient Optimization Techniques
