Search Results for author:
Found 2 papers, 1 papers with code
Anytime Model Selection in Linear Bandits
This allows us to develop ALEXP, which has an exponentially improved ($\log M$) dependence on $M$ for its regret.
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization
We prove lower bounds for higher-order methods in smooth non-convex finite-sum optimization.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
