Speaker: Nived Rajaraman (UC Berkeley)
Title: Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
Speaker: Jongha Ryu (MIT)
Title: Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
Speaker: Uri Sherman (Tel Aviv University)
Title: Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
Speaker: Alena Shilova (INRIA)
Title: StaQ it! Growing neural networks for Policy Mirror Descent
Speaker: Aldo Pacchiano (Boston University)
Title: On the Hardness of Bandit Learning
Speaker: Dhruv Rohatgi (MIT)
Title: Is a Good Foundation Necessary for Efficient Reinforcement Learning? The Computational Role of the Base Model in Exploration