Timezone: »
Inspired by the demands of real-time climate and weather forecasting, we develop optimistic online learning algorithms that require no parameter tuning and have optimal regret guarantees under delayed feedback. Our algorithms---DORM, DORM+, and AdaHedgeD---arise from a novel reduction of delayed online learning to optimistic online learning that reveals how optimistic hints can mitigate the regret penalty caused by delay. We pair this delay-as-optimism perspective with a new analysis of optimistic learning that exposes its robustness to hinting errors and a new meta-algorithm for learning effective hinting strategies in the presence of delay. We conclude by benchmarking our algorithms on four subseasonal climate forecasting tasks, demonstrating low regret relative to state-of-the-art forecasting models.
Author Information
Genevieve Flaspohler (Massachusetts Institute of Technology)
Francesco Orabona (Boston University)

Francesco Orabona is an Associate Professor at KAUST. His background covers both theoretical and practical aspects of machine learning and optimization. His current research interests lie in online learning, and more generally the problem of designing and analyzing adaptive and parameter-free learning algorithms. He received the PhD degree in Electrical Engineering at the University of Genoa in 2007. He is (co)author of more than 60 peer reviewed papers.
Judah Cohen (AER)
Soukayna Mouatadid (University of Toronto)
Miruna Oprescu (Microsoft Research)
Miruna Oprescu is a Data and Applied Scientist at Microsoft Research New England. In her current role, Miruna works alongside researchers and software engineers to build the next generation machine learning tools for interdisciplinary applications. Miruna spends her time between two projects: project ALICE, a Microsoft Research initiative aimed at applying artificial intelligence concepts to economic decision making, and the Machine Learning for Cancer Immunotherapies initiative, a collaboration with doctors and cancer researchers with the goal of applying machine learning techniques to improving cancer therapies.
Paulo Orenstein (Instituto de Matemática Pura e Aplicada)
Lester Mackey (Microsoft Research)

