Imitation Beyond Expectation Using Pluralistic Stochastic Dominance

Aadirupa Saha (UIC) · Ali Farajzadeh (University of Illinois at Chicago) · Danyal Saeed (University of Illinois Chicago) · Syed M Abbas (University of Illinois at Chicago) · Rushit Shah (University of Illinois Chicago) · Brian Ziebart (University of Illinois at Chicago)
behavior cloningdemonstrator's reward functiondistributional reinforcement learningimitation learningimitation learning objectivemulti-objective optimizationoptimal transport theorypluralistic imitatorspolicy samplesqualitative distinctionsreinforcement learningreward distributionsample efficiencystochastic dominancetrajectory pairs

Imitation learning seeks policies reflecting the values of demonstrated behaviors. Prevalent approaches learn to match or exceed the demonstrator's performance in expectation without knowing the demonstrator’s reward function. Unfortunately, this does not induce pluralistic imitators that learn to support qualitatively distinct demonstrations. We reformulate imitation learning using stochastic dominance over the demonstrations' reward distribution across a range of reward functions as our foundational aim. Our approach matches imitator policy samples (or support) with demonstrations using optimal transport theory to define an imitation learning objective over trajectory pairs. We demonstrate the benefits of pluralistic stochastic dominance (PSD) for imitation in both theory and practice.