Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis

$Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis$

Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis

Item #:: 079017-3998
UPC:

Download PDF

Details

DOI: https://doi.org/10.52202/079017-3998
Author(s): Ioannis Anagnostides, Tuomas Sandholm
Pages: 125839-125878 (40 pages)
Format: PDF Paper Download
Conference: Advances in Neural Information Processing Systems 37
Date/Location: Held 10-15 December 2024, Vancouver, Canada.
Series: Advances in Neural Information Processing Systems 37
Publisher: Neural Information Processing Systems Foundation, Inc. (NeurIPS)

Description

Members/Attendees

Tab 4

Details
Description
Members/Attendees
Tab 4

DOI: https://doi.org/10.52202/079017-3998
Author(s): Ioannis Anagnostides, Tuomas Sandholm
Pages: 125839-125878 (40 pages)
Format: PDF Paper Download
Conference: Advances in Neural Information Processing Systems 37
Date/Location: Held 10-15 December 2024, Vancouver, Canada.
Series: Advances in Neural Information Processing Systems 37
Publisher: Neural Information Processing Systems Foundation, Inc. (NeurIPS)