Lester Mackey is a machine learning researcher at Microsoft Research, where he develops new tools, models, and theory for large-scale learning tasks driven by applications from healthcare, climate, recommender systems, and the social good. Lester moved to Microsoft from Stanford University, where he was an assistant professor of Statistics and (by courtesy) of Computer Science. He earned his PhD in Computer Science and MA in Statistics from UC Berkeley and his BSE in Computer Science from Princeton University. He co-organized the second place team in the \$1M. Netflix Prize competition for collaborative filtering, won the \$50K Prise4Life ALS disease progression prediction challenge, won prizes for temperature and precipitation forecasting in the yearlong real-time \$800K Subseasonal Climate Forecast Rodeo, and received a best student paper award at the International Conference on Machine Learning.
Related Events (a corresponding poster, oral, or spotlight)
-
2021 Spotlight: Online Learning with Optimism and Delay »
Fri. Jul 23rd 03:40 -- 03:45 AM Room
More from the Same Authors
-
2021 : Kernel Thinning »
Raaz Dwivedi · Lester Mackey -
2021 : Uncertainty Quantification for Amniotic Fluid Segmentation and Volume Prediction »
Daniel Csillag · Lucas Monteiro Paes · Thiago Ramos · João Vitor Romano · Roberto Oliveira · Paulo Orenstein -
2023 : Improved Time-Uniform PAC-Bayes Bounds using Coin Betting »
Kyoungseok Jang · Kwang-Sung Jun · Ilja Kuzborskij · Francesco Orabona -
2023 : Adaptive Bias Correction for Improved Subseasonal Forecasting »
Soukayna Mouatadid · Paulo Orenstein · Genevieve Flaspohler · Judah Cohen · Miruna Oprescu · Ernest Fraenkel · Lester Mackey -
2023 : Implicit Interpretation of Importance Weight Aware Updates »
Keyi Chen · Francesco Orabona -
2023 : Improved Time-Uniform PAC-Bayes Bounds using Coin Betting »
Kyoungseok Jang · Kwang-Sung Jun · Ilja Kuzborskij · Francesco Orabona -
2023 Poster: Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion »
Ashok Cutkosky · Harsh Mehta · Francesco Orabona -
2023 Poster: Generalized Implicit Follow-The-Regularized-Leader »
Keyi Chen · Francesco Orabona -
2021 : Kernel Thinning »
Lester Mackey · Raaz Dwivedi -
2021 : Morining Poster Session: Online Learning with Optimism and Delay »
Genevieve Flaspohler -
2021 : An Accurate and Scalable Subseasonal Forecasting Toolkit for the United States »
Soukayna Mouatadid -
2021 Poster: A Second look at Exponential and Cosine Step Sizes: Simplicity, Adaptivity, and Performance »
Xiaoyu Li · Zhenxun Zhuang · Francesco Orabona -
2021 Spotlight: A Second look at Exponential and Cosine Step Sizes: Simplicity, Adaptivity, and Performance »
Xiaoyu Li · Zhenxun Zhuang · Francesco Orabona -
2020 Poster: Single Point Transductive Prediction »
Nilesh Tripuraneni · Lester Mackey -
2020 Invited Talk: Doing Some Good with Machine Learning »
Lester Mackey -
2020 Tutorial: Parameter-free Online Optimization »
Francesco Orabona · Ashok Cutkosky -
2019 Workshop: AI For Social Good (AISG) »
Margaux Luck · Kris Sankaran · Tristan Sylvain · Sean McGregor · Jonnie Penn · Girmaw Abebe Tadesse · Virgile Sylvain · Myriam Côté · Lester Mackey · Rayid Ghani · Yoshua Bengio -
2019 : Networking Lunch (provided) + Poster Session »
Abraham Stanway · Alex Robson · Aneesh Rangnekar · Ashesh Chattopadhyay · Ashley Pilipiszyn · Benjamin LeRoy · Bolong Cheng · Ce Zhang · Chaopeng Shen · Christian Schroeder · Christian Clough · Clement DUHART · Clement Fung · Cozmin Ududec · Dali Wang · David Dao · di wu · Dimitrios Giannakis · Dino Sejdinovic · Doina Precup · Duncan Watson-Parris · Gege Wen · George Chen · Gopal Erinjippurath · Haifeng Li · Han Zou · Herke van Hoof · Hillary A Scannell · Hiroshi Mamitsuka · Hongbao Zhang · Jaegul Choo · James Wang · James Requeima · Jessica Hwang · Jinfan Xu · Johan Mathe · Jonathan Binas · Joonseok Lee · Kalai Ramea · Kate Duffy · Kevin McCloskey · Kris Sankaran · Lester Mackey · Letif Mones · Loubna Benabbou · Lynn Kaack · Matthew Hoffman · Mayur Mudigonda · Mehrdad Mahdavi · Michael McCourt · Mingchao Jiang · Mohammad Mahdi Kamani · Neel Guha · Niccolo Dalmasso · Nick Pawlowski · Nikola Milojevic-Dupont · Paulo Orenstein · Pedram Hassanzadeh · Pekka Marttinen · Ramesh Nair · Sadegh Farhang · Samuel Kaski · Sandeep Manjanna · Sasha Luccioni · Shuby Deshpande · Soo Kim · Soukayna Mouatadid · Sunghyun Park · Tao Lin · Telmo Felgueira · Thomas Hornigold · Tianle Yuan · Tom Beucler · Tracy Cui · Volodymyr Kuleshov · Wei Yu · yang song · Ydo Wexler · Yoshua Bengio · Zhecheng Wang · Zhuangfang Yi · Zouheir Malki -
2019 Poster: Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization »
zhenxun zhuang · Ashok Cutkosky · Francesco Orabona -
2019 Poster: Orthogonal Random Forest for Causal Inference »
Miruna Oprescu · Vasilis Syrgkanis · Steven Wu -
2019 Oral: Orthogonal Random Forest for Causal Inference »
Miruna Oprescu · Vasilis Syrgkanis · Steven Wu -
2019 Oral: Surrogate Losses for Online Learning of Stepsizes in Stochastic Non-Convex Optimization »
zhenxun zhuang · Ashok Cutkosky · Francesco Orabona -
2017 Poster: Improving Gibbs Sampler Scan Quality with DoGS »
Ioannis Mitliagkas · Lester Mackey -
2017 Talk: Improving Gibbs Sampler Scan Quality with DoGS »
Ioannis Mitliagkas · Lester Mackey -
2017 Poster: Measuring Sample Quality with Kernels »
Jackson Gorham · Lester Mackey -
2017 Poster: Efficient Online Bandit Multiclass Learning with O(sqrt{T}) Regret »
Alina Beygelzimer · Francesco Orabona · Chicheng Zhang -
2017 Talk: Measuring Sample Quality with Kernels »
Jackson Gorham · Lester Mackey -
2017 Talk: Efficient Online Bandit Multiclass Learning with O(sqrt{T}) Regret »
Alina Beygelzimer · Francesco Orabona · Chicheng Zhang