Results 1  10
of
46
Learning object affordances: From sensory–motor coordination to imitation
 IEEE TRANSACTIONS ON ROBOTICS
, 2008
"... Affordances encode relationships between actions, objects, and effects. They play an important role on basic cognitive capabilities such as prediction and planning. We address the problem of learning affordances through the interaction of a robot with the environment, a key step to understand the w ..."
Abstract

Cited by 85 (7 self)
 Add to MetaCart
(Show Context)
Affordances encode relationships between actions, objects, and effects. They play an important role on basic cognitive capabilities such as prediction and planning. We address the problem of learning affordances through the interaction of a robot with the environment, a key step to understand the world properties and develop social skills. We present a general model for learning object affordances using Bayesian networks integrated within a general developmental architecture for social robots. Since learning is based on a probabilistic model, the approach is able to deal with uncertainty, redundancy, and irrelevant information. We demonstrate successful learning in the real world by having an humanoid robot interacting with objects. We illustrate the benefits of the acquired knowledge in imitation games.
Bayesian structure learning using dynamic programming and MCMC
 In UAI, 2007b
"... We show how to significantly speed up MCMC sampling of DAG structures by using a powerful nonlocal proposal based on Koivisto’s dynamic programming (DP) algorithm (11; 10), which computes the exact marginal posterior edge probabilities by analytically summing over orders. Furthermore, we show how s ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
We show how to significantly speed up MCMC sampling of DAG structures by using a powerful nonlocal proposal based on Koivisto’s dynamic programming (DP) algorithm (11; 10), which computes the exact marginal posterior edge probabilities by analytically summing over orders. Furthermore, we show how sampling in DAG space can avoid subtle biases that are introduced by approaches that work only with orders, such as Koivisto’s DP algorithm and MCMC order samplers (6; 5). 1
Exact structure discovery in Bayesian networks with less space
 In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI
, 2009
"... The fastest known exact algorithms for scorebased structure discovery in Bayesian networks on n nodes run in time and space 2 n n O(1). The usage of these algorithms is limited to networks on at most around 25 nodes mainly due to the space requirement. Here, we study space–time tradeoffs for finding ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
The fastest known exact algorithms for scorebased structure discovery in Bayesian networks on n nodes run in time and space 2 n n O(1). The usage of these algorithms is limited to networks on at most around 25 nodes mainly due to the space requirement. Here, we study space–time tradeoffs for finding an optimal network structure. When little space is available, we apply the Gurevich– Shelah recurrence—originally proposed for the Hamiltonian path problem—and obtain time 2 2n−s n O(1) in space 2 s n O(1) for any s = n/2,n/4,n/8,...; we assume the indegree of each node is bounded by a constant. For the more practical setting with moderate amounts of space, we present a novel scheme. It yields running time 2 n (3/2) p n O(1) in space 2 n (3/4) p n O(1) for any p = 0,1,...,n/2; these bounds hold as long as the indegrees are at most 0.238n. Furthermore, the latter scheme allows easy and efficient parallelization beyond previous algorithms. We also explore empirically the potential of the presented techniques. 1
Modeling Discrete Interventional Data using Directed Cyclic Graphical Models
"... We outline a representation for discrete multivariate distributions in terms of interventional potential functions that are globally normalized. This representation can be used to model the effects of interventions, and the independence properties encoded in this model can be represented as a direct ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We outline a representation for discrete multivariate distributions in terms of interventional potential functions that are globally normalized. This representation can be used to model the effects of interventions, and the independence properties encoded in this model can be represented as a directed graph that allows cycles. In addition to discussing inference and sampling with this representation, we give an exponential family parametrization that allows parameter estimation to be stated as a convex optimization problem; we also give a convex relaxation of the task of simultaneous parameter and structure learning using group ℓ1regularization. The model is evaluated on simulated data and intracellular flow cytometry data. 1
Learning linear cyclic causal models with latent variables
, 2012
"... Identifying causeeffect relationships between variables of interest is a central problem in science. Given a set of experiments we describe a procedure that identifies linear models that may contain cycles and latent variables. We provide a detailed description of the model family, full proofs of t ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
(Show Context)
Identifying causeeffect relationships between variables of interest is a central problem in science. Given a set of experiments we describe a procedure that identifies linear models that may contain cycles and latent variables. We provide a detailed description of the model family, full proofs of the necessary and sufficient conditions for identifiability, a search algorithm that is complete, and a discussion of what can be done when the identifiability conditions are not satisfied. The algorithm is comprehensively tested in simulations, comparing it to competing algorithms in the literature. Furthermore, we adapt the procedure to the problem of cellular network inference, applying it to the biologically realistic data of the DREAM challenges. The paper provides a full theoretical foundation for the causal discovery procedure first presented by Eberhardt et al. (2010) and Hyttinen et al. (2010).
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
, 2012
"... The investigation of directed acyclic graphs (DAGs) encoding the same Markov property, that is the same conditional independence relations of multivariate observational distributions, has a long tradition; many algorithms exist for model selection and structure learning in Markov equivalence classes ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
The investigation of directed acyclic graphs (DAGs) encoding the same Markov property, that is the same conditional independence relations of multivariate observational distributions, has a long tradition; many algorithms exist for model selection and structure learning in Markov equivalence classes. In this paper, we extend the notion of Markov equivalence of DAGs to the case of interventional distributions arising from multiple intervention experiments. We show that under reasonable assumptions on the intervention experiments, interventional Markov equivalence defines a finer partitioning of DAGs than observational Markov equivalence and hence improves the identifiability of causal models. We give a graph theoretic criterion for two DAGs being Markov equivalent under interventions and show that each interventional Markov equivalence class can, analogously to the observational case, be uniquely represented by a chain graph called interventional essential graph (also known as CPDAG in the observational case). These are key insights for deriving a generalization of the Greedy Equivalence Search algorithm aimed at structure learning from interventional data. This new algorithm is evaluated in a simulation study.
Exact Bayesian network learning in estimation of distribution algorithms
 In Proceedings of the 2007 Congress on Evolutionary Computation CEC2007
