暂无分享,去创建一个
Christos Thrampoulidis | Ahmadreza Moradipari | Mahnoosh Alizadeh | M. Alizadeh | Christos Thrampoulidis | Ahmadreza Moradipari
[1] W. R. Thompson. ON THE LIKELIHOOD THAT ONE UNKNOWN PROBABILITY EXCEEDS ANOTHER IN VIEW OF THE EVIDENCE OF TWO SAMPLES , 1933 .
[2] Torsten Koller,et al. Learning-based Model Predictive Control for Safe Exploration and Reinforcement Learning , 2019, ArXiv.
[3] Alessandro Lazaric,et al. Linear Thompson Sampling Revisited , 2016, AISTATS.
[4] Jaime F. Fisac,et al. Reachability-based safe learning with Gaussian processes , 2014, 53rd IEEE Conference on Decision and Control.
[5] Benjamin Van Roy,et al. An Information-Theoretic Analysis of Thompson Sampling , 2014, J. Mach. Learn. Res..
[6] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[7] Aurélien Garivier,et al. Parametric Bandits: The Generalized Linear Case , 2010, NIPS.
[8] John N. Tsitsiklis,et al. Linearly Parameterized Bandits , 2008, Math. Oper. Res..
[9] Benjamin Van Roy,et al. Conservative Contextual Linear Bandits , 2016, NIPS.
[10] Sébastien Bubeck,et al. Multi-scale exploration of convex functions and bandit convex optimization , 2015, COLT.
[11] Christos Thrampoulidis,et al. Safe Linear Thompson Sampling With Side Information , 2021, IEEE Transactions on Signal Processing.
[12] Lihong Li,et al. Provable Optimal Algorithms for Generalized Linear Contextual Bandits , 2017, ArXiv.
[13] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[14] Zheng Wen,et al. Conservative Exploration using Interleaving , 2018, AISTATS.
[15] S. Shankar Sastry,et al. Provably safe and robust learning-based model predictive control , 2011, Autom..
[16] Ahmadreza Moradipari,et al. LEARNING TO DYNAMICALLY PRICE ELECTRICITY DEMAND BASED ON MULTI-ARMED BANDITS , 2018, 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP).
[17] Yishay Mansour,et al. Bayesian Incentive-Compatible Bandit Exploration , 2018 .
[18] Christos Thrampoulidis,et al. Linear Stochastic Bandits Under Safety Constraints , 2019, NeurIPS.
[19] Rémi Munos,et al. Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis , 2012, ALT.
[20] Kia Khezeli,et al. Safe Linear Stochastic Bandits , 2019, AAAI.
[21] Alkis Gotovos,et al. Safe Exploration for Optimization with Gaussian Processes , 2015, ICML.
[22] Joel W. Burdick,et al. Stagewise Safe Bayesian Optimization with Gaussian Processes , 2018, ICML.
[23] Angela P. Schoellig,et al. Robust Constrained Learning-based NMPC enabling reliable mobile robot path tracking , 2016, Int. J. Robotics Res..
[24] Christos Thrampoulidis,et al. Linear Thompson Sampling Under Unknown Linear Constraints , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[25] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[26] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[27] Yifan Wu,et al. Conservative Bandits , 2016, ICML.
[28] Ahmadreza Moradipari,et al. Constrained Thompson Sampling for Real-Time Electricity Pricing With Grid Reliability Constraints , 2020, IEEE Transactions on Smart Grid.
[29] Shipra Agrawal,et al. Thompson Sampling for Contextual Bandits with Linear Payoffs , 2012, ICML.