Cycles in adversarial regularized learning

Abstract : Regularized learning is a fundamental technique in online optimization, machine learning, and many other fields of computer science. A natural question that arises in this context is how regularized learning algorithms behave when faced against each other. We study a natural formulation of this problem by coupling regularized learning dynamics in zero-sum games. We show that the system's behavior is Poincare recurrent, implying that almost every trajectory revisits any (arbitrarily small) neighborhood of its starting point infinitely often. This cycling behavior is robust to the agents' choice of regularization mechanism (each agent could be using a different regularizer), to positive-affine transformations of the agents' utilities, and it also persists in the case of networked competition (zero-sum polymatrix games).
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01643338
Contributor : Panayotis Mertikopoulos <>
Submitted on : Tuesday, October 9, 2018 - 6:13:09 PM
Last modification on : Thursday, November 8, 2018 - 2:28:02 PM

File

1709.02738.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01643338, version 1

Citation

Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras. Cycles in adversarial regularized learning. SODA '18 - Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.2703-2717. ⟨hal-01643338⟩

Share

Metrics

Record views

221

Files downloads

47