Efficient online algorithms for fast-rate regret bounds under sparsity

23 May 2018

Papers citing "Efficient online algorithms for fast-rate regret bounds under sparsity"

6 / 6 papers shown

Title
Exploring Local Norms in Exp-concave Statistical Learning Nikita Puchkin Nikita Zhivotovskiy 147 2 0 21 Feb 2023
Unconstrained Dynamic Regret via Sparse Coding Zhiyu Zhang Ashok Cutkosky I. Paschalidis 139 9 0 31 Jan 2023
Smoothed Bernstein Online Aggregation for Day-Ahead Electricity Demand Forecasting F. Ziel 115 25 0 13 Jul 2021
CRPS Learning Jonathan Berrisch F. Ziel 117 27 0 01 Feb 2021
Stochastic Online Convex Optimization. Application to probabilistic time series forecasting Olivier Wintenberger AI4TS 103 8 0 01 Feb 2021
No-regret Exploration in Contextual Reinforcement Learning Aditya Modi Ambuj Tewari OffRL 49 14 0 14 Mar 2019