Sciweavers

NIPS
2007
13 years 11 months ago
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
NIPS
2007
13 years 11 months ago
Hierarchical Penalization
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
Marie Szafranski, Yves Grandvalet, Pierre Morizet-...
NIPS
2007
13 years 11 months ago
Sparse deep belief net model for visual area V2
Honglak Lee, Chaitanya Ekanadham, Andrew Y. Ng
NIPS
2007
13 years 11 months ago
Bayesian Agglomerative Clustering with Coalescents
We introduce a new Bayesian model for hierarchical clustering based on a prior over trees called Kingman’s coalescent. We develop novel greedy and sequential Monte Carlo inferen...
Yee Whye Teh, Hal Daumé III, Daniel M. Roy
NIPS
2007
13 years 11 months ago
HM-BiTAM: Bilingual Topic Exploration, Word Alignment, and Translation
We present a novel paradigm for statistical machine translation (SMT), based on a joint modeling of word alignment and the topical aspects underlying bilingual document-pairs, via...
Bing Zhao, Eric P. Xing
NIPS
2007
13 years 11 months ago
An in-silico Neural Model of Dynamic Routing through Neuronal Coherence
We describe a neurobiologically plausible model to implement dynamic routing using the concept of neuronal communication through neuronal coherence. The model has a three-tier arc...
Devarajan Sridharan, Brian Percival, John V. Arthu...
NIPS
2007
13 years 11 months ago
One-Pass Boosting
This paper studies boosting algorithms that make a single pass over a set of base classifiers. We first analyze a one-pass algorithm in the setting of boosting with diverse base...
Zafer Barutçuoglu, Philip M. Long, Rocco A....
NIPS
2007
13 years 11 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
NIPS
2007
13 years 11 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
NIPS
2007
13 years 11 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer