Search Results for author:
Found 2 papers, 0 papers with code
Parallelizing Thompson Sampling
How can we make use of information parallelism in online decision making problems while efficiently balancing the exploration-exploitation trade-off?
Improved Submodular Secretary Problem with Shortlists
As a result, we provide a near optimal approximation algorithm for random-order streaming of monotone submodular functions under cardinality constraints, using memory $O(k poly(1/\epsilon))$.
Data Structures and Algorithms
Cannot find the paper you are looking for? You can
Submit a new open access paper.
