Sciweavers

2914 search results - page 316 / 583
» Learning and Inference with Constraints
Sort
View
ICASSP
2011
IEEE
14 years 10 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...
AAAI
2011
14 years 6 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
CVPR
2012
IEEE
13 years 9 months ago
Robust Boltzmann Machines for recognition and denoising
While Boltzmann Machines have been successful at unsupervised learning and density modeling of images and speech data, they can be very sensitive to noise in the data. In this pap...
Yichuan Tang, Ruslan Salakhutdinov, Geoffrey E. Hi...
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 7 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr