Sciweavers

UAI
2008
13 years 6 months ago
Causal discovery of linear acyclic models with arbitrary distributions
An important task in data analysis is the discovery of causal relationships between observed variables. For continuous-valued data, linear acyclic causal models are commonly used ...
Patrik O. Hoyer, Aapo Hyvärinen, Richard Sche...
UAI
2008
13 years 6 months ago
Greedy Block Coordinate Descent for Large Scale Gaussian Process Regression
We propose a variable decomposition algorithm
Liefeng Bo, Cristian Sminchisescu
UAI
2008
13 years 6 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
UAI
2008
13 years 6 months ago
Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium
We study a multiagent learning problem where agents can either learn via repeated interactions, or can follow the advice of a mediator who suggests possible actions to take. We pr...
Greg Hines, Kate Larson
UAI
2008
13 years 6 months ago
Explanation Trees for Causal Bayesian Networks
Bayesian networks can be used to extract explanations about the observed state of a subset of variables. In this paper, we explicate the desiderata of an explanation and confront ...
Ulf H. Nielsen, Jean-Philippe Pellet, André...
UAI
2008
13 years 6 months ago
Cumulative distribution networks and the derivative-sum-product algorithm
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
Jim C. Huang, Brendan J. Frey
UAI
2008
13 years 6 months ago
Bounding Search Space Size via (Hyper)tree Decompositions
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
Lars Otten, Rina Dechter
UAI
2008
13 years 6 months ago
Flexible Priors for Exemplar-based Clustering
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
Daniel Tarlow, Richard S. Zemel, Brendan J. Frey