Sciweavers

UAI
2008
13 years 6 months ago
Almost Optimal Intervention Sets for Causal Discovery
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
Frederick Eberhardt
UAI
2008
13 years 6 months ago
Bounds on the Bethe Free Energy for Gaussian Networks
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
Botond Cseke, Tom Heskes
UAI
2008
13 years 6 months ago
Latent Topic Models for Hypertext
Latent topic models have been successfully applied as an unsupervised topic discovery technique in large document collections. With the proliferation of hypertext document collect...
Amit Gruber, Michal Rosen-Zvi, Yair Weiss
UAI
2008
13 years 6 months ago
Convergent Message-Passing Algorithms for Inference over General Graphs with Convex Free Energies
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
Tamir Hazan, Amnon Shashua
UAI
2008
13 years 6 months ago
Improving Gradient Estimation by Incorporating Sensor Data
An efficient policy search algorithm should estimate the local gradient of the objective function, with respect to the policy parameters, from as few trials as possible. Whereas m...
Gregory Lawrence, Stuart J. Russell
UAI
2008
13 years 6 months ago
Bayesian Out-Trees
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
Tony Jebara
UAI
2008
13 years 6 months ago
Topic Models Conditioned on Arbitrary Features with Dirichlet-multinomial Regression
Although fully generative models have been successfully used to model the contents of text documents, they are often awkward to apply to combinations of text data and document met...
David M. Mimno, Andrew McCallum
UAI
2008
13 years 6 months ago
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
Gert De Cooman, Filip Hermans, Erik Quaeghebeur
UAI
2008
13 years 6 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
UAI
2008
13 years 6 months ago
A Game-Theoretic Analysis of Updating Sets of Probabilities
We consider how an agent should update her uncertainty when it is represented by a set P of probability distributions and the agent observes that a random variable X takes on valu...
Peter Grünwald, Joseph Y. Halpern