no code implementations • 1 Mar 2024 • Emile Anand, Guannan Qu
This work proposes the SUB-SAMPLE-Q algorithm where the global agent subsamples $k\leq n$ local agents to compute an optimal policy in time that is only exponential in $k$, providing an exponential speedup from standard methods that are exponential in $n$.
no code implementations • 27 Nov 2022 • Emile Anand, Charles Steinhardt, Martin Hansen
Civilizations have tried to make drinking water safe to consume for thousands of years.