1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2022★ 3 cited
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States
Julian Zimmert, Naman Agarwal, Satyen Kale
We revisit the classical online portfolio selection problem. It is widely assumed that a trade-off between computational complexity and regret is unavoidable, with Cover's Universa…
cs.CC2014★ 1 cited
Unique Games on the Hypercube
Naman Agarwal, Guy Kindler, Alexandra Kolla +1
In this paper, we investigate the validity of the Unique Games Conjecture when the constraint graph is the boolean hypercube. We construct an almost optimal integrality gap instanc…