Probabilistic World Modeling with Asymmetric Distance Measure

• URL: http://arxiv.org/abs/2403.10875v1
• Date: Sat, 16 Mar 2024 09:58:49 GMT
• Title: Probabilistic World Modeling with Asymmetric Distance Measure
• Abstract summary: We show that learning a distance function is essential to allow planning and reasoning in the representation space. We learn an asymmetric similarity function that reflects the state reachability and allows multi-way probabilistic inference. By conditioning on a common reference state, the learned representation space allows us to discover the geometrically salient states that only a handful of paths can lead through.
• Score: 0.3021678014343889
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Representation learning is a fundamental task in machine learning, aiming at uncovering structures from data to facilitate subsequent tasks. However, what is a good representation for planning and reasoning in a stochastic world remains an open problem. In this work, we posit that learning a distance function is essential to allow planning and reasoning in the representation space. We show that a geometric abstraction of the probabilistic world dynamics can be embedded into the representation space through asymmetric contrastive learning. Unlike previous approaches that focus on learning mutual similarity or compatibility measures, we instead learn an asymmetric similarity function that reflects the state reachability and allows multi-way probabilistic inference. Moreover, by conditioning on a common reference state (e.g. the observer's current state), the learned representation space allows us to discover the geometrically salient states that only a handful of paths can lead through. These states can naturally serve as subgoals to break down long-horizon planning tasks. We evaluate our method in gridworld environments with various layouts and demonstrate its effectiveness in discovering the subgoals.

Related papers

• Can Machines Really See Objects in Images? A Study Based on Syntactic Distance and Visual Self-Referential Instances [53.65561607407989]
  We ask whether a model can still classify correctly when such local cues provide no stable basis for distinction.<n>Experiments on ResNets and Vision Transformers reveal a consistent phase-transition phenomenon.<n>Results suggest that general intelligence may require creating new language, not reusing an existing one.
  arXiv  Detail & Related papers  (2026-06-28T14:27:40Z)
• Social-JEPA: Emergent Geometric Isomorphism [11.526381612918549]
  World models compress rich sensory streams into compact latent codes that anticipate future observations.<n>We let separate agents acquire such models from distinct viewpoints of the same environment without any parameter sharing or coordination.<n>After training, their internal representations exhibit a striking emergent property: the two latent spaces are related by an approximate linear isometry.
  arXiv  Detail & Related papers  (2026-02-28T07:54:43Z)
• GOPLA: Generalizable Object Placement Learning via Synthetic Augmentation of Human Arrangement [16.549660613125877]
  GOPLA is a hierarchical framework that learns generalizable object placement from augmented human demonstrations.<n>To overcome data scarcity, we introduce a scalable pipeline that expands human placement demonstrations into diverse synthetic training data.<n>Our approach improves placement success rates by 30.04 percentage points over the runner-up, evaluated on positioning accuracy and physical plausibility.
  arXiv  Detail & Related papers  (2025-10-16T12:38:14Z)
• One Life to Learn: Inferring Symbolic World Models for Stochastic Environments from Unguided Exploration [77.8436947454471]
  Symbolic world modeling requires inferring and representing an environment's transitional dynamics as an executable program.<n>OneLife is a framework that models world dynamics through conditionally-activated programmatic laws.<n>OneLife can successfully learn key environment dynamics from minimal, unguided interaction.
  arXiv  Detail & Related papers  (2025-10-14T02:49:32Z)
• PALMER: Perception-Action Loop with Memory for Long-Horizon Planning [1.5469452301122177]
  We introduce a general-purpose planning algorithm called PALMER. Palmer combines classical sampling-based planning algorithms with learning-based perceptual representations. This creates a tight feedback loop between representation learning, memory, reinforcement learning, and sampling-based planning.
  arXiv  Detail & Related papers  (2022-12-08T22:11:49Z)
• Stochastic Coherence Over Attention Trajectory For Continuous Learning In Video Streams [64.82800502603138]
  This paper proposes a novel neural-network-based approach to progressively and autonomously develop pixel-wise representations in a video stream. The proposed method is based on a human-like attention mechanism that allows the agent to learn by observing what is moving in the attended locations. Our experiments leverage 3D virtual environments and they show that the proposed agents can learn to distinguish objects just by observing the video stream.
  arXiv  Detail & Related papers  (2022-04-26T09:52:31Z)
• Masked prediction tasks: a parameter identifiability view [49.533046139235466]
  We focus on the widely used self-supervised learning method of predicting masked tokens. We show that there is a rich landscape of possibilities, out of which some prediction tasks yield identifiability, while others do not.
  arXiv  Detail & Related papers  (2022-02-18T17:09:32Z)
• Instance Similarity Learning for Unsupervised Feature Representation [83.31011038813459]
  We propose an instance similarity learning (ISL) method for unsupervised feature representation. We employ the Generative Adversarial Networks (GAN) to mine the underlying feature manifold. Experiments on image classification demonstrate the superiority of our method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-08-05T16:42:06Z)
• Abstract Spatial-Temporal Reasoning via Probabilistic Abduction and Execution [97.50813120600026]
  Spatial-temporal reasoning is a challenging task in Artificial Intelligence (AI) Recent works have focused on an abstract reasoning task of this kind -- Raven's Progressive Matrices ( RPM) We propose a neuro-symbolic Probabilistic Abduction and Execution learner (PrAE) learner.
  arXiv  Detail & Related papers  (2021-03-26T02:42:18Z)
• Generalized Inverse Planning: Learning Lifted non-Markovian Utility for Generalizable Task Representation [83.55414555337154]
  In this work, we study learning such utility from human demonstrations. We propose a new quest, Generalized Inverse Planning, for utility learning in this domain. We outline a computational framework, Maximum Entropy Inverse Planning (MEIP), that learns non-Markovian utility and associated concepts in a generative manner.
  arXiv  Detail & Related papers  (2020-11-12T21:06:26Z)
• Learning intuitive physics and one-shot imitation using state-action-prediction self-organizing maps [0.0]
  Humans learn by exploration and imitation, build causal models of the world, and use both to flexibly solve new tasks. We suggest a simple but effective unsupervised model which develops such characteristics. We demonstrate its performance on a set of several related, but different one-shot imitation tasks, which the agent flexibly solves in an active inference style.
  arXiv  Detail & Related papers  (2020-07-03T12:29:11Z)
• On Equivariant and Invariant Learning of Object Landmark Representations [36.214069685880986]
  We develop a simple and effective approach by combining instance-discriminative and spatially-discriminative contrastive learning. We show that when a deep network is trained to be invariant to geometric and photometric transformations, representations emerge from its intermediate layers that are highly predictive of object landmarks.
  arXiv  Detail & Related papers  (2020-06-26T04:06:56Z)
• Neural Topological SLAM for Visual Navigation [112.73876869904]
  We design topological representations for space that leverage semantics and afford approximate geometric reasoning. We describe supervised learning-based algorithms that can build, maintain and use such representations under noisy actuation.
  arXiv  Detail & Related papers  (2020-05-25T17:56:29Z)
• Symbolic Learning and Reasoning with Noisy Data for Probabilistic Anchoring [19.771392829416992]
  We propose a semantic world modeling approach based on bottom-up object anchoring. We extend the definitions of anchoring to handle multi-modal probability distributions. We use statistical relational learning to enable the anchoring framework to learn symbolic knowledge.
  arXiv  Detail & Related papers  (2020-02-24T16:58:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.