124 citations · 1.6k across the 112 of their papers we have counts for
10 papers · 1 filter
Projection-free Adaptive Regret with Membership Oracles
Zhou Lu, Nataly Brukhim, Paula Gradu +1
In the framework of online convex optimization, most iterative algorithms require the computation of projections onto convex sets, which can be computationally expensive. To tackle…
Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret
Gautam Goel, Naman Agarwal, Karan Singh +1
We consider the fundamental problem of online control of a linear dynamical system from two different viewpoints: regret minimization and competitive analysis. We prove that the op…
Introduction to Online Control
Elad Hazan, Karan Singh
This text presents an introduction to an emerging paradigm in control of dynamical systems and differentiable reinforcement learning called online nonstochastic control. The new ap…
Partial Matrix Completion
Elad Hazan, Adam Tauman Kalai, Varun Kanade +2
The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with genera…
On the Computational Efficiency of Adaptive and Dynamic Regret Minimization
Zhou Lu, Elad Hazan
In online convex optimization, the player aims to minimize regret, or the difference between her loss and that of the best fixed decision in hindsight over the entire repeated game…
Adaptive Online Learning of Quantum States
Xinyi Chen, Elad Hazan, Tongyang Li +3
The problem of efficient quantum state learning, also called shadow tomography, aims to comprehend an unknown -dimensional quantum state through POVMs. Yet, these states are rar…