Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Yasin Abbasi-Yadkori

Yasin Abbasi-Yadkori

Improved Regret Bound and Experience Replay in Regularized Policy Iteration


Feb 25, 2021
Nevena Lazic, Dong Yin, Yasin Abbasi-Yadkori, Csaba Szepesvari

Figure 1 for Improved Regret Bound and Experience Replay in Regularized Policy Iteration

  Access Paper or Ask Questions

Optimization Issues in KL-Constrained Approximate Policy Iteration


Feb 11, 2021
Nevena Lazić, Botao Hao, Yasin Abbasi-Yadkori, Dale Schuurmans, Csaba Szepesvári

Figure 1 for Optimization Issues in KL-Constrained Approximate Policy Iteration
Figure 2 for Optimization Issues in KL-Constrained Approximate Policy Iteration
Figure 3 for Optimization Issues in KL-Constrained Approximate Policy Iteration
Figure 4 for Optimization Issues in KL-Constrained Approximate Policy Iteration

  Access Paper or Ask Questions

On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function


Feb 04, 2021
Gellert Weisz, Philip Amortila, Barnabás Janzer, Yasin Abbasi-Yadkori, Nan Jiang, Csaba Szepesvári


  Access Paper or Ask Questions

The Elliptical Potential Lemma Revisited


Oct 20, 2020
Alexandra Carpentier, Claire Vernade, Yasin Abbasi-Yadkori

* 8 pages 
  Access Paper or Ask Questions

Regret Balancing for Bandit and RL Model Selection


Jun 09, 2020
Yasin Abbasi-Yadkori, Aldo Pacchiano, My Phan

Figure 1 for Regret Balancing for Bandit and RL Model Selection
Figure 2 for Regret Balancing for Bandit and RL Model Selection
Figure 3 for Regret Balancing for Bandit and RL Model Selection
* Submitted to the Thirty-Fourth Annual Conference on Neural Information Processing Systems (NeurIPS 2020) 
  Access Paper or Ask Questions

Sample Efficient Graph-Based Optimization with Noisy Observations


Jun 04, 2020
Tan Nguyen, Ali Shameli, Yasin Abbasi-Yadkori, Anup Rao, Branislav Kveton

Figure 1 for Sample Efficient Graph-Based Optimization with Noisy Observations
Figure 2 for Sample Efficient Graph-Based Optimization with Noisy Observations
Figure 3 for Sample Efficient Graph-Based Optimization with Noisy Observations
* AISTATS 2019 
 * The first version of this paper appeared in AISTATS 2019. Thank to community feedback, some typos and a minor issue have been identified. Specifically, on page 4, column 2, line 18, the statement $\Delta_{1,s} \ge (1+m)^{S-1-s} \Delta_1$ is not valid, and in the proof of Theorem 2, "By Lemma 1" should be "By Definition 2". These problems are fixed in this updated version published here on arxiv 
  Access Paper or Ask Questions

Provably Efficient Adaptive Approximate Policy Iteration


Mar 15, 2020
Botao Hao, Nevena Lazic, Yasin Abbasi-Yadkori, Pooria Joulani, Csaba Szepesvari

Figure 1 for Provably Efficient Adaptive Approximate Policy Iteration
Figure 2 for Provably Efficient Adaptive Approximate Policy Iteration

  Access Paper or Ask Questions

Model Selection in Contextual Stochastic Bandit Problems


Mar 03, 2020
Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvari

Figure 1 for Model Selection in Contextual Stochastic Bandit Problems
Figure 2 for Model Selection in Contextual Stochastic Bandit Problems
* 12 main pages, 2 figures, 14 appendix pages 
  Access Paper or Ask Questions

Exploration-Enhanced POLITEX


Aug 27, 2019
Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvari, Gellert Weisz

Figure 1 for Exploration-Enhanced POLITEX
Figure 2 for Exploration-Enhanced POLITEX
Figure 3 for Exploration-Enhanced POLITEX

  Access Paper or Ask Questions

Thompson Sampling and Approximate Inference


Aug 14, 2019
My Phan, Yasin Abbasi-Yadkori, Justin Domke

Figure 1 for Thompson Sampling and Approximate Inference
Figure 2 for Thompson Sampling and Approximate Inference
Figure 3 for Thompson Sampling and Approximate Inference
Figure 4 for Thompson Sampling and Approximate Inference

  Access Paper or Ask Questions

Bootstrapping Upper Confidence Bound


Jul 23, 2019
Botao Hao, Yasin Abbasi-Yadkori, Zheng Wen, Guang Cheng

Figure 1 for Bootstrapping Upper Confidence Bound
Figure 2 for Bootstrapping Upper Confidence Bound
Figure 3 for Bootstrapping Upper Confidence Bound
Figure 4 for Bootstrapping Upper Confidence Bound

  Access Paper or Ask Questions

Large-Scale Markov Decision Problems via the Linear Programming Dual


Jan 06, 2019
Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen, Alan Malek

Figure 1 for Large-Scale Markov Decision Problems via the Linear Programming Dual
Figure 2 for Large-Scale Markov Decision Problems via the Linear Programming Dual
Figure 3 for Large-Scale Markov Decision Problems via the Linear Programming Dual
Figure 4 for Large-Scale Markov Decision Problems via the Linear Programming Dual
* 53 pages. arXiv admin note: text overlap with arXiv:1402.6763 
  Access Paper or Ask Questions

