Sciweavers

UAI
2000
13 years 6 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
UAI
2000
13 years 6 months ago
Game Networks
We introduce Game networks (G nets), a novel representation for multi-agent decision problems. Compared to other game-theoretic representations, such as strategic or extensive for...
Pierfrancesco La Mura
UAI
2000
13 years 6 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
UAI
2000
13 years 6 months ago
Feature Selection and Dualities in Maximum Entropy Discrimination
Incorporating feature selection into a classi cation or regression method often carries a number of advantages. In this paper we formalize feature selection speci cally from a dis...
Tony Jebara, Tommi Jaakkola
UAI
2000
13 years 6 months ago
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
Michael C. Horsch, William S. Havens
UAI
2000
13 years 6 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
UAI
2000
13 years 6 months ago
Maximum Entropy and the Glasses You are Looking Through
We give an interpretation of the Maximum Entropy (MaxEnt) Principle in gametheoretic terms. Based on this interpretation, we make a formal distinction between di erent ways of app...
Peter Grünwald
UAI
2000
13 years 6 months ago
Building a Stochastic Dynamic Model of Application Use
Many intelligent user interfaces employ application and user models to determine the user's preferences, goals and likely future actions. Such models require application anal...
Peter Gorniak, David Poole
UAI
2000
13 years 6 months ago
Gaussian Process Networks
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...
Nir Friedman, Iftach Nachman
UAI
2000
13 years 6 months ago
Being Bayesian about Network Structure
In many domains, we are interested in analyzing the structure of the underlying distribution, e.g., whether one variable is a direct parent of the other. Bayesian model selection a...
Nir Friedman, Daphne Koller