Search papers, labs, and topics across Lattice.
2
0
3
Exponentially many policies in Tree MDPs don't have to mean exponential computation: clever confidence bounds let you treat policy selection as a tractable bandit problem.
Finding the best option when you need to balance multiple requirements and a limited budget is now provably more efficient, thanks to a new algorithm that guarantees feasibility.