, 2007
"... Abstract—This paper introduces exact learning of Bayesian networks in estimation of distribution algorithms. The estimation of Bayesian network algorithm (EBNA) is used to analyze the impact of learning the optimal (exact) structure in the search. By applying recently introduced methods that allow ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
Abstract—This paper introduces exact learning of Bayesian networks in estimation of distribution algorithms. The estimation of Bayesian network algorithm (EBNA) is used to analyze the impact of learning the optimal (exact) structure in the search. By applying recently introduced methods that allow learning optimal Bayesian networks, we investigate two important issues in EDAs. First, we analyze the question of whether learning more accurate (exact) models of the dependencies implies a better performance of EDAs. Second, we are able to study the way in which the problem structure is translated into the probabilistic model when exact learning is accomplished. I.
Combining experiments to discover linear cyclic models with latent variables
 In AISTATS 2010
, 2010
"... We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relations are linear, but is otherwise completely general: It provides consistent estimates when the true causal structure conta ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relations are linear, but is otherwise completely general: It provides consistent estimates when the true causal structure contains feedback loops and latent variables, while the experiments can involve surgical or ‘soft ’ interventions on one or multiple variables at a time. The algorithm is ‘online’ in the sense that it combines the results from any set of available experiments, can incorporate background knowledge and resolves conflicts that arise from combining results from different experiments. In addition we provide a necessary and sufficient condition that (i) determines when the algorithm can uniquely return the true graph, and (ii) can be used to select the next best experiment until this condition is satisfied. We demonstrate the method by applying it to simulated data and the flow cytometry data of Sachs et al (2005). 1
Systems analysis of EGF receptor signaling dynamics with microwestern arrays
 Nat Meth
"... We describe microwestern arrays, which enable quantitative, sensitive and highthroughput assessment of protein abundance and modifications following electrophoretic separation of microarrayed cell lysates. This method allowed us to measure 91 phosphosites on 67 proteins at six time points followi ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We describe microwestern arrays, which enable quantitative, sensitive and highthroughput assessment of protein abundance and modifications following electrophoretic separation of microarrayed cell lysates. This method allowed us to measure 91 phosphosites on 67 proteins at six time points following stimulation with five EGF concentrations in A431 human carcinoma cells. We inferred the connectivities among 15 phosphorylation sites across 10 receptor tyrosine kinases (RTK) and 2 sites from Src kinase using Bayesian network modeling and two mutual informationbased methods; the three inference methods yielded significant agreement on the network topology. These results imply multiple distinct RTK coactivation mechanisms and support the notion that small amounts of experimental data collected from phenotypically diverse network states may enable network inference. Systemslevel understanding of protein functions in biological processes remains a challenge. The western1 blot is a powerful protein analysis method because the electrophoretic separation step allows for reduction in sample complexity and the antibody detection step then results in signal amplitude proportional to the abundance of the
Modeling affordances using bayesian networks
 in IEEE  Intelligent Robotic Systems (IROS’06
, 2007
"... Abstract — Affordances represent the behavior of objects in terms of the robot’s motor and perceptual skills. This type of knowledge plays a crucial role in developmental robotic systems, since it is at the core of many higher level skills such as imitation. In this paper, we propose a general affor ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract — Affordances represent the behavior of objects in terms of the robot’s motor and perceptual skills. This type of knowledge plays a crucial role in developmental robotic systems, since it is at the core of many higher level skills such as imitation. In this paper, we propose a general affordance model based on Bayesian networks linking actions, object features and action effects. The network is learnt by the robot through interaction with the surrounding objects. The resulting probabilistic model is able to deal with uncertainty, redundancy and irrelevant information. We evaluate the approach using a real humanoid robot that interacts with objects. I.