Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ravi Kumar Kolla

dblp:176/5097 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0002-6998-4234ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 56% Information theory · 28% Approximation and online algorithms · 8%
Artificial intelligence
1 paper
Reinforcement learning · 62% Graph learning · 19% Efficient and distributed learning · 19%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › probability theory › measure concentration
concentration inequalities
0.412020
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions · ICML 2020
Mathematical optimization › risk measures
conditional value at risk
0.412020
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions · ICML 2020
Mathematical optimization
risk measures
0.412020
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions · ICML 2020
Machine learning › Reinforcement learning › multi-armed bandit
multi-agent bandit
0.312018
Collaborative Learning of Stochastic Bandits Over a Social Network · IEEE/ACM Trans. Netw. 2018
Approximation and online algorithms › online algorithms
bandit algorithms
0.112020
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions · ICML 2020
Algorithms and data structures › learning algorithms
best arm identification
0.112020
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions · ICML 2020
Machine learning › Efficient and distributed learning › distributed training
decentralized learning
0.112018
Collaborative Learning of Stochastic Bandits Over a Social Network · IEEE/ACM Trans. Netw. 2018
Machine learning › Graph learning
social networks
0.112018
Collaborative Learning of Stochastic Bandits Over a Social Network · IEEE/ACM Trans. Netw. 2018

Methods — techniques the papers use, named apart from their topics

truncation-based estimator · 0.4empirical distribution · 0.4stochastic bandit · 0.3regret analysis · 0.3
YearPublicationVenuePosition
2020 Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions
abstract
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 classical CVaR estimator based on the empirical distribution constructed from the samples. For heavy-tailed random variables, we assume a mild ‘bounded moment’ condition, and derive a concentration bound for a truncation-based estimator. Our concentration bounds exhibit exponential decay in the sample size, and are tighter than those available in the literature for the above distribution classes. To demonstrate the applicability of our concentration results, we consider the CVaR optimization problem in a multi-armed bandit setting. Specifically, we address the best CVaR-arm identification problem under a fixed budget. Using our CVaR concentration results, we derive an upper-bound on the probability of incorrect arm identification.
Prashanth L. A., Krishna P. Jagannathan, Ravi Kumar Kolla
ICML3
2018 Collaborative Learning of Stochastic Bandits Over a Social Network
Ravi Kumar Kolla, Krishna P. Jagannathan, Aditya Gopalan
IEEE/ACM Trans. Netw.1