Sciweavers

UAI
2001
13 years 5 months ago
Learning the Dimensionality of Hidden Variables
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Dete...
Gal Elidan, Nir Friedman
NIPS
2007
13 years 6 months ago
Agreement-Based Learning
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
Percy Liang, Dan Klein, Michael I. Jordan
NIPS
2007
13 years 6 months ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
PKDD
2009
Springer
146views Data Mining» more  PKDD 2009»
13 years 9 months ago
Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding prob...
Eva Besada-Portas, Sergey M. Plis, Jesús Ma...
ICML
2004
IEEE
13 years 10 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
ECML
2005
Springer
13 years 10 months ago
U-Likelihood and U-Updating Algorithms: Statistical Inference in Latent Variable Models
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
JaeMo Sung, Sung Yang Bang, Seungjin Choi, Zoubin ...
ICASSP
2008
IEEE
13 years 11 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
ICASSP
2008
IEEE
13 years 11 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
ICML
2005
IEEE
14 years 5 months ago
New d-separation identification results for learning continuous latent variable models
Learning the structure of graphical models is an important task, but one of considerable difficulty when latent variables are involved. Because conditional independences using hid...
Ricardo Silva, Richard Scheines