← Search

Krishna Jagannathan

4 accepted papers

2021

Bandit algorithms: Letting go of logarithmic regret for statistical robustness

AISTATS 2021poster

We study regret minimization in a stochastic multi-armed bandit setting, and establish a fundamental trade-off between the regret suffered under an algorithm, and its statistical robustness. Considering broad classes of underlying arms’ distributions, we show that bandit learning algorithms with log…

Cited by 18SourcePDFScholar
2020

Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions

ICML 2020poster

Conditional Value-at-Risk (CVaR) is a widely used risk metric in applications such as finance. We derive concentration bounds for CVaR estimates, considering separately the cases of sub-Gaussian, light-tailed and heavy-tailed distributions. For the sub-Gaussian and light-tailed cases, we use a class…

Cited by 70SourcePDFScholar
2019

Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards

NeurIPS 2019poster

Classical multi-armed bandit problems use the expected value of an arm as a metric to evaluate its goodness. However, the expected value is a risk-neutral metric. In many applications like finance, one is interested in balancing the expected return of an arm (or portfolio) with the risk associated w…