Similar Items: Near Optimality of Finite Memory Feedback Policies in Partially Observed Markov Decision Processes
- Optimal Transport for Stationary Markov Chains via Policy Iteration
- Approximate Information State for Approximate Planning and Reinforcement Learning in Partially Observed Systems
- Solving Large-Scale Sparse PCA to Certifiable (Near) Optimality
- Exploiting locality in high-dimensional Factorial hidden Markov models
- MurTree: Optimal Decision Trees via Dynamic Programming and Search
- Debiased Distributed Learning for Sparse Partial Linear Models in High Dimensions