Yasin Abbasi-Yadkori

Affiliations:
  • Adobe Research
  • Queensland University of Technology, Australia (former)


According to our database1, Yasin Abbasi-Yadkori authored at least 58 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Context-lumpable stochastic bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms.
CoRR, 2022

A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits.
CoRR, 2022

Feature and Parameter Selection in Stochastic Linear Bandits.
Proceedings of the International Conference on Machine Learning, 2022

Efficient local planning with linear function approximation.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Confident Least Square Value Iteration with Local Access to a Simulator.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Parameter and Feature Selection in Stochastic Linear Bandits.
CoRR, 2021

Optimization Issues in KL-Constrained Approximate Policy Iteration.
CoRR, 2021

Improved Regret Bound and Experience Replay in Regularized Policy Iteration.
Proceedings of the 38th International Conference on Machine Learning, 2021

On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function.
Proceedings of the Conference on Learning Theory, 2021

Adaptive Approximate Policy Iteration.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
The Elliptical Potential Lemma Revisited.
CoRR, 2020

Regret Balancing for Bandit and RL Model Selection.
CoRR, 2020

Provably Efficient Adaptive Approximate Policy Iteration.
CoRR, 2020

A Structural Graph Representation Learning Framework.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Model Selection in Contextual Stochastic Bandit Problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Exploration-Enhanced POLITEX.
CoRR, 2019

Large-Scale Markov Decision Problems via the Linear Programming Dual.
CoRR, 2019

On Densification for Minwise Hashing.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Thompson Sampling and Approximate Inference.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Bootstrapping Upper Confidence Bound.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Sample Efficient Graph-Based Optimization with Noisy Observations.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Optimizing over a Restricted Policy Class in MDPs.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Model-Free Linear Quadratic Control via Reduction to Expert Prediction.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
New Insights into Bootstrapping for Bandits.
CoRR, 2018

Sharp Convergence Rates for Langevin Dynamics in the Nonconvex Setting.
CoRR, 2018

Regret Bounds for Model-Free Linear Quadratic Control.
CoRR, 2018

Optimizing over a Restricted Policy Class in Markov Decision Processes.
CoRR, 2018

A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification.
CoRR, 2018

Scalar Posterior Sampling with Applications.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Offline Evaluation of Ranking Policies with Click Models.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Best of both worlds: Stochastic & adversarial best-arm identification.
Proceedings of the Conference On Learning Theory, 2018

2017
Stochastic Low-Rank Bandits.
CoRR, 2017

Posterior Sampling for Large Scale Reinforcement Learning.
CoRR, 2017

Conservative Contextual Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Hit-and-Run for Sampling and Planning in Non-Convex Spaces.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
A Fast and Reliable Policy Improvement Algorithm.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Bayesian Optimal Control of Smoothly Parameterized Systems.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Minimax Time Series Prediction.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Large-Scale Markov Decision Problems with KL Control Cost and its Application to Crowdsourcing.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm.
CoRR, 2014

Online learning in MDPs with side information.
CoRR, 2014

Prediction with Limited Advice and Multiarmed Bandits with Paid Observations.
Proceedings of the 31th International Conference on Machine Learning, 2014

Linear Programming for Large-Scale Markov Decision Problems.
Proceedings of the 31th International Conference on Machine Learning, 2014

Tracking Adversarial Targets.
Proceedings of the 31th International Conference on Machine Learning, 2014

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

Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Evaluation and Analysis of the Performance of the EXP3 Algorithm in Stochastic Environments.
Proceedings of the Tenth European Workshop on Reinforcement Learning, 2012

2011
Regret Bounds for the Adaptive Control of Linear Quadratic Systems.
Proceedings of the COLT 2011, 2011

Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
CoRR, 2011

Improved Algorithms for Linear Stochastic Bandits.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph.
Proceedings of the IJCAI 2011, 2011

2010
Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning.
Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2010

2009
Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling.
Proceedings of the UAI 2009, 2009

Learning when to stop thinking and do something!
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

2006
A heuristic routing mechanism using a new addressing scheme.
Proceedings of the 1st International ICST Conference on Bio Inspired Models of Network, 2006


  Loading...