Sciweavers

UAI
2008
13 years 9 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 9 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
UAI
2008
13 years 9 months ago
Sensitivity analysis in decision circuits
Decision circuits have been developed to perform efficient evaluation of influence diagrams [Bhattacharjya and Shachter, 2007], building on the advances in arithmetic circuits for...
Debarun Bhattacharjya, Ross D. Shachter
UAI
2008
13 years 9 months ago
Estimation and clustering with infinite rankings
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
Marina Meila, Le Bao
29
Voted
UAI
2008
13 years 9 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
UAI
2008
13 years 9 months ago
Projected Subgradient Methods for Learning Sparse Gaussians
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
John Duchi, Stephen Gould, Daphne Koller
UAI
2008
13 years 9 months ago
Convex Point Estimation using Undirected Bayesian Transfer Hierarchies
When related learning tasks are naturally arranged in a hierarchy, an appealing approach for coping with scarcity of instances is that of transfer learning using a hierarchical Ba...
Gal Elidan, Benjamin Packer, Geremy Heitz, Daphne ...
UAI
2008
13 years 9 months ago
Feature Selection via Block-Regularized Regression
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...
Seyoung Kim, Eric P. Xing
UAI
2008
13 years 9 months ago
Knowledge Combination in Graphical Multiagent Models
A graphical multiagent model (GMM) represents a joint distribution over the behavior of a set of agents. One source of knowledge aboutagents'behaviormaycomefromgametheoretic ...
Quang Duong, Michael P. Wellman, Satinder P. Singh
UAI
2008
13 years 9 months ago
Learning and Solving Many-Player Games through a Cluster-Based Representation
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
Sevan G. Ficici, David C. Parkes, Avi Pfeffer