Large Deviations Analysis For Regret Minimizing Stochastic Approximation Algorithms

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Qian, Hongjiang, Krishnamurthy, Vikram
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909214670061568
author Qian, Hongjiang
Krishnamurthy, Vikram
author_facet Qian, Hongjiang
Krishnamurthy, Vikram
contents Motivated by learning of correlated equilibria in non-cooperative games, we perform a large deviations analysis of a regret minimizing stochastic approximation algorithm. The regret minimization algorithm we consider comprises multiple agents that communicate over a graph to coordinate their decisions. We derive an exponential decay rate towards the algorithm's stable point using large deviations theory. Our analysis leverages the variational representation of the Laplace functionals and weak convergence methods to characterize the exponential decay rate.
format Preprint
id arxiv_https___arxiv_org_abs_2406_00414
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Large Deviations Analysis For Regret Minimizing Stochastic Approximation Algorithms
Qian, Hongjiang
Krishnamurthy, Vikram
Optimization and Control
Motivated by learning of correlated equilibria in non-cooperative games, we perform a large deviations analysis of a regret minimizing stochastic approximation algorithm. The regret minimization algorithm we consider comprises multiple agents that communicate over a graph to coordinate their decisions. We derive an exponential decay rate towards the algorithm's stable point using large deviations theory. Our analysis leverages the variational representation of the Laplace functionals and weak convergence methods to characterize the exponential decay rate.
title Large Deviations Analysis For Regret Minimizing Stochastic Approximation Algorithms
topic Optimization and Control
url https://arxiv.org/abs/2406.00414