Increasing Information for Model Predictive Control with Semi-Markov Decision Processes
Recent works in Learning-Based Model Predictive Control of dynamical systems show impressive sample complexity performances using criteria from Information Theory to accelerate the learning procedure. However, the sequential exploration opportunities are limited by the system local state, restraining the amount of information of the observations from the current exploration trajectory. This article resolves this limitation by introducing temporal abstraction through the framework of Semi-Markov Decision Processes. The framework increases the total information of the gathered data for a fixed sampling budget, thus reducing the sample complexity.
Code (1)
Tasks
Model Predictive ControlSimilar Papers 제목 키워드 기반
Toward Transparent Sequence Models with Model-Based Tree Markov Model
In this study, we address the interpretability issue in complex, black-box Machine Learning models applied to sequence data. We introduce the Model-Based tree Hidden Semi-Markov Model (MOB-HSMM), an inherently interpreta…
modelHierarchical Semi-Markov Models with Duration-Aware Dynamics for Activity Sequences
Residential electricity demand at granular scales is driven by what people do and for how long. Accurately forecasting this demand for applications like microgrid management and demand response therefore requires generat…
A Semi-Decentralized Approach to Multiagent Control
We introduce an expressive framework and algorithms for the semi-decentralized control of cooperative agents in environments with communication uncertainty. Whereas semi-Markov control admits a distribution over time for…
Semi-Supervised Clustering via Information-Theoretic Markov Chain Aggregation
We connect the problem of semi-supervised clustering to constrained Markov aggregation, i.e., the task of partitioning the state space of a Markov chain. We achieve this connection by considering every data point in the …
ClusteringA Semi-Markov Structured Support Vector Machine Model for High-Precision Named Entity Recognition
Named entity recognition (NER) is the backbone of many NLP solutions. F1 score, the harmonic mean of precision and recall, is often used to select/evaluate the best models. However, when precision needs to be prioritized…
named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)NER