Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 19 tok/s Pro
GPT-5 High 22 tok/s Pro
GPT-4o 74 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 438 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Gaussian Mixture Models for Affordance Learning using Bayesian Networks (2402.06078v1)

Published 8 Feb 2024 in cs.RO and cs.AI

Abstract: Affordances are fundamental descriptors of relationships between actions, objects and effects. They provide the means whereby a robot can predict effects, recognize actions, select objects and plan its behavior according to desired goals. This paper approaches the problem of an embodied agent exploring the world and learning these affordances autonomously from its sensory experiences. Models exist for learning the structure and the parameters of a Bayesian Network encoding this knowledge. Although Bayesian Networks are capable of dealing with uncertainty and redundancy, previous work considered complete observability of the discrete sensory data, which may lead to hard errors in the presence of noise. In this paper we consider a probabilistic representation of the sensors by Gaussian Mixture Models (GMMs) and explicitly taking into account the probability distribution contained in each discrete affordance concept, which can lead to a more correct learning.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. O. Cappé and E.Moulines. On-line expectation–maximization algorithm for latent data models. Journal of the Royal Statistical Society: Series B, 71(3):593–613, 2009.
  2. G.F. Cooper and E. Herskovits. A bayesian method for the induction of probabilistic networks from data. Machine Learning, 9(4):309–347, 1992.
  3. Andrew Moore Dan Pelleg. X-means: Extending k-means with efficient estimation of the number of clusters. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 727–734, San Francisco, 2000. Morgan Kaufmann.
  4. Maximum likelihood from incomplete data via the em algorithm. J. Royal Statistical Society B, 39:1–38, 1977.
  5. N. Firedman. The bayesian structural em algorithm. In Uncertainty in Artificial Intelligence, UAI, 1998.
  6. Learning about objects through action: Initial steps towards artificialcognition. In IEEE International Conference on Robotics and Automation, Taipei, Taiwan, 2003.
  7. J. J. Gibson. The Ecological Approach to Visual Perception. Houghton Mifflin, Boston, 1979.
  8. D. Heckerman. A tutorial on learning with bayesian networks. Technical report, Microsoft Research Advanced Techonlogy Division, 1996.
  9. P. Liang and D. Klein. Online EM for unsupervised models. In North American Association for Computational Linguistics (NAACL), 2009.
  10. D. Madigan and J. York. Bayesian graphical models for discrete data. Intl. Statistical Review, 63:215–232, 1995.
  11. Learning object affordances: From sensory–motor coordination to imitation. IEEE Transactions on Robotics, 24(1):15–26, Feb. 2008.
Citations (12)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.