Image de couverture de livre

Towards Blackwell Optimality: Bellman Optimality Is All You Can Get

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Boone, Victor, Tuynman, Adrienne
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Batch Complexity of Bandit Pure Exploration
par: Tuynman, Adrienne, et autres
Publié: (2025)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
par: Tuynman, Adrienne, et autres
Publié: (2022)

Finding good policies in average-reward Markov Decision Processes without prior knowledge
par: Tuynman, Adrienne, et autres
Publié: (2024)

Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor
par: Grand-Clément, Julien, et autres
Publié: (2023)

Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error
par: Li, Haoran, et autres
Publié: (2024)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
par: Boone, Victor, et autres
Publié: (2024)

Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
par: Omura, Motoki, et autres
Publié: (2025)

Bellman Optimal Stepsize Straightening of Flow-Matching Models
par: Nguyen, Bao, et autres
Publié: (2023)

Asymptotically optimal regret in communicating Markov decision processes
par: Boone, Victor
Publié: (2025)

Prospect-Theory Behavior from Bellman Optimality in MDPs with Catastrophic States
par: Chen, Yujiao
Publié: (2026)

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
par: Wang, Shengbo, et autres
Publié: (2025)

When Can You Get Away with Low Memory Adam?
par: Kalra, Dayal Singh, et autres
Publié: (2025)

One Good Source is All You Need: Near-Optimal Regret for Bandits under Heterogeneous Noise
par: Bhat, Amith, et autres
Publié: (2026)

Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
par: Boone, Victor, et autres
Publié: (2025)

The regret lower bound for communicating Markov Decision Processes
par: Boone, Victor, et autres
Publié: (2025)

Attention Once Is All You Need: Efficient Streaming Inference with Stateful Transformers
par: Norgren, Victor
Publié: (2026)

Rao-Blackwellized Score Matching on Manifolds
par: Rawal, Divit
Publié: (2026)

Rate-Preserving Reductions for Blackwell Approachability
par: Dann, Christoph, et autres
Publié: (2024)

Pairwise Optimal Transports for Training All-to-All Flow-Based Condition Transfer Model
par: Ikeda, Kotaro, et autres
Publié: (2025)

Blackwell's Approachability with Approximation Algorithms
par: Garber, Dan, et autres
Publié: (2025)

All AI Models are Wrong, but Some are Optimal
par: Anand, Akhil S, et autres
Publié: (2025)

Simultaneous Reward Distillation and Preference Learning: Get You a Language Model Who Can Do Both
par: Nath, Abhijnan, et autres
Publié: (2024)

Bellman Diffusion Models
par: Schramm, Liam, et autres
Publié: (2024)

Stability and Generalization for Bellman Residuals
par: Kang, Enoch H., et autres
Publié: (2025)

Rao-Blackwellized POMDP Planning
par: Lee, Jiho, et autres
Publié: (2024)

Accuracy is Not All You Need
par: Dutta, Abhinav, et autres
Publié: (2024)

Use the Online Network If You Can: Towards Fast and Stable Reinforcement Learning
par: Hendawy, Ahmed, et autres
Publié: (2025)

Rao-Blackwell Gradient Estimators for Equivariant Denoising Diffusion
par: Tong, Vinh, et autres
Publié: (2025)

Bellman Error Centering
par: Chen, Xingguo, et autres
Publié: (2025)

Actor-Critics Can Achieve Optimal Sample Efficiency
par: Tan, Kevin, et autres
Publié: (2025)

You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets
par: Huang, Tianjin, et autres
Publié: (2022)

What You See is Not What You Get: Neural Partial Differential Equations and The Illusion of Learning
par: Mohan, Arvind, et autres
Publié: (2024)

Multi-agent decision making: A Blackwell's informativeness approach
par: Zhang, Zheng, et autres
Publié: (2026)

Towards Optimal Adapter Placement for Efficient Transfer Learning
par: Nowak, Aleksandra I., et autres
Publié: (2024)

Goal inference with Rao-Blackwellized Particle Filters
par: Wang, Yixuan, et autres
Publié: (2025)

Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs
par: Cai, Will, et autres
Publié: (2025)

Quartet: Native FP4 Training Can Be Optimal for Large Language Models
par: Castro, Roberto L., et autres
Publié: (2025)

ADOPT: Modified Adam Can Converge with Any $β_2$ with the Optimal Rate
par: Taniguchi, Shohei, et autres
Publié: (2024)

Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently
par: Calo, Sergio, et autres
Publié: (2024)

Can Optimal Transport Improve Federated Inverse Reinforcement Learning?
par: Millard, David, et autres
Publié: (2026)