Posterior Sampling for Large Scale Reinforcement Learning


Oct 22, 2018
Georgios Theocharous, Zheng Wen, Yasin Abbasi-Yadkori, Nikos Vlassis

Figure 1 for Posterior Sampling for Large Scale Reinforcement Learning
Figure 2 for Posterior Sampling for Large Scale Reinforcement Learning
Figure 3 for Posterior Sampling for Large Scale Reinforcement Learning

  Access Paper or Ask Questions

Model-Free Linear Quadratic Control via Reduction to Expert Prediction


Oct 05, 2018
Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvari

Figure 1 for Model-Free Linear Quadratic Control via Reduction to Expert Prediction

  Access Paper or Ask Questions

Sharp Convergence Rates for Langevin Dynamics in the Nonconvex Setting


Sep 07, 2018
Xiang Cheng, Niladri S. Chatterji, Yasin Abbasi-Yadkori, Peter L. Bartlett, Michael I. Jordan

* 37 Pages 
  Access Paper or Ask Questions

Offline Evaluation of Ranking Policies with Click Models


Jun 13, 2018
Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay, Zheng Wen

Figure 1 for Offline Evaluation of Ranking Policies with Click Models
Figure 2 for Offline Evaluation of Ranking Policies with Click Models
Figure 3 for Offline Evaluation of Ranking Policies with Click Models
Figure 4 for Offline Evaluation of Ranking Policies with Click Models

  Access Paper or Ask Questions

New Insights into Bootstrapping for Bandits


May 24, 2018
Sharan Vaswani, Branislav Kveton, Zheng Wen, Anup Rao, Mark Schmidt, Yasin Abbasi-Yadkori

Figure 1 for New Insights into Bootstrapping for Bandits
Figure 2 for New Insights into Bootstrapping for Bandits
Figure 3 for New Insights into Bootstrapping for Bandits
Figure 4 for New Insights into Bootstrapping for Bandits

  Access Paper or Ask Questions

Optimizing over a Restricted Policy Class in Markov Decision Processes


Feb 26, 2018
Ershad Banijamali, Yasin Abbasi-Yadkori, Mohammad Ghavamzadeh, Nikos Vlassis

Figure 1 for Optimizing over a Restricted Policy Class in Markov Decision Processes
Figure 2 for Optimizing over a Restricted Policy Class in Markov Decision Processes
Figure 3 for Optimizing over a Restricted Policy Class in Markov Decision Processes
Figure 4 for Optimizing over a Restricted Policy Class in Markov Decision Processes
* 14 pages 
  Access Paper or Ask Questions

A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification


Feb 10, 2018
Ali Shameli, Yasin Abbasi-Yadkori

Figure 1 for A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification
Figure 2 for A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification
Figure 3 for A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification
Figure 4 for A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification

  Access Paper or Ask Questions

Stochastic Low-Rank Bandits


Dec 13, 2017
Branislav Kveton, Csaba Szepesvari, Anup Rao, Zheng Wen, Yasin Abbasi-Yadkori, S. Muthukrishnan

Figure 1 for Stochastic Low-Rank Bandits

  Access Paper or Ask Questions

Conservative Contextual Linear Bandits


Mar 04, 2017
Abbas Kazerouni, Mohammad Ghavamzadeh, Yasin Abbasi-Yadkori, Benjamin Van Roy

Figure 1 for Conservative Contextual Linear Bandits

  Access Paper or Ask Questions

Hit-and-Run for Sampling and Planning in Non-Convex Spaces


Oct 19, 2016
Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek

Figure 1 for Hit-and-Run for Sampling and Planning in Non-Convex Spaces
Figure 2 for Hit-and-Run for Sampling and Planning in Non-Convex Spaces
Figure 3 for Hit-and-Run for Sampling and Planning in Non-Convex Spaces
Figure 4 for Hit-and-Run for Sampling and Planning in Non-Convex Spaces

  Access Paper or Ask Questions

Online learning in MDPs with side information


Jun 26, 2014
Yasin Abbasi-Yadkori, Gergely Neu

Figure 1 for Online learning in MDPs with side information

  Access Paper or Ask Questions

Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm


Jun 16, 2014
Yasin Abbasi-Yadkori, Csaba Szepesvari

Figure 1 for Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm
Figure 2 for Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm
Figure 3 for Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm
Figure 4 for Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm

  Access Paper or Ask Questions

Linear Programming for Large-Scale Markov Decision Problems


Feb 27, 2014
Yasin Abbasi-Yadkori, Peter L. Bartlett, Alan Malek

Figure 1 for Linear Programming for Large-Scale Markov Decision Problems
Figure 2 for Linear Programming for Large-Scale Markov Decision Problems
Figure 3 for Linear Programming for Large-Scale Markov Decision Problems
Figure 4 for Linear Programming for Large-Scale Markov Decision Problems
* 27 pages, 3 figures 
  Access Paper or Ask Questions

Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions


Mar 12, 2013
Yasin Abbasi-Yadkori, Peter L. Bartlett, Csaba Szepesvari

Figure 1 for Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions
Figure 2 for Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions

  Access Paper or Ask Questions

Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling


May 09, 2012
Peter Hooper, Yasin Abbasi-Yadkori, Russell Greiner, Bret Hoehn

Figure 1 for Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling
Figure 2 for Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling
Figure 3 for Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling
Figure 4 for Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling
* Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI2009) 
  Access Paper or Ask Questions