title | abstract | layout | series | publisher | issn | id | month | tex_title | firstpage | lastpage | page | order | cycles | bibtex_author | author | date | address | container-title | volume | genre | issued | extras | |||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium |
In game-theoretic learning, several agents are simultaneously following their individual interests, so the environment is non-stationary from each player’s perspective. In this context, the performance of a learning algorithm is often measured by its regret. However, no-regret algorithms are not created equal in terms of game-theoretic guarantees: depending on how they are tuned, some of them may drive the system to an equilibrium, while others could produce cyclic, chaotic, or otherwise divergent trajectories. To account for this, we propose a range of no-regret policies based on optimistic mirror descent, with the following desirable properties: (\emph{i}) they do not require \emph{any} prior tuning or knowledge of the game; (\emph{ii}) they all achieve |
inproceedings |
Proceedings of Machine Learning Research |
PMLR |
2640-3498 |
hsieh21a |
0 |
Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium |
2388 |
2422 |
2388-2422 |
2388 |
false |
Hsieh, Yu-Guan and Antonakopoulos, Kimon and Mertikopoulos, Panayotis |
|
2021-07-21 |
Proceedings of Thirty Fourth Conference on Learning Theory |
134 |
inproceedings |
|