Learning To Optimize Via Wasserstein Deep Inverse Optimal Control

Abstract

We study the inverse optimal control problem in social sciences: we aim at learning a user's true cost function from the observed temporal behavior. In contrast to traditional phenomenological works that aim to learn a generative model to fit the behavioral data, we propose a novel variational principle and treat user as a reinforcement learning algorithm, which acts by optimizing his cost function. We first propose a unified KL framework that generalizes existing maximum entropy inverse optimal control methods. We further propose a two-step Wasserstein inverse optimal control framework. In the first step, we compute the optimal measure with a novel mass transport equation. In the second step, we formulate the learning problem as a generative adversarial network. In two real world experiments - recommender systems and social networks, we show that our framework obtains significant performance gains over both existing inverse optimal control methods and point process based generative mo

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keywang2018learning

Related papers

• Probabilistic Inverse Optimal Control For Non-linear Partially Observable Systems Disentangles Perceptual Uncertainty And Behavioral Costs (2023)0.00
• Inverse Optimal Control Adapted To The Noise Characteristics Of The Human Sensorimotor System (2021)0.00
• Wasserstein Distance Maximizing Intrinsic Control (2021)0.00
• Actively Learning Reinforcement Learning: A Stochastic Optimal Control Approach (2023)0.00
• Unsupervised Real-time Control Through Variational Empowerment (2017)3.58
• Learning To Score Behaviors For Guided Policy Optimization (2019)0.00
• Generative Intrinsic Optimization: Intrinsic Control With Model Learning (2023)0.00
• Optimal Control Of Probabilistic Dynamics Models Via Mean Hamiltonian Minimization (2025)0.00