Setpoint Tracking with Partially Observed Loads

09/12/2017
by   Antoine Lesage-Landry, et al.
0

We use online convex optimization (OCO) for setpoint tracking with uncertain, flexible loads. We consider full feedback from the loads, bandit feedback, and two intermediate types of feedback: partial bandit where a subset of the loads are individually observed and the rest are observed in aggregate, and Bernoulli feedback where in each round the aggregator receives either full or bandit feedback according to a known probability. We give sublinear regret bounds in all cases. We numerically evaluate our algorithms on examples with thermostatically controlled loads and electric vehicles.

READ FULL TEXT
research
07/23/2020

Online Boosting with Bandit Feedback

We consider the problem of online boosting for regression tasks, when on...
research
12/17/2020

Experts with Lower-Bounded Loss Feedback: A Unifying Framework

The most prominent feedback models for the best expert problem are the f...
research
10/01/2018

Risk-Averse Stochastic Convex Bandit

Motivated by applications in clinical trials and finance, we study the p...
research
05/17/2022

Delaytron: Efficient Learning of Multiclass Classifiers with Delayed Bandit Feedbacks

In this paper, we present online algorithm called Delaytron for learning...
research
06/02/2016

Stochastic Structured Prediction under Bandit Feedback

Stochastic structured prediction under bandit feedback follows a learnin...
research
09/29/2021

The 360-Degree Feedback Model as a Tool of Total Quality Management

The 360-degree feedback, also known as “multifaceted feedback”, is a man...
research
09/03/2022

Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning

We determine sharp bounds on the price of bandit feedback for several va...

Please sign up or login with your details

Forgot password? Click here to reset