Pith. sign in

REVIEW 1 cited by

Mutual Information Maximization for Robust Plannable Representations

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 2005.08114 v1 pith:PSM7XJZL submitted 2020-05-16 cs.CV cs.AIstat.ML

classification cs.CVcs.AIstat.ML
keywords informationobjectivesreconstructionsampletheywhilecapturecomplexity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Extending the capabilities of robotics to real-world complex, unstructured environments requires the need of developing better perception systems while maintaining low sample complexity. When dealing with high-dimensional state spaces, current methods are either model-free or model-based based on reconstruction objectives. The sample inefficiency of the former constitutes a major barrier for applying them to the real-world. The later, while they present low sample complexity, they learn latent spaces that need to reconstruct every single detail of the scene. In real environments, the task typically just represents a small fraction of the scene. Reconstruction objectives suffer in such scenarios as they capture all the unnecessary components. In this work, we present MIRO, an information theoretic representational learning algorithm for model-based reinforcement learning. We design a latent space that maximizes the mutual information with the future information while being able to capture all the information needed for planning. We show that our approach is more robust than reconstruction objectives in the presence of distractors and cluttered scenes

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. On Learning Informative Trajectory Embeddings for Imitation, Classification and Regression

    cs.LG 2025-01 conditional novelty 6.0 of 10

    A variational autoencoder over skill sequences produces label-free trajectory embeddings that separate and imitate policies of different ability levels in MuJoCo control tasks.

Pith tools