Asymptotically optimal regret in communicating Markov decision processes
Fuente:
arXiv
Saved in:
| Main Author: | Boone, Victor |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The regret lower bound for communicating Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)
by: Boone, Victor, et al.
Published: (2025)
Logarithmic regret bounds for continuous-time average-reward Markov decision processes
by: Gao, Xuefeng, et al.
Published: (2022)
by: Gao, Xuefeng, et al.
Published: (2022)
Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)
by: Boone, Victor, et al.
Published: (2025)
On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025)
by: Huang, Bruce, et al.
Published: (2025)
Bayesian learning of the optimal action-value function in a Markov decision process
by: Guo, Jiaqi, et al.
Published: (2025)
by: Guo, Jiaqi, et al.
Published: (2025)
Planning in entropy-regularized Markov decision processes and games
by: Grill, Jean-Bastien, et al.
Published: (2026)
by: Grill, Jean-Bastien, et al.
Published: (2026)
Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)
by: Dong, Jing, et al.
Published: (2024)
A second order regret bound for NormalHedge
by: Freund, Yoav, et al.
Published: (2026)
by: Freund, Yoav, et al.
Published: (2026)
Towards Blackwell Optimality: Bellman Optimality Is All You Can Get
by: Boone, Victor, et al.
Published: (2025)
by: Boone, Victor, et al.
Published: (2025)
Automated scientific minimization of regret
by: Binz, Marcel, et al.
Published: (2025)
by: Binz, Marcel, et al.
Published: (2025)
A safe exploration approach to constrained Markov decision processes
by: Ni, Tingting, et al.
Published: (2023)
by: Ni, Tingting, et al.
Published: (2023)
Practical Efficient Global Optimization is No-regret
by: Wang, Jingyi, et al.
Published: (2026)
by: Wang, Jingyi, et al.
Published: (2026)
Stochastic first-order methods for average-reward Markov decision processes
by: Li, Tianjiao, et al.
Published: (2022)
by: Li, Tianjiao, et al.
Published: (2022)
Linear bandits with polylogarithmic minimax regret
by: Lumbreras, Josep, et al.
Published: (2024)
by: Lumbreras, Josep, et al.
Published: (2024)
Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)
by: Boone, Victor, et al.
Published: (2024)
Proper losses regret at least 1/2-order
by: Bao, Han, et al.
Published: (2024)
by: Bao, Han, et al.
Published: (2024)
Extensions of the regret-minimization algorithm for optimal design
by: Chen, Youguang, et al.
Published: (2025)
by: Chen, Youguang, et al.
Published: (2025)
Strategizing against No-regret Learners
by: Deng, Yuan, et al.
Published: (2019)
by: Deng, Yuan, et al.
Published: (2019)
Quantum framework for Reinforcement Learning: Integrating Markov decision process, quantum arithmetic, and trajectory search
by: Su, Thet Htar, et al.
Published: (2024)
by: Su, Thet Htar, et al.
Published: (2024)
Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs
by: Maran, Davide, et al.
Published: (2024)
by: Maran, Davide, et al.
Published: (2024)
Partial Structure Discovery is Sufficient for No-regret Learning in Causal Bandits
by: Elahi, Muhammad Qasim, et al.
Published: (2024)
by: Elahi, Muhammad Qasim, et al.
Published: (2024)
Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
by: Lei, Qi, et al.
Published: (2020)
by: Lei, Qi, et al.
Published: (2020)
Data-driven robust Markov decision processes on Borel spaces: performance guarantees via an axiomatic approach
by: Ramani, Sivaramakrishnan
Published: (2026)
by: Ramani, Sivaramakrishnan
Published: (2026)
Asymptotically optimal reinforcement learning in Block Markov Decision Processes
by: van Vuren, Thomas, et al.
Published: (2025)
by: van Vuren, Thomas, et al.
Published: (2025)
Learning pure quantum states (almost) without regret
by: Lumbreras, Josep, et al.
Published: (2024)
by: Lumbreras, Josep, et al.
Published: (2024)
Optimal training-conditional regret for online conformal prediction
by: Liang, Jiadong, et al.
Published: (2026)
by: Liang, Jiadong, et al.
Published: (2026)
Localized exploration in contextual dynamic pricing achieves dimension-free regret
by: Chai, Jinhang, et al.
Published: (2024)
by: Chai, Jinhang, et al.
Published: (2024)
Weighted mesh algorithms for general Markov decision processes: Convergence and tractability
by: Belomestny, Denis, et al.
Published: (2024)
by: Belomestny, Denis, et al.
Published: (2024)
An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)
by: Azar, Yossi, et al.
Published: (2022)
Online combinatorial optimization with stochastic decision sets and adversarial losses
by: Neu, Gergely, et al.
Published: (2026)
by: Neu, Gergely, et al.
Published: (2026)
Interpretable clustering via optimal multiway-split decision trees
by: Suzuki, Hayato, et al.
Published: (2026)
by: Suzuki, Hayato, et al.
Published: (2026)
Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy
by: Fujii, Kaito
Published: (2023)
by: Fujii, Kaito
Published: (2023)
UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
by: Han, Qiyang, et al.
Published: (2024)
by: Han, Qiyang, et al.
Published: (2024)
Optimal No-regret Learning in Repeated First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)
by: Han, Yanjun, et al.
Published: (2020)
Asymptotic Bayes risk of semi-supervised learning with uncertain labeling
by: Leger, Victor, et al.
Published: (2024)
by: Leger, Victor, et al.
Published: (2024)
Bayesian preference elicitation for decision support in multiobjective optimization
by: Huber, Felix, et al.
Published: (2025)
by: Huber, Felix, et al.
Published: (2025)
Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)
by: Jakob, Fabian, et al.
Published: (2025)
Data-driven solar forecasting enables near-optimal economic decisions
by: Dai, Zhixiang, et al.
Published: (2025)
by: Dai, Zhixiang, et al.
Published: (2025)
Generator Matching: Generative modeling with arbitrary Markov processes
by: Holderrieth, Peter, et al.
Published: (2024)
by: Holderrieth, Peter, et al.
Published: (2024)
Asymptotically optimal sequential change detection for bounded means
by: Ram, Ashwin, et al.
Published: (2026)
by: Ram, Ashwin, et al.
Published: (2026)
Similar Items
-
The regret lower bound for communicating Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025) -
Logarithmic regret bounds for continuous-time average-reward Markov decision processes
by: Gao, Xuefeng, et al.
Published: (2022) -
Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025) -
On the optimal regret of collaborative personalized linear bandits
by: Huang, Bruce, et al.
Published: (2025) -
Bayesian learning of the optimal action-value function in a Markov decision process
by: Guo, Jiaqi, et al.
Published: (2025)