mlsanityData to 14 Oct 2026

Asymptotically Fair Participation in Machine Learning Models: an Optimal Control Perspective

arXiv 2311.10223 ↗First posted 16 Nov 2023cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

The performance of state-of-the-art machine learning models often deteriorates when testing on demographics that are under-represented in the training dataset. This problem has predominately been studied in a supervised learning setting where the data distribution is static. However, real-world applications often involve distribution shifts caused by the deployed models. For instance, the performance disparity against monitory users can lead to a high customer churn rate, thus the available data provided by active users are skewed due to the lack of minority users. This feedback effect further exacerbates the disparity among different demographic groups in future steps. To address this issue, we propose asymptotically fair participation as a condition to maintain long-term model performance over all demographic groups. In this work, we aim to address the problem of achieving asymptotically fair participation via optimal control formulation. Moreover, we design a surrogate retention system based on existing literature on evolutionary population dynamics to approximate the dynamics of distribution shifts on active user counts, from which the objective of achieving asymptotically fair participation is formulated as an optimal control problem, and the control variables are considered as the model parameters. We apply an efficient implementation of Pontryagin's maximum principle to estimate the optimal control solution. To evaluate the effectiveness of the proposed method, we design a generic simulation environment that simulates the population dynamics of the feedback effect between user retention and model performance. When we deploy the resulting models to the simulation environment, the optimal control solution accounts for long-term planning and leads to superior performance compared with existing baseline methods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 38 references that are in the map. First posted on arXiv 16 Nov 2023.

Builds on

18 of 38 references.

References · 18

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Trust Region Policy Optimizationcited by 2,580
  3. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  4. 2014Certifying and removing disparate impactcited by 715
  5. 2019Augmented Neural ODEscited by 397
  6. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
  7. 2017Stable Architectures for Deep Neural Networkscited by 341
  8. 2018Delayed Impact of Fair Machine Learningcited by 184
  9. 2017Maximum Principle Based Algorithms for Deep Learningcited by 78
  10. 2018A Mean-Field Optimal Control Formulation of Deep Learningcited by 67
  11. 2020How Do Fair Decisions Fare in Long-term Qualification?cited by 60
  12. 2019Group Retention when Using Machine Learning in Sequential Decision Making: the Interplay between User Dynamics and Fairnesscited by 38
6 more
  1. 2019Deep Learning Theory Review: An Optimal Control and Dynamical Systems Perspectivecited by 27
  2. 2018An Optimal Control Approach to Deep Learning and Applications to Discrete-Weight Neural Networkscited by 26
  3. 2019ProPublica's COMPAS Data Revisitedcited by 24
  4. 2021Towards Robust Neural Networks via Close-loop Controlcited by 23
  5. 2022Self-Healing Robust Neural Networks via Closed-Loop Controlcited by 5
  6. 2020DDPNOpt: Differential Dynamic Programming Neural Optimizercited by 4

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.