OCSYSYAug 5, 2020

Personalized Optimization with User's Feedback

arXiv:1905.0077532 citationsh-index: 40
AI Analysis

For cyber-physical systems requiring real-time balance between engineering costs and user satisfaction, this work provides a principled online optimization framework with theoretical guarantees.

This paper develops an online algorithm for time-varying optimization problems with a known time-varying cost and an unknown user satisfaction function, using Gaussian processes to learn the unknown function. The algorithm tracks the optimal trajectory within an error ball while achieving no-regret learning, demonstrated on a vehicle platooning problem.

This paper develops an online algorithm to solve a time-varying optimization problem with an objective that comprises a known time-varying cost and an unknown function. This problem structure arises in a number of engineering systems and cyber-physical systems where the known function captures time-varying engineering costs, and the unknown function models user's satisfaction; in this context, the objective is to strike a balance between given performance metrics and user's satisfaction. Key challenges related to the problem at hand are related to (1) the time variability of the problem, and (2) the fact that learning of the user's utility function is performed concurrently with the execution of the online algorithm. This paper leverages Gaussian processes (GP) to learn the unknown cost function from noisy functional evaluation and build pertinent upper confidence bounds. Using the GP formalism, the paper then advocates time-varying optimization tools to design an online algorithm that exhibits tracking of the oracle-based optimal trajectory within an error ball, while learning the user's satisfaction function with no-regret. The algorithmic steps are inexact, to account for possible limited computational budgets or real-time implementation considerations. Numerical examples are illustrated based on a problem related to vehicle platooning.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes