:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Boone, Victor, Tuynman, Adrienne
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2510.13476
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
by: Tuynman, Adrienne, et al.
Published: (2022)

Finding good policies in average-reward Markov Decision Processes without prior knowledge
by: Tuynman, Adrienne, et al.
Published: (2024)

Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor
by: Grand-Clément, Julien, et al.
Published: (2023)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)

Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error
by: Li, Haoran, et al.
Published: (2024)

Gradual Transition from Bellman Optimality Operator to Bellman Operator in Online Reinforcement Learning
by: Omura, Motoki, et al.
Published: (2025)

Asymptotically optimal regret in communicating Markov decision processes
by: Boone, Victor
Published: (2025)

Bellman Optimal Stepsize Straightening of Flow-Matching Models
by: Nguyen, Bao, et al.
Published: (2023)

Prospect-Theory Behavior from Bellman Optimality in MDPs with Catastrophic States
by: Chen, Yujiao
Published: (2026)

When Can You Get Away with Low Memory Adam?
by: Kalra, Dayal Singh, et al.
Published: (2025)

Logarithmic Regret of Exploration in Average Reward Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
by: Wang, Shengbo, et al.
Published: (2025)

One Good Source is All You Need: Near-Optimal Regret for Bandits under Heterogeneous Noise
by: Bhat, Amith, et al.
Published: (2026)

The regret lower bound for communicating Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)

Attention Once Is All You Need: Efficient Streaming Inference with Stateful Transformers
by: Norgren, Victor
Published: (2026)

Rao-Blackwellized Score Matching on Manifolds
by: Rawal, Divit
Published: (2026)

Rate-Preserving Reductions for Blackwell Approachability
by: Dann, Christoph, et al.
Published: (2024)

Blackwell's Approachability with Approximation Algorithms
by: Garber, Dan, et al.
Published: (2025)

Rao-Blackwellized POMDP Planning
by: Lee, Jiho, et al.
Published: (2024)

Simultaneous Reward Distillation and Preference Learning: Get You a Language Model Who Can Do Both
by: Nath, Abhijnan, et al.
Published: (2024)

All AI Models are Wrong, but Some are Optimal
by: Anand, Akhil S, et al.
Published: (2025)

Bellman Diffusion Models
by: Schramm, Liam, et al.
Published: (2024)

Pairwise Optimal Transports for Training All-to-All Flow-Based Condition Transfer Model
by: Ikeda, Kotaro, et al.
Published: (2025)

Rao-Blackwell Gradient Estimators for Equivariant Denoising Diffusion
by: Tong, Vinh, et al.
Published: (2025)

Stability and Generalization for Bellman Residuals
by: Kang, Enoch H., et al.
Published: (2025)

Goal inference with Rao-Blackwellized Particle Filters
by: Wang, Yixuan, et al.
Published: (2025)

Bellman Error Centering
by: Chen, Xingguo, et al.
Published: (2025)

Accuracy is Not All You Need
by: Dutta, Abhinav, et al.
Published: (2024)

Multi-agent decision making: A Blackwell's informativeness approach
by: Zhang, Zheng, et al.
Published: (2026)

Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs
by: Cai, Will, et al.
Published: (2025)

Use the Online Network If You Can: Towards Fast and Stable Reinforcement Learning
by: Hendawy, Ahmed, et al.
Published: (2025)

Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction
by: Hu, Lunjia, et al.
Published: (2026)

What You See is Not What You Get: Neural Partial Differential Equations and The Illusion of Learning
by: Mohan, Arvind, et al.
Published: (2024)

Actor-Critics Can Achieve Optimal Sample Efficiency
by: Tan, Kevin, et al.
Published: (2025)

Parameterized Projected Bellman Operator
by: Vincent, Théo, et al.
Published: (2023)

You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets
by: Huang, Tianjin, et al.
Published: (2022)

Blackwell's Approachability for Sequential Conformal Inference
by: Principato, Guillaume, et al.
Published: (2025)

Towards Optimal Adapter Placement for Efficient Transfer Learning
by: Nowak, Aleksandra I., et al.
Published: (2024)

Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently
by: Calo, Sergio, et al.
Published: (2024)