← Back to all news
arXiv Machine Learning September 30, 2026 By Zijun Chen, Zihan Zhang

Optimal Multi-Reward Reinforcement Learning

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

  • reinforcement-learning

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Nov 5

Near-Minimax Sample Complexity for Multi-Objective Reinforcement Learning under Generative Models

arXiv:2611. 05562v1 Announce Type: cross Abstract: In multi-objective reinforcement learning, preferences may be specified only after data collection, requiring one dataset to support a continuum of reward trade-offs.

By Yue Wang
reinforcement-learning
More like this →
arXiv Machine Learning
Jul 23

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

arXiv:2607. 19854v1 Announce Type: new Abstract: We study horizon-free regret minimization for finite-horizon time-homogeneous tabular Markov decision processes with $S$ states, $A$ actions, horizon $H$, and per-trajectory total reward bounded by $1$.

By Runlong Zhou, Zihan Zhang, Maryam Fazel, Simon S. Du
reinforcement-learning
More like this →
arXiv Statistics ML
Oct 1

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning

arXiv:2605.15692v2 Announce Type: replace-cross Abstract: We study episodic reinforcement learning with fixed reward and transition functions, but with episode-dependent admissible action sets that a...

By Zijun Chen, Zihan Zhang
reinforcement-learningsafety
More like this →
arXiv Machine Learning
Jun 25

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs

arXiv:2606. 25170v1 Announce Type: cross Abstract: We study PAC learning in tabular discounted Markov decision processes with exogenous i.

By Corentin Pla, Hugo Richard, Marc Abeille, Vianney Perchet
agentsreinforcement-learning
More like this →
arXiv Machine Learning
Aug 18

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs

arXiv:2509. 16586v2 Announce Type: replace Abstract: Recent advances have significantly improved our understanding of the sample complexity of learning in average-reward Markov decision processes (AMDPs) under the generative model.

By Yukuan Wei, Xudong Li, Lin F. Yang
reinforcement-learningsafety
More like this →
arXiv Machine Learning
Jun 16

Fast Non-Episodic Finite-Horizon RL with K-Step Lookahead Thresholding

arXiv:2602. 00781v2 Announce Type: replace Abstract: Online reinforcement learning in non-episodic, finite-horizon MDPs remains underexplored and is challenged by the need to estimate returns to a fixed terminal time.

By Jiamin Xu, Kyra Gan
reinforcement-learningbenchmarks
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea