Search Results for author:
Found 1 papers, 0 papers with code
Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery
For policy evaluation and best policy identification, we show that our algorithms are nearly minimax optimal.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
