Search Results for author:
Found 2 papers, 0 papers with code
Second Order Methods for Bandit Optimization and Control
We show that our algorithm achieves optimal (in terms of horizon) regret bounds for a large class of convex functions that we call $\kappa$-convex.
Partial Matrix Completion
This work establishes a new framework of partial matrix completion, where the goal is to identify a large subset of the entries that can be completed with high confidence.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
