Yasin Abbasi-Yadkori
22 papers · 2011–2023 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
๐ฃ Hot Topic Early Bird ๐บ๏ธ Taxonomy Completionist (13) ๐ Interdisciplinary Bridge ๐งญ Keyword Pioneer ๐ Conference Polyglot (7)
๐
Cross-Pollinator
(12)
๐บ๏ธ
Taxonomy Completionist
(13)
๐ค
Dynamic Duo
(10)
๐งฌ
Topic Evolution
๐
Keyword Champion
(2)
๐
Trend Setter
๐
Conference Pioneer
๐ฅ
Unstoppable
(6)
โก
Prolific Year
(5)
๐๏ธ
Keyword Collector
(101)
๐
Century Club
(22)
Conferences
AISTATS (8)
ICML (7)
COLT (3)
ALT (1)
JMLR (1)
NIPS (1)
UAI (1)
Top co-authors
Keywords
regret bound
(10)
markov decision process
(7)
policy iteration
(5)
multi-armed bandit
(4)
online learning
(3)
reinforcement learning
(3)
function approximation
(2)
stochastic bandit
(2)
confidence set
(2)
expert prediction
(2)
convex optimization
(2)
policy optimization
(2)
linear function approximation
(2)
policy learning
(1)
graph-based optimization
(1)
kl divergence
(1)
non-convex optimization
(1)
feature selection
(1)
optimal control
(1)
sparse learning
(1)
Papers
A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits
JMLR 2023
Efficient local planning with linear function approximation
ALT 2022
Feature and Parameter Selection in Stochastic Linear Bandits
ICML 2022
Confident Least Square Value Iteration with Local Access to a Simulator
AISTATS 2022
Improved Regret Bound and Experience Replay in Regularized Policy Iteration
ICML 2021
Adaptive Approximate Policy Iteration
AISTATS 2021
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
COLT 2021
POLITEX: Regret Bounds for Policy Iteration using Expert Prediction
ICML 2019
On Densification for Minwise Hashing
UAI 2019
Optimizing over a Restricted Policy Class in MDPs
AISTATS 2019
Model-Free Linear Quadratic Control via Reduction to Expert Prediction
AISTATS 2019
Sample Efficient Graph-Based Optimization with Noisy Observations
AISTATS 2019
Best of both worlds: Stochastic & adversarial best-arm identification
COLT 2018
Hit-and-Run for Sampling and Planning in Non-Convex Spaces
AISTATS 2017
A Fast and Reliable Policy Improvement Algorithm
AISTATS 2016
Large-Scale Markov Decision Problems with KL Control Cost and its Application to Crowdsourcing
ICML 2015
Tracking Adversarial Targets
ICML 2014
Linear Programming for Large-Scale Markov Decision Problems
ICML 2014
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations
ICML 2014
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits
AISTATS 2012
Regret Bounds for the Adaptive Control of Linear Quadratic Systems
COLT 2011
Improved Algorithms for Linear Stochastic Bandits
NIPS 2011