Recursive reward aggregation defines Bellman equations for any objective computable by folding rewards, enabling RL agents to optimize max, min, mean, variance, and Sharpe ratio without reward redesign.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Recursive Reward Aggregation
Recursive reward aggregation defines Bellman equations for any objective computable by folding rewards, enabling RL agents to optimize max, min, mean, variance, and Sharpe ratio without reward redesign.