paper-with-me

홈 › Papers

Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems

2022-01-25 · Akshay Mete, Rahul Singh, P. R. Kumar

We consider the problem of controlling an unknown stochastic linear system with quadratic costs - called the adaptive LQ control problem. We re-examine an approach called ''Reward Biased Maximum Likelihood Estimate'' (RBMLE) that was proposed more than forty years ago, and which predates the ''Upper Confidence Bound'' (UCB) method as well as the definition of ''regret'' for bandit problems. It simply added a term favoring parameters with larger rewards to the criterion for parameter estimation. We show how the RBMLE and UCB methods can be reconciled, and thereby propose an Augmented RBMLE-UCB algorithm that combines the penalty of the RBMLE method with the constraints of the UCB method, uniting the two approaches to optimism in the face of uncertainty. We establish that theoretically, this method retains $\Tilde{\mathcal{O}}(\sqrt{T})$ regret, the best-known so far. We further compare the empirical performance of the proposed Augmented RBMLE-UCB and the standard RBMLE (without the augmentation) with UCB, Thompson Sampling, Input Perturbation, Randomized Certainty Equivalence and StabL on many real-world examples including flight control of Boeing 747 and Unmanned Aerial Vehicle. We perform extensive simulation studies showing that the Augmented RBMLE consistently outperforms UCB, Thompson Sampling and StabL by a huge margin, while it is marginally better than Input Perturbation and moderately better than Randomized Certainty Equivalence.

📄 PDF Abstract BibTeX arXiv:2201.10542

Code (0)

등록된 구현이 없습니다.

Tasks

parameter estimationThompson Sampling

Similar Papers 제목 키워드 기반

Reward-Biased Maximum Likelihood Estimation for Neural Contextual Bandits

2022-03-08 · Yu-Heng Hung, Ping-Chun Hsieh

Reward-biased maximum likelihood estimation (RBMLE) is a classic principle in the adaptive control literature for tackling explore-exploit trade-offs. This paper studies the stochastic contextual bandit problem with gene…

Multi-Armed Bandits

Reward Biased Maximum Likelihood Estimation for Reinforcement Learning

2020-11-16 · Akshay Mete, Rahul Singh, Xi Liu, P. R. Kumar

The Reward-Biased Maximum Likelihood Estimate (RBMLE) for adaptive control of Markov chains was proposed to overcome the central obstacle of what is variously called the fundamental "closed-identifiability problem" of ad…

Multi-Armed Banditsreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1

Exploration Through Reward Biasing: Reward-Biased Maximum Likelihood Estimation for Stochastic Multi-Armed Bandits

2019-07-02 · Xi Liu, Ping-Chun Hsieh, Anirban Bhattacharya, P. R. Kumar

Inspired by the Reward-Biased Maximum Likelihood Estimate method of adaptive control, we propose RBMLE -- a novel family of learning algorithms for stochastic multi-armed bandits (SMABs). For a broad range of SMABs inclu…

Multi-Armed Bandits

Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator

2018-05-23 · NeurIPS 2018 12 · Sarah Dean, Horia Mania, Nikolai Matni, Benjamin Recht 외

We consider adaptive control of the Linear Quadratic Regulator (LQR), where an unknown linear system is controlled subject to quadratic costs. Leveraging recent developments in the estimation of linear systems and in rob…

Demand Forecastingparameter estimation

Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Setting

2020-03-12 · Sahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, Anima Anandkumar

We study the problem of adaptive control in partially observable linear quadratic Gaussian control systems, where the model dynamics are unknown a priori. We propose LqgOpt, a novel reinforcement learning algorithm based…

Reinforcement Learning