Finite-time stochastic-approximation guarantees are established for finite-time bounds on the recovered eigenvector and eigenvalue with $\tilde{O}(\epsilon^{-2})$ sample complexity up to problem-dependent constants for risk-sensitive average-cost reinforcement learning with exponential utility.
Waqar Mirza, Yashaswini Murthy, Lai-Xi Shi et al.· 0 citations
We study the problem of average reward Multi-Agent Reinforcement Learning (MARL) where agents interact within a network. Each agent in the network conducts local updates with information within its $k$-hop neighborhood and collaboratively maximizes the overall reward of the entire network. We first provide impossibilit...
Yi-Zhou Zhang, Yashaswini Murthy, Lai-Xi Shi et al.· 0 citations
Multi-step predictions of future transition realizations can improve reinforcement learning, but their value remains difficult to quantify. Directly including these predictions in the state can lead to exponential state-space growth, making direct dynamic programming computationally expensive. We study discounted finit...
Chen-Bei Lu, Zai-Wei Chen, Tong-Xin Li et al.· 0 citations
This paper formalizes strategic decision-focused learning, where an ML system predicts an exogenous state that some agents observe before playing a game, and shows the prediction accuracy-equilibrium payoff landscape can be non-monotonic, i.e., better predictions can degrade performance.
Tinashe Handina, Yu-Cun Diao, Adam Wierman et al.· 0 citations
A new robust variant of MCTS that mitigates dynamical model ambiguities to bridge the gap between simulation-based planning and real-world deployment and empirical evidence is provided that this method achieves robust performance in planning problems even under significant ambiguity in the underlying reward distributio...
Tuan Dam, Kishan Panaganti, Brahim Driss et al.· International Conference on...· 6 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.