Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States

Über monotone matrixfunktionen

K.T’. Löwner · 1934

Earlier work this paper cites.

Universal portfolios

Thomas M Cover · 1991

Earlier work this paper cites.

A game of prediction with expert advice

V. G. Vovk · 1995

Earlier work this paper cites.

On-line portfolio selection using multiplicative updates

David P Helmbold, Robert E Schapire, Yoram Singer, and Manfred K Warmuth · 1998

Earlier work this paper cites.

Efficient algorithms for universal portfolios

Adam Kalai and Santosh S. Vempala · 2000

Earlier work this paper cites.

Efficient algorithms for online game playing and universal portfolio management

Amit Agarwal and Elad Hazan · 2005

Earlier work this paper cites.

Algorithms for portfolio management based on the newton method

Amit Agarwal, Elad Hazan, Satyen Kale, and Robert E Schapire · 2006

Cited alongside, same era.

Logarithmic regret algorithms for online convex optimization

Elad Hazan, Amit Agarwal, and Satyen Kale · 2007

Cited alongside, same era.

Complex-valued matrix differentiation: Techniques and key results

Are Hjorungnes and David Gesbert · 2007

Cited alongside, same era.

An online portfolio selection algorithm with regret logarithmic in price variation

Elad Hazan and Satyen Kale · 2015

Cited alongside, same era.

Soft-bayes: Prod for mixtures of experts with log-loss

Laurent Orseau, Tor Lattimore, and Shane Legg · 2017

Cited alongside, same era.

Online learning of quantum states

Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, and Ashwin Nayak · 2018

Later among the works it cites.

Efficient online portfolio with logarithmic regret

Haipeng Luo, Chen-Yu Wei, and Kai Zheng · 2018

Later among the works it cites.

Online convex programming and generalized infinitesimal gradient ascent

Martin Zinkevich · 2018

Later among the works it cites.

Adapting to misspecification in contextual bandits

Dylan J Foster, Claudio Gentile, Mehryar Mohri, and Julian Zimmert · 2020

Later among the works it cites.

Open problem: Fast and optimal online portfolio selection

Tim Van Erven, Dirk Van der Hoeven, Wojciech Kotłowski, and Wouter M Koolen · 2020

Later among the works it cites.