Imagen de Portada

When and Why is Optimistic Multiplicative Weights Slow? The Geometry of Energy Dissipation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lazarsfeld, John, Barakat, Anas, Piliouras, Georgios, Varvitsiotis, Antonios, Wibisono, Andre
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Multi-Agent Control with Adversarial Disturbances
por: Barakat, Anas, et al.
Publicado: (2025)

Optimistic Online Learning in Symmetric Cone Games
por: Barakat, Anas, et al.
Publicado: (2025)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
por: Lazarsfeld, John, et al.
Publicado: (2025)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
por: Sakos, Iosif, et al.
Publicado: (2023)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
por: Barakat, Anas, et al.
Publicado: (2026)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
por: Lazarsfeld, John, et al.
Publicado: (2025)

No-Regret Learning and Equilibrium Computation in Quantum Games
por: Lin, Wayne, et al.
Publicado: (2023)

Learning in Quantum Common-Interest Games and the Separability Problem
por: Lin, Wayne, et al.
Publicado: (2023)

Learning and steering game dynamics towards desirable outcomes
por: Canyakmaz, Ilayda, et al.
Publicado: (2024)

Deep Incentive Design with Differentiable Equilibrium Blocks
por: Thoma, Vinzenz, et al.
Publicado: (2026)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
por: Leonardos, Stefanos, et al.
Publicado: (2021)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
por: Soleymani, Ashkan, et al.
Publicado: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
por: Soleymani, Ashkan, et al.
Publicado: (2025)

Independent Policy Mirror Descent for Markov Potential Games: Scaling to Large Number of Players
por: Alatur, Pragnya, et al.
Publicado: (2024)

Independent Learning in Constrained Markov Potential Games
por: Jordan, Philip, et al.
Publicado: (2024)

Swim till You Sink: Computing the Limit of a Game
por: Hakim, Rashida, et al.
Publicado: (2024)

Solving Imperfect-Recall Games via Sum-of-Squares Optimization
por: Zheng, Rui, et al.
Publicado: (2026)

Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence
por: Wu, Jiduan, et al.
Publicado: (2023)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
por: Xu, Hang, et al.
Publicado: (2024)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
por: Cai, Yang, et al.
Publicado: (2024)

Re-evaluating Open-ended Evaluation of Large Language Models
por: Liu, Siqi, et al.
Publicado: (2025)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
por: Tsuchiya, Taira
Publicado: (2025)

Prediction Accuracy of Learning in Games : Follow-the-Regularized-Leader meets Heisenberg
por: Feng, Yi, et al.
Publicado: (2024)

Solving Zero-Sum Convex Markov Games
por: Kalogiannis, Fivos, et al.
Publicado: (2025)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
por: Li, Yingru, et al.
Publicado: (2024)

On the Complexity of Learning Nash Equilibria
por: Biggar, Oliver, et al.
Publicado: (2026)

Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Chaos in Autobidding Auctions
por: Anagnostides, Ioannis, et al.
Publicado: (2026)

Incentive-compatible Bandits: Importance Weighting No More
por: Zimmert, Julian, et al.
Publicado: (2024)

Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization
por: Gemp, Ian, et al.
Publicado: (2023)

Aumann-SHAP: The Geometry of Counterfactual Interaction Explanations in Machine Learning
por: Belahcen, Adam, et al.
Publicado: (2026)

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
por: Schiffer, Benjamin, et al.
Publicado: (2025)

NfgTransformer: Equivariant Representation Learning for Normal-form Games
por: Liu, Siqi, et al.
Publicado: (2024)

Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies
por: Leon, Vincent, et al.
Publicado: (2025)

Pricing Query Complexity of Multiplicative Revenue Approximation
por: Tang, Wei, et al.
Publicado: (2026)

Clone-Robust Weights in Metric Spaces: Handling Redundancy Bias for Benchmark Aggregation
por: Berriaud, Damien, et al.
Publicado: (2025)

Model Monotonicity in Autobidding Auctions: When Do Better Predictions Lead to Better Outcomes?
por: Badanidiyuru, Ashwinkumar
Publicado: (2026)

Complex Dynamics in Autobidding Systems
por: Leme, Renato Paes, et al.
Publicado: (2024)

Heterogeneous Data Game: Characterizing the Model Competition Across Multiple Data Sources
por: Xu, Renzhe, et al.
Publicado: (2025)

Last-iterate Convergence for Symmetric, General-sum, $2 \times 2$ Games Under The Exponential Weights Dynamic
por: Wang, Guanghui, et al.
Publicado: (2025)