Algorithms that solve zero-sum games, multi-objective agent objectives, or, more generally, variational inequality (VI) problems are notoriously unstable on general problems. Owing to the increasing need for solving such problems in machine learning, this instability has been highlighted in recent years as a significant research challenge. In this paper, we provide an overview of recent progress in the use of continuous-time perspectives in the analysis and design of methods targeting the broad VI problem class. Our presentation draws parallels between single-objective problems and multi-objective problems, highlighting the challenges of the latter. We also formulate various desiderata for algorithms that apply to general VIs and we argue that achieving these desiderata may profit from an understanding of the associated continuous-time dynamics.

@article{chavdarova2022continuous,
	author = {Chavdarova, Tatjana and Hsieh, Ya-Ping and Jordan, Michael I},
	journal = {arXiv preprint arXiv:2207.07105},
	month = {July},
	title = {Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata},
	year = {2022}}