Minimax Regret Bounds for Stochastic Linear Bandit Algorithms
Hamidi, Nima.
Stanford University ProQuest Dissertations & Theses, 2021. 28671312.
Document Preview
Copyright information
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Access to the complete full text
This is a short preview of the document. Your library or institution may give you access to the complete full text for this document in ProQuest.
Alternatively, you can purchase a copy of the complete full text for this document directly from ProQuest using the option below: