Quasipolynomial Approximate Planning for Decodable POMDPs
Introduces quasipolynomial-time approximate planning algorithms for ρ-decodable POMDPs, which are weaker than observability assumptions.
4 stories, newest first · one card per story
Introduces quasipolynomial-time approximate planning algorithms for ρ-decodable POMDPs, which are weaker than observability assumptions.
A paper gives decentralized agents a way to learn team policies from delayed shared observations.
Researchers prove off-policy evaluation under history-dependent logging requires exponentially many episodes, resolving a hardness question for model-based POMDP evaluation.
Researchers model OT intrusion response as a POMDP and train PPO-based automated response strategies effective against MITRE attacks in an emulated OT system.
Today 1.5K readers · 2.4K views · 754 reads · all time 189K views