USP paired with VAW delivers O(log^3 T) regret for marginally stable linear dynamical systems with asymmetric hidden matrices.
Logarithmic regret algorithms for online convex optimization.Machine Learning, 69(2-3):169–192
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Power of Second Order Methods for Sequence Preconditioning
USP paired with VAW delivers O(log^3 T) regret for marginally stable linear dynamical systems with asymmetric hidden matrices.