Prashanth L.A.
11 papers · 2013–2024 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
π Conference Polyglot (6) π§ Keyword Pioneer π£ Hot Topic Early Bird π Interdisciplinary Bridge π Academic Marathon (11)
πΊοΈ
Taxonomy Completionist
(17)
π§
Keyword Pioneer
π£
Hot Topic Early Bird
π
Keyword Champion
(4)
π
Trend Setter
π₯
Unstoppable
(6)
π
Century Club
(11)
ποΈ
Keyword Collector
(57)
Conferences
AISTATS (3)
ICML (3)
NIPS (2)
AAAI (1)
IJCAI (1)
JMLR (1)
Top co-authors
Keywords
concentration bound
(4)
wasserstein distance
(2)
value function
(2)
stochastic bandit
(2)
policy optimization
(2)
reinforcement learning
(2)
multi-armed bandit
(2)
conditional value-at-risk
(2)
cumulative prospect theory
(2)
conditional value at risk
(2)
risk measure
(2)
regret minimization
(1)
markov decision process
(1)
exploration-exploitation tradeoff
(1)
sample complexity
(1)
markov decision processes
(1)
sequential decision making
(1)
best arm identification
(1)
policy gradient
(1)
sequential decision-making
(1)
Papers
A Cubic-regularized Policy Newton Algorithm for Reinforcement Learning
AISTATS 2024
Finite time analysis of temporal difference learning with linear function approximation: Tail averaging and regularisation
AISTATS 2023
A Wasserstein Distance Approach for Concentration of Empirical Risk Estimates
JMLR 2022
A Survey of Risk-Aware Multi-Armed Bandits
IJCAI 2022
Estimation of Spectral Risk Measures
AAAI 2021
Concentration bounds for CVaR estimation: The cases of light-tailed and heavy-tailed distributions
ICML 2020
Correlated bandits or: How to minimize mean-squared error online
ICML 2019
Concentration of risk measures: A Wasserstein distance approach
NIPS 2019
Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control
ICML 2016
(Bandit) Convex Optimization with Biased Noisy Gradient Oracles
AISTATS 2016
Actor-Critic Algorithms for Risk-Sensitive MDPs
NIPS 2013