Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting

J. Jon Ryu, Alankrita Bhatt, Young-Han Kim

Type: Preprint

Publication Date: 2022-01-01

Citations: 1

DOI: https://doi.org/10.48550/arxiv.2202.02406

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Coin Betting and Parameter-Free Online Learning	2016	Francesco Orabona Dávid Pál
+	Coin Betting and Parameter-Free Online Learning	2016	Francesco Orabona Dávid Pál
+	Coin Betting and Parameter-Free Online Learning	2016	Francesco Orabona Dávid Pál
+ PDF Chat	High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles	2024	Billy Jin Katya Scheinberg Miaolan Xie
+	Differentially Private Learning with Adaptive Clipping	2021	Om Thakkar Galen Andrew H. Brendan McMahan
+	Sequential prediction under log-loss with side information	2021	Alankrita Bhatt Young-Han Kim
+	From Coin Betting to Parameter-Free Online Learning	2016	Francesco Orabona Dávid Pál
+ PDF Chat	Bandit Online Optimization over the Permutahedron	2014	Nir Ailon Kohei Hatano Eiji Takimoto
+ PDF Chat	Bandit online optimization over the permutahedron	2016	Nir Ailon Kohei Hatano Eiji Takimoto
+ PDF Chat	Oracle-Efficient Hybrid Online Learning with Unknown Distribution	2024	Changlong Wu Jin Sima Wojciech Szpankowski
+	Customizing ML Predictions for Online Algorithms	2022	Keerti Anand Rong Ge Debmalya Panigrahi
+	Randomized Prediction	2006	Nicolò Cesa‐Bianchi Gábor Lugosi
+ PDF Chat	Sparsity-Agnostic Linear Bandits with Adaptive Adversaries	2024	Tianyuan Jin Kyoungseok Jang Nicolò Cesa‐Bianchi
+ PDF Chat	Asymptotically Optimal Strategies for Online Prediction with History-Dependent Experts	2021	Jeff Calder Nadejda Drenska
+	A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction	1998	Ludwig Staiger
+	Accelerating Optimization via Adaptive Prediction	2015	Mehryar Mohri Scott Cheng‐Hsin Yang
+	Improved Path-length Regret Bounds for Bandits	2019	Sébastien Bubeck Yuanzhi Li Haipeng Luo Chen-Yu Wei
+	Improved Path-length Regret Bounds for Bandits	2019	Sébastien Bubeck Yuanzhi Li Haipeng Luo Chen-Yu Wei
+ PDF Chat	Optimal learning with Bernstein online aggregation	2016	Olivier Wintenberger
+	An Optimal Algorithm for Stochastic and Adversarial Bandits	2018	Julian Zimmert Yevgeny Seldin

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Context-tree weighting for real-valued time series: Bayesian inference with hierarchical mixture models	2023	Ioannis Papageorgiou Ioannis Kontoyiannis

Works Cited by This (0)

Action	Title	Year	Authors