Maximum Likelihood Methods for Inverse Learning of Optimal Controllers
This paper presents a framework for inverse learning of objective functions for constrained optimal control problems, which is based on the Karush-Kuhn-Tucker (KKT) conditions. We discuss three variants corresponding to different model assumptions and computational complexities. The first method uses a convex relaxation of the KKT conditions and serves as the benchmark. The main contribution of this paper is the proposition of two learning methods that combine the KKT conditions with maximum likelihood estimation. The key benefit of this combination is the systematic treatment of constraints for learning from noisy data with a branch-and-bound algorithm using likelihood arguments. This paper discusses theoretic properties of the learning methods and presents simulation results that highlight the advantages of using the maximum likelihood formulation for learning objective functions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Certifiably Optimal Sparse Inverse Covariance Estimation
We consider the maximum likelihood estimation of sparse inverse covariance matrices. We demonstrate that current heuristic approaches primarily encourage robustness, instead of the desired sparsity. We give a novel appro…
Testing that a Local Optimum of the Likelihood is Globally Optimum using Reparameterized Embeddings
Many mathematical imaging problems are posed as non-convex optimization problems. When numerically tractable global optimization procedures are not available, one is often interested in testing ex post facto whether or n…
global-optimizationFast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging
Consider the problem of minimizing an expected logarithmic loss over either the probability simplex or the set of quantum density matrices. This problem includes tasks such as solving the Poisson inverse problem, computi…
Quantum State TomographyInverse-Weighted Survival Games
Deep models trained through maximum likelihood have achieved state-of-the-art results for survival analysis. Despite this training scheme, practitioners evaluate models under other criteria, such as binary classification…
Binary ClassificationSurvival AnalysisMaximum-Likelihood Inverse Reinforcement Learning with Finite-Time Guarantees
Inverse reinforcement learning (IRL) aims to recover the reward function and the associated optimal policy that best fits observed sequences of states and actions implemented by an expert. Many algorithms for IRL have an…
counterfactualImitation LearningMuJoCoreinforcement-learning+2