Conformal pid control for time series prediction

A Angelopoulos, E Candes… - Advances in neural …, 2023 - proceedings.neurips.cc
We study the problem of uncertainty quantification for time series prediction, with the goal of
providing easy-to-use algorithms with formal guarantees. The algorithms we present build …

Onenet: Enhancing time series forecasting models under concept drift by online ensembling

Q Wen, W Chen, L Sun, Z Zhang… - Advances in …, 2023 - proceedings.neurips.cc
Online updating of time series forecasting models aims to address the concept drifting
problem by efficiently updating forecasting models based on streaming data. Many …

Introduction to multi-armed bandits

A Slivkins - Foundations and Trends® in Machine Learning, 2019 - nowpublishers.com
Multi-armed bandits a simple but very powerful framework for algorithms that make
decisions over time under uncertainty. An enormous body of work has accumulated over the …

Inherent trade-offs in the fair determination of risk scores

J Kleinberg, S Mullainathan, M Raghavan - arxiv preprint arxiv …, 2016 - arxiv.org
Recent discussion in the public sphere about algorithmic classification has involved tension
between competing notions of what it means for a probabilistic classification to be fair to …

Fair, transparent, and accountable algorithmic decision-making processes: The premise, the proposed solutions, and the open challenges

B Lepri, N Oliver, E Letouzé, A Pentland… - Philosophy & Technology, 2018 - Springer
The combination of increased availability of large amounts of fine-grained human behavioral
data and advances in machine learning is presiding over a growing reliance on algorithms …

Introduction to online convex optimization

E Hazan - Foundations and Trends® in Optimization, 2016 - nowpublishers.com
This monograph portrays optimization as a process. In many practical applications the
environment is so complex that it is infeasible to lay out a comprehensive theoretical model …

Calibrated recommendations

H Steck - Proceedings of the 12th ACM conference on …, 2018 - dl.acm.org
When a user has watched, say, 70 romance movies and 30 action movies, then it is
reasonable to expect the personalized list of recommended movies to be comprised of about …

Regret analysis of stochastic and nonstochastic multi-armed bandit problems

S Bubeck, N Cesa-Bianchi - Foundations and Trends® in …, 2012 - nowpublishers.com
Multi-armed bandit problems are the most basic examples of sequential decision problems
with an exploration-exploitation trade-off. This is the balance between staying with the option …

Foundations of machine learning

V Goar, NS Yadav - Intelligent Optimization Techniques for Business …, 2024 - igi-global.com
This chapter focuses on providing a complete grasp of the foundations of machine learning
(ML). Machine learning is a rapidly evolving domain with wide-ranging applications, from …

[KNYGA][B] Prediction, learning, and games

N Cesa-Bianchi, G Lugosi - 2006 - books.google.com
This important text and reference for researchers and students in machine learning, game
theory, statistics and information theory offers a comprehensive treatment of the problem of …