default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasin Abbasi-Yadkori
Person information
- affiliation: Adobe Research
- affiliation (former): Queensland University of Technology, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Mohammad Javad Azizi, Thang Duong, Yasin Abbasi-Yadkori, András György, Claire Vernade, Mohammad Ghavamzadeh:
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms. RLJ 5: 2461-2491 (2024)- [i35]Yasin Abbasi-Yadkori, Ilja Kuzborskij, David Stutz, András György, Adam Fisch, Arnaud Doucet, Iuliya Beloshapka, Wei-Hung Weng, Yao-Yuan Yang, Csaba Szepesvári, Ali Taylan Cemgil, Nenad Tomasev:
Mitigating LLM Hallucinations via Conformal Abstention. CoRR abs/2405.01563 (2024) - [i34]Yasin Abbasi-Yadkori, Ilja Kuzborskij, András György, Csaba Szepesvári:
To Believe or Not to Believe Your LLM. CoRR abs/2406.02543 (2024) - 2023
- [j1]Yasin Abbasi-Yadkori, András György, Nevena Lazic:
A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits. J. Mach. Learn. Res. 24: 288:1-288:37 (2023) - [c39]Chung-Wei Lee, Qinghua Liu, Yasin Abbasi-Yadkori, Chi Jin, Tor Lattimore, Csaba Szepesvári:
Context-lumpable stochastic bandits. NeurIPS 2023 - [i33]Chung-Wei Lee, Qinghua Liu, Yasin Abbasi-Yadkori, Chi Jin, Tor Lattimore, Csaba Szepesvári:
Context-lumpable stochastic bandits. CoRR abs/2306.13053 (2023) - 2022
- [c38]Botao Hao, Nevena Lazic, Dong Yin, Yasin Abbasi-Yadkori, Csaba Szepesvári:
Confident Least Square Value Iteration with Local Access to a Simulator. AISTATS 2022: 2420-2435 - [c37]Dong Yin, Botao Hao, Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvári:
Efficient local planning with linear function approximation. ALT 2022: 1165-1192 - [c36]Ahmadreza Moradipari, Berkay Turan, Yasin Abbasi-Yadkori, Mahnoosh Alizadeh, Mohammad Ghavamzadeh:
Feature and Parameter Selection in Stochastic Linear Bandits. ICML 2022: 15927-15958 - [i32]Yasin Abbasi-Yadkori, András György, Nevena Lazic:
A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits. CoRR abs/2201.06532 (2022) - [i31]Mohammad Javad Azizi, Thang Duong, Yasin Abbasi-Yadkori, András György, Claire Vernade, Mohammad Ghavamzadeh:
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms. CoRR abs/2202.13001 (2022) - 2021
- [c35]Botao Hao, Nevena Lazic, Yasin Abbasi-Yadkori, Pooria Joulani, Csaba Szepesvári:
Adaptive Approximate Policy Iteration. AISTATS 2021: 523-531 - [c34]Gellért Weisz, Philip Amortila, Barnabás Janzer, Yasin Abbasi-Yadkori, Nan Jiang, Csaba Szepesvári:
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function. COLT 2021: 4355-4385 - [c33]Nevena Lazic, Dong Yin, Yasin Abbasi-Yadkori, Csaba Szepesvári:
Improved Regret Bound and Experience Replay in Regularized Policy Iteration. ICML 2021: 6032-6042 - [i30]Gellért Weisz, Philip Amortila, Barnabás Janzer, Yasin Abbasi-Yadkori, Nan Jiang, Csaba Szepesvári:
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function. CoRR abs/2102.02049 (2021) - [i29]Nevena Lazic, Botao Hao, Yasin Abbasi-Yadkori, Dale Schuurmans, Csaba Szepesvári:
Optimization Issues in KL-Constrained Approximate Policy Iteration. CoRR abs/2102.06234 (2021) - [i28]Nevena Lazic, Dong Yin, Yasin Abbasi-Yadkori, Csaba Szepesvári:
Improved Regret Bound and Experience Replay in Regularized Policy Iteration. CoRR abs/2102.12611 (2021) - [i27]Ahmadreza Moradipari, Yasin Abbasi-Yadkori, Mahnoosh Alizadeh, Mohammad Ghavamzadeh:
Parameter and Feature Selection in Stochastic Linear Bandits. CoRR abs/2106.05378 (2021) - [i26]Dong Yin, Botao Hao, Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvári:
Efficient Local Planning with Linear Function Approximation. CoRR abs/2108.05533 (2021) - 2020
- [c32]Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvári:
Model Selection in Contextual Stochastic Bandit Problems. NeurIPS 2020 - [c31]Ryan A. Rossi, Nesreen K. Ahmed
, Eunyee Koh, Sungchul Kim, Anup Rao, Yasin Abbasi-Yadkori:
A Structural Graph Representation Learning Framework. WSDM 2020: 483-491 - [i25]Botao Hao, Nevena Lazic, Yasin Abbasi-Yadkori, Pooria Joulani, Csaba Szepesvári:
Provably Efficient Adaptive Approximate Policy Iteration. CoRR abs/2002.03069 (2020) - [i24]Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvári:
Model Selection in Contextual Stochastic Bandit Problems. CoRR abs/2003.01704 (2020) - [i23]Thanh Tan Nguyen, Ali Shameli, Yasin Abbasi-Yadkori, Anup Rao, Branislav Kveton:
Sample Efficient Graph-Based Optimization with Noisy Observations. CoRR abs/2006.02672 (2020) - [i22]Yasin Abbasi-Yadkori, Aldo Pacchiano, My Phan:
Regret Balancing for Bandit and RL Model Selection. CoRR abs/2006.05491 (2020) - [i21]Alexandra Carpentier, Claire Vernade, Yasin Abbasi-Yadkori:
The Elliptical Potential Lemma Revisited. CoRR abs/2010.10182 (2020)
2010 – 2019
- 2019
- [c30]Ershad Banijamali, Yasin Abbasi-Yadkori, Mohammad Ghavamzadeh, Nikos Vlassis:
Optimizing over a Restricted Policy Class in MDPs. AISTATS 2019: 3042-3050 - [c29]Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvári:
Model-Free Linear Quadratic Control via Reduction to Expert Prediction. AISTATS 2019: 3108-3117 - [c28]Thanh Tan Nguyen, Ali Shameli, Yasin Abbasi-Yadkori, Anup Rao, Branislav Kveton:
Sample Efficient Graph-Based Optimization with Noisy Observations. AISTATS 2019: 3333-3341 - [c27]Yasin Abbasi-Yadkori, Peter L. Bartlett, Kush Bhatia, Nevena Lazic, Csaba Szepesvári, Gellért Weisz:
POLITEX: Regret Bounds for Policy Iteration using Expert Prediction. ICML 2019: 3692-3702 - [c26]My Phan, Yasin Abbasi-Yadkori, Justin Domke:
Thompson Sampling and Approximate Inference. NeurIPS 2019: 8801-8811 - [c25]Botao Hao, Yasin Abbasi-Yadkori, Zheng Wen, Guang Cheng:
Bootstrapping Upper Confidence Bound. NeurIPS 2019: 12123-12133 - [c24]Tung Mai, Anup Rao, Matt Kapilevich, Ryan A. Rossi, Yasin Abbasi-Yadkori, Ritwik Sinha:
On Densification for Minwise Hashing. UAI 2019: 831-840 - [i20]Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen, Alan Malek:
Large-Scale Markov Decision Problems via the Linear Programming Dual. CoRR abs/1901.01992 (2019) - [i19]Botao Hao, Yasin Abbasi-Yadkori, Zheng Wen, Guang Cheng:
Bootstrapping Upper Confidence Bound. CoRR abs/1906.05247 (2019) - [i18]My Phan, Yasin Abbasi-Yadkori, Justin Domke:
Thompson Sampling and Approximate Inference. CoRR abs/1908.04970 (2019) - [i17]Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvári, Gellért Weisz:
Exploration-Enhanced POLITEX. CoRR abs/1908.10479 (2019) - 2018
- [c23]Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek, Michal Valko:
Best of both worlds: Stochastic & adversarial best-arm identification. COLT 2018: 918-949 - [c22]Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay, Zheng Wen:
Offline Evaluation of Ranking Policies with Click Models. KDD 2018: 1685-1694 - [c21]Georgios Theocharous, Zheng Wen, Yasin Abbasi, Nikos Vlassis:
Scalar Posterior Sampling with Applications. NeurIPS 2018: 7696-7704 - [i16]Ali Shameli, Yasin Abbasi-Yadkori:
A Continuation Method for Discrete Optimization and its Application to Nearest Neighbor Classification. CoRR abs/1802.03482 (2018) - [i15]Ershad Banijamali, Yasin Abbasi-Yadkori, Mohammad Ghavamzadeh, Nikos Vlassis:
Optimizing over a Restricted Policy Class in Markov Decision Processes. CoRR abs/1802.09646 (2018) - [i14]Yasin Abbasi-Yadkori, Nevena Lazic, Csaba Szepesvári:
Regret Bounds for Model-Free Linear Quadratic Control. CoRR abs/1804.06021 (2018) - [i13]Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay, Zheng Wen:
Offline Evaluation of Ranking Policies with Click Models. CoRR abs/1804.10488 (2018) - [i12]Xiang Cheng, Niladri S. Chatterji, Yasin Abbasi-Yadkori, Peter L. Bartlett, Michael I. Jordan:
Sharp Convergence Rates for Langevin Dynamics in the Nonconvex Setting. CoRR abs/1805.01648 (2018) - [i11]Sharan Vaswani, Branislav Kveton, Zheng Wen, Anup Rao, Mark Schmidt, Yasin Abbasi-Yadkori:
New Insights into Bootstrapping for Bandits. CoRR abs/1805.09793 (2018) - 2017
- [c20]Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek:
Hit-and-Run for Sampling and Planning in Non-Convex Spaces. AISTATS 2017: 888-895 - [c19]Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon:
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem. NIPS 2017: 3033-3042 - [c18]Abbas Kazerouni, Mohammad Ghavamzadeh, Yasin Abbasi, Benjamin Van Roy:
Conservative Contextual Linear Bandits. NIPS 2017: 3910-3919 - [i10]Georgios Theocharous, Zheng Wen, Yasin Abbasi-Yadkori, Nikos Vlassis:
Posterior Sampling for Large Scale Reinforcement Learning. CoRR abs/1711.07979 (2017) - [i9]Branislav Kveton, Csaba Szepesvári, Anup Rao, Zheng Wen, Yasin Abbasi-Yadkori, S. Muthukrishnan:
Stochastic Low-Rank Bandits. CoRR abs/1712.04644 (2017) - 2016
- [c17]Yasin Abbasi-Yadkori, Peter L. Bartlett, Stephen J. Wright:
A Fast and Reliable Policy Improvement Algorithm. AISTATS 2016: 1338-1346 - [i8]Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek:
Hit-and-Run for Sampling and Planning in Non-Convex Spaces. CoRR abs/1610.08865 (2016) - 2015
- [c16]Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen, Alan Malek:
Large-Scale Markov Decision Problems with KL Control Cost and its Application to Crowdsourcing. ICML 2015: 1053-1062 - [c15]Wouter M. Koolen, Alan Malek, Peter L. Bartlett, Yasin Abbasi-Yadkori:
Minimax Time Series Prediction. NIPS 2015: 2557-2565 - [c14]Yasin Abbasi-Yadkori, Csaba Szepesvári:
Bayesian Optimal Control of Smoothly Parameterized Systems. UAI 2015: 1-11 - 2014
- [c13]Yevgeny Seldin, Peter L. Bartlett, Koby Crammer, Yasin Abbasi-Yadkori:
Prediction with Limited Advice and Multiarmed Bandits with Paid Observations. ICML 2014: 280-287 - [c12]Yasin Abbasi-Yadkori, Peter L. Bartlett, Varun Kanade:
Tracking Adversarial Targets. ICML 2014: 369-377 - [c11]Alan Malek, Yasin Abbasi-Yadkori, Peter L. Bartlett:
Linear Programming for Large-Scale Markov Decision Problems. ICML 2014: 496-504 - [i7]Yasin Abbasi-Yadkori, Peter L. Bartlett, Alan Malek:
Linear Programming for Large-Scale Markov Decision Problems. CoRR abs/1402.6763 (2014) - [i6]Yasin Abbasi-Yadkori, Csaba Szepesvári:
Bayesian Optimal Control of Smoothly Parameterized Systems: The Lazy Posterior Sampling Algorithm. CoRR abs/1406.3926 (2014) - [i5]Yasin Abbasi-Yadkori, Gergely Neu:
Online learning in MDPs with side information. CoRR abs/1406.6812 (2014) - 2013
- [c10]Yasin Abbasi-Yadkori, Peter L. Bartlett, Varun Kanade, Yevgeny Seldin, Csaba Szepesvári:
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions. NIPS 2013: 2508-2516 - [i4]Yasin Abbasi-Yadkori, Peter L. Bartlett, Csaba Szepesvári:
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions. CoRR abs/1303.3055 (2013) - 2012
- [c9]Yevgeny Seldin, Csaba Szepesvári, Peter Auer, Yasin Abbasi-Yadkori:
Evaluation and Analysis of the Performance of the EXP3 Algorithm in Stochastic Environments. EWRL 2012: 103-116 - [c8]Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári:
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits. AISTATS 2012: 1-9 - [i3]Peter Hooper, Yasin Abbasi-Yadkori, Russell Greiner, Bret Hoehn:
Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling. CoRR abs/1205.2642 (2012) - 2011
- [c7]Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, Hong Zhang:
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph. IJCAI 2011: 1312-1317 - [c6]Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári:
Improved Algorithms for Linear Stochastic Bandits. NIPS 2011: 2312-2320 - [c5]Yasin Abbasi-Yadkori, Csaba Szepesvári:
Regret Bounds for the Adaptive Control of Linear Quadratic Systems. COLT 2011: 1-26 - [i2]Yasin Abbasi-Yadkori, Dávid Pál, Csaba Szepesvári:
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems. CoRR abs/1102.2670 (2011) - 2010
- [c4]Yasin Abbasi-Yadkori, Joseph Modayil, Csaba Szepesvári:
Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning. IROS 2010: 127-132
2000 – 2009
- 2009
- [c3]Barnabás Póczos, Yasin Abbasi-Yadkori, Csaba Szepesvári, Russell Greiner, Nathan R. Sturtevant:
Learning when to stop thinking and do something! ICML 2009: 825-832 - [c2]Peter Hooper, Yasin Abbasi-Yadkori, Russell Greiner, Bret Hoehn:
Improved Mean and Variance Approximations for Belief Net Responses via Network Doubling. UAI 2009: 232-239 - 2007
- [i1]Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud Abbaspour, Hamid Sarbazi-Azad:
A Heuristic Routing Mechanism Using a New Addressing Scheme. CoRR abs/0710.1924 (2007) - 2006
- [c1]Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud Abbaspour, Hamid Sarbazi-Azad:
A heuristic routing mechanism using a new addressing scheme. BIONETICS 2006: 37
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
