# Efficient Online Portfolio with Logarithmic Regret

Haipeng LuoChen-Yu WeiKai Zheng

We study the decades-old problem of online portfolio management and propose the first algorithm with logarithmic regret that is not based on Cover's Universal Portfolio algorithm and admits much faster implementation. Specifically Universal Portfolio enjoys optimal regret $\mathcal{O}(N\ln T)$ for $N$ financial instruments over $T$ rounds, but requires log-concave sampling and has a large polynomial running time... (read more)

PDF Abstract

No code implementations yet. Submit your code now