Research map / Optimization / Nonconvex and smooth optimization
Payoff-based Learning with Matrix Multiplicative Weights in Quantum Games
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games (NeurIPS 2025 · similarity 0.90)
- Playing Markov Games Without Observing Payoffs (NeurIPS 2026 · similarity 0.87)
- Decoding Rewards in Competitive Games: Inverse Game Theory with Entropy Regularization (ICML 2025 · similarity 0.86)
- Accelerating Quantum Reinforcement Learning with a Quantum Natural Policy Gradient Based Approach (ICML 2025 · similarity 0.85)
- Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms (NeurIPS 2024 · similarity 0.85)
- Prediction Accuracy of Learning in Games : Follow-the-Regularized-Leader meets Heisenberg (ICML 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.