Sciweavers

2095 search results - page 348 / 419
» Improved pebbling bounds
Sort
View
NIPS
2008
13 years 11 months ago
Relative Performance Guarantees for Approximate Inference in Latent Dirichlet Allocation
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
Indraneel Mukherjee, David M. Blei
NIPS
2008
13 years 11 months ago
Privacy-preserving logistic regression
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
Kamalika Chaudhuri, Claire Monteleoni
NIPS
2008
13 years 11 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
NIPS
2008
13 years 11 months ago
Human Active Learning
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
Rui M. Castro, Charles Kalish, Robert Nowak, Ruich...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 11 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu