Quasipolynomial-Time Planning for Decodable POMDPs
cs.LG, cs.DS, cs.IT, math.IT, math.OC, stat.ML
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Planning in Observable POMDPs in Quasipolynomial Time
- The Sample Complexity of Simple Binary Hypothesis Testing
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis