Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing
원문 초록
Stochastic optimal control of dynamical systems is a crucial challenge in sequential decision-making. Recently, control-as-inference approaches have had considerable success, providing a viable risk-sensitive framework to address the exploration-exploitation dilemma. Nonetheless, a majority of these techniques only invoke the inference-control duality to derive a modified risk objective that is then addressed within a reinforcement learning framework. This paper introduces a novel perspective by framing risk-sensitive stochastic control as Markovian score climbing under samples drawn from a conditional particle filter. Our approach, while purely inference-centric, provides asymptotically unbiased estimates for gradient-based policy optimization with optimal importance weighting and no explicit value function learning. To validate our methodology, we apply it to the task of learning neural non-Gaussian feedback policies, showcasing its efficacy on numerical benchmarks of stochastic dynamical systems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Making
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
TextAtari: 100K Frames Game Playing with Language Agents
LLM-Stackelberg Games: Conjectural Reasoning Equilibria and Their Applications to Spearphishing
A Survey of Continual Reinforcement Learning
Flow-Based Single-Step Completion for Efficient and Expressive Policy Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.