Sciweavers

2299 search results - page 292 / 460
» Inference and Learning in Planning
Sort
View
ICML
2009
IEEE
15 years 2 months ago
Accelerated sampling for the Indian Buffet Process
We often seek to identify co-occurring hidden features in a set of observations. The Indian Buffet Process (IBP) provides a nonparametric prior on the features present in each obs...
Finale Doshi-Velez, Zoubin Ghahramani
JMLR
2010
187views more  JMLR 2010»
14 years 11 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
132
Voted
ICASSP
2011
IEEE
14 years 8 months ago
USPACOR: Universal sparsity-controlling outlier rejection
The recent upsurge of research toward compressive sampling and parsimonious signal representations hinges on signals being sparse, either naturally, or, after projecting them on a...
Georgios B. Giannakis, Gonzalo Mateos, Shahrokh Fa...
132
Voted
AAAI
2011
14 years 4 months ago
Transportability of Causal and Statistical Relations: A Formal Approach
We address the problem of transferring information learned from experiments to a different environment, in which only passive observations can be collected. We introduce a formal ...
Judea Pearl, Elias Bareinboim
151
Voted
CORR
2012
Springer
220views Education» more  CORR 2012»
14 years 10 days ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing