Approximate Regions of Attraction in Learning with Decision-Dependent Distributions
Roy Dong, Heling Zhang, Lillian J. Ratliff

TL;DR
This paper analyzes the stability and convergence of learning algorithms in environments where data distributions react to decisions, providing conditions for the regions of attraction and introducing the concept of performative alignment.
Contribution
It offers a novel analysis of repeated risk minimization as perturbed gradient flows and introduces performative alignment to understand convergence in decision-dependent data settings.
Findings
Provided sufficient conditions for regions of attraction of equilibria.
Characterized the impact of initial conditions on long-term behavior.
Introduced the concept of performative alignment for convergence analysis.
Abstract
As data-driven methods are deployed in real-world settings, the processes that generate the observed data will often react to the decisions of the learner. For example, a data source may have some incentive for the algorithm to provide a particular label (e.g. approve a bank loan), and manipulate their features accordingly. Work in strategic classification and decision-dependent distributions seeks to characterize the closed-loop behavior of deploying learning algorithms by explicitly considering the effect of the classifier on the underlying data distribution. More recently, works in performative prediction seek to classify the closed-loop behavior by considering general properties of the mapping from classifier to data distribution, rather than an explicit form. Building on this notion, we analyze repeated risk minimization as the perturbed trajectories of the gradient flows of…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Machine Learning and Algorithms · Advanced Bandit Algorithms Research
