Smoothed Analysis of Sequential Probability Assignment

8 March 2023

Papers citing "Smoothed Analysis of Sequential Probability Assignment"

24 / 24 papers shown

Title
Online Learning in Dynamically Changing Environments Changlong Wu A. Grama Wojtek Szpankowski 69 6 0 31 Jan 2023
Adaptive Oracle-Efficient Online Learning Guanghui Wang Zihao Hu Vidya Muthukumar Jacob D. Abernethy 50 4 0 17 Oct 2022
Expected Worst Case Regret via Stochastic Sequential Covering Changlong Wu Mohsen Heidari A. Grama Wojtek Szpankowski 47 12 0 09 Sep 2022
Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions Adam Block Max Simchowitz 66 11 0 25 May 2022
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm Changlong Wu Mohsen Heidari A. Grama Wojtek Szpankowski 34 8 0 07 May 2022
Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries Nika Haghtalab Yanjun Han Abhishek Shetty Kunhe Yang 63 23 0 17 Feb 2022
Smoothed Online Learning is as Easy as Statistical Learning Adam Block Y. Dagan Noah Golowich Alexander Rakhlin 52 45 0 09 Feb 2022
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States Julian Zimmert Naman Agarwal Satyen Kale 40 18 0 06 Feb 2022
The Statistical Complexity of Interactive Decision Making Dylan J. Foster Sham Kakade Jian Qian Alexander Rakhlin 258 178 0 27 Dec 2021
Minimax Rates for Conditional Density Estimation via Empirical Entropy Blair Bilodeau Dylan J. Foster Daniel M. Roy 53 24 0 21 Sep 2021
Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination Dylan J. Foster A. Krishnamurthy 67 44 0 05 Jul 2021
Smoothed Analysis with Adaptive Adversaries Nika Haghtalab Tim Roughgarden Abhishek Shetty AAML 70 51 0 16 Feb 2021
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective Dylan J. Foster Alexander Rakhlin D. Simchi-Levi Yunzong Xu 115 77 0 07 Oct 2020
Smoothed Analysis of Online and Differentially Private Learning Nika Haghtalab Tim Roughgarden Abhishek Shetty 55 48 0 17 Jun 2020
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability D. Simchi-Levi Yunzong Xu OffRL 272 109 0 28 Mar 2020
Sample Complexity Result for Multi-category Classifiers of Bounded Variation Khadija Musayeva 26 2 0 20 Mar 2020
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles Dylan J. Foster Alexander Rakhlin 268 207 0 12 Feb 2020
Efficient Online Portfolio with Logarithmic Regret Haipeng Luo Chen-Yu Wei Kai Zheng 28 46 0 18 May 2018
Logistic Regression: The Importance of Being Improper Dylan J. Foster Satyen Kale Haipeng Luo M. Mohri Karthik Sridharan 34 77 0 25 Mar 2018
Oracle-Efficient Online Learning and Auction Design Miroslav Dudík Nika Haghtalab Haipeng Luo Robert Schapire Vasilis Syrgkanis Jennifer Wortman Vaughan 59 61 0 05 Nov 2016
Coin Betting and Parameter-Free Online Learning Francesco Orabona D. Pál 133 165 0 12 Feb 2016
Sequential Probability Assignment with Binary Alphabets and Large Classes of Experts Alexander Rakhlin Karthik Sridharan 44 30 0 29 Jan 2015
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits Alekh Agarwal Daniel J. Hsu Satyen Kale John Langford Lihong Li Robert Schapire OffRL 285 505 0 04 Feb 2014
Online Learning via Sequential Complexities Alexander Rakhlin Karthik Sridharan Ambuj Tewari 98 102 0 06 Jun 2010