近期论文10
- Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games第 4 位,共 6 位作者ICLR 2025
- Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms第 4 位,共 6 位作者NeurIPS 2024 · 24 次引用
- Regret Matching+: (In)Stability and Fast Convergence in Games第 3 位,共 4 位作者NeurIPS 2023 · 22 次引用
- Context-lumpable stochastic bandits第 1 位,共 5 位作者NeurIPS 2023 · 2 次引用
- Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games第 4 位,共 6 位作者NeurIPS 2022 · 51 次引用
- Near-Optimal No-Regret Learning Dynamics for General Convex Games第 4 位,共 6 位作者NeurIPS 2022 · 43 次引用
- Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games第 2 位,共 4 位作者ICML 2022 · 35 次引用
- Linear Last-iterate Convergence in Constrained Saddle-point Optimization第 2 位,共 4 位作者ICLR 2021 · 146 次引用
- Last-iterate Convergence in Extensive-Form Games第 1 位,共 3 位作者NeurIPS 2021 · 57 次引用
- Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs第 1 位,共 4 位作者NeurIPS 2020 · 65 次引用
