Image de couverture de livre

Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Sijin, Hagrass, Omar, Klusowski, Jason M.
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Artificial Intelligence Computer Science and Game Theory Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games
par: Yorulmaz, Asrin Efe, et autres
Publié: (2025)

Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
par: Zhou, Fuzhong, et autres
Publié: (2024)

Learning in Mean Field Games: A Survey
par: Laurière, Mathieu, et autres
Publié: (2022)

Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
par: Yang, Tong, et autres
Publié: (2025)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
par: Cai, Yang, et autres
Publié: (2024)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
par: Ba, Wenjia, et autres
Publié: (2021)

Optimal Online Bookmaking for Binary Games
par: Bhatt, Alankrita, et autres
Publié: (2025)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
par: Jordan, Michael I., et autres
Publié: (2023)

MF-OML: Online Mean-Field Reinforcement Learning with Occupation Measures for Large Population Games
par: Hu, Anran, et autres
Publié: (2024)

Monotone Near-Zero-Sum Games: A Generalization of Convex-Concave Minimax
par: Luo, Ruichen, et autres
Publié: (2025)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
par: Soleymani, Ashkan, et autres
Publié: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
par: Soleymani, Ashkan, et autres
Publié: (2025)

Indirect Dynamic Negotiation in the Nash Demand Game
par: Guy, Tatiana V., et autres
Publié: (2024)

PREFER: Personalized Review Summarization with Online Preference Learning
par: Roy, Millend, et autres
Publié: (2026)

Meta-Learning for Repeated Bayesian Persuasion
par: Turna, Ata Poyraz, et autres
Publié: (2026)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
par: Cai, Yang, et autres
Publié: (2025)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
par: Yang, Zongjun, et autres
Publié: (2026)

The Oracle Complexity of Simplex-based Matrix Games
par: Kornowski, Guy, et autres
Publié: (2024)

Optimistic Online Learning in Symmetric Cone Games
par: Barakat, Anas, et autres
Publié: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
par: Anagnostides, Ioannis, et autres
Publié: (2025)

Operator Splitting for Learning to Predict Equilibria in Convex Games
par: McKenzie, Daniel, et autres
Publié: (2021)

Reinforcement Learning for Finite Space Mean-Field Type Games
par: Shao, Kai, et autres
Publié: (2024)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
par: Yongacoglu, Bora, et autres
Publié: (2021)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
par: Cai, Yang, et autres
Publié: (2024)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
par: Faizal, Fathima Zarin, et autres
Publié: (2024)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
par: Nayak, Anupam, et autres
Publié: (2025)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
par: Sharma, Vedansh
Publié: (2025)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
par: Wang, Guillaume, et autres
Publié: (2022)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
par: Sakos, Iosif, et autres
Publié: (2023)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
par: Daskalakis, Constantinos, et autres
Publié: (2018)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
par: Huang, Han, et autres
Publié: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
par: Hu, Ruimeng, et autres
Publié: (2025)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
par: Cai, Yang, et autres
Publié: (2025)

Last-Iterate Guarantees for Learning in Co-coercive Games
par: Chandak, Siddharth, et autres
Publié: (2026)

A Deep Learning Method for Optimal Investment Under Relative Performance Criteria Among Heterogeneous Agents
par: Laurière, Mathieu, et autres
Publié: (2024)

A General Equilibrium Theory of Orchestrated AI Agent Systems
par: Garnier, Jean-Philippe
Publié: (2026)

A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems
par: Peng, Huan, et autres
Publié: (2025)

Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games
par: Kudo, Mikoto, et autres
Publié: (2024)

A game-theoretic approach for Generative Adversarial Networks
par: Franci, Barbara, et autres
Publié: (2020)

Fictitious Play in Extensive-Form Games of Imperfect Information
par: Castiglione, Jason, et autres
Publié: (2025)