Pith. sign in

REVIEW 2 cited by

Learning Multimodal Rewards from Rankings

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.12750 v2 pith:AZCL6LXE submitted 2021-09-27 cs.LG cs.AIcs.RO

classification cs.LGcs.AIcs.RO
keywords learningrewardapproachdatamultimodaldevelopdifferentexpert
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Learning from human feedback has shown to be a useful approach in acquiring robot reward functions. However, expert feedback is often assumed to be drawn from an underlying unimodal reward function. This assumption does not always hold including in settings where multiple experts provide data or when a single expert provides data for different tasks -- we thus go beyond learning a unimodal reward and focus on learning a multimodal reward function. We formulate the multimodal reward learning as a mixture learning problem and develop a novel ranking-based learning approach, where the experts are only required to rank a given set of trajectories. Furthermore, as access to interaction data is often expensive in robotics, we develop an active querying approach to accelerate the learning process. We conduct experiments and user studies using a multi-task variant of OpenAI's LunarLander and a real Fetch robot, where we collect data from multiple users with different preferences. The results suggest that our approach can efficiently learn multimodal reward functions, and improve data-efficiency over benchmark methods that we adapt to our learning problem.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MAVRL: Learning Reward Functions from Multiple Feedback Types with Amortized Variational Inference

    cs.LG 2026-02 conditional novelty 6.0 of 10

    MAVRL trains one reward model from demonstrations, comparisons, ratings, and stops using a single evidence lower bound, and shows in simulation that combining types improves reward recovery and robustness.

  2. Interactive Multi-Objective Probabilistic Preference Learning with Soft and Hard Bounds

    cs.AI 2025-06 conditional novelty 5.0 of 10

    Active-MoSH interactively learns a decision maker's soft and hard bounds on objectives and actively samples Pareto-optimal points, with a sensitivity analysis module intended to build trust.

Pith tools