Sciweavers

NIPS
2008
13 years 6 months ago
Learning Hybrid Models for Image Annotation with Partially Labeled Data
Extensive labeled data for image annotation systems, which learn to assign class labels to image regions, is difficult to obtain. We explore a hybrid model framework for utilizing...
Xuming He, Richard S. Zemel
NIPS
2008
13 years 6 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
NIPS
2008
13 years 6 months ago
Characteristic Kernels on Groups and Semigroups
Embeddings of random variables in reproducing kernel Hilbert spaces (RKHSs) may be used to conduct statistical inference based on higher order moments. For sufficiently rich (char...
Kenji Fukumizu, Bharath K. Sriperumbudur, Arthur G...
NIPS
2008
13 years 6 months ago
Covariance Estimation for High Dimensional Data Vectors Using the Sparse Matrix Transform
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
Guangzhi Cao, Charles A. Bouman
NIPS
2008
13 years 6 months ago
Fast Rates for Regularized Objectives
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...
NIPS
2008
13 years 6 months ago
Bayesian Exponential Family PCA
Principal Components Analysis (PCA) has become established as one of the key tools for dimensionality reduction when dealing with real valued data. Approaches such as exponential ...
Shakir Mohamed, Katherine A. Heller, Zoubin Ghahra...
NIPS
2008
13 years 6 months ago
ICA based on a Smooth Estimation of the Differential Entropy
In this paper we introduce the MeanNN approach for estimation of main information theoretic measures such as differential entropy, mutual information and divergence. As opposed to...
Lev Faivishevsky, Jacob Goldberger
NIPS
2008
13 years 6 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
NIPS
2008
13 years 6 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
NIPS
2008
13 years 6 months ago
Unlabeled data: Now it helps, now it doesn't
Empirical evidence shows that in favorable situations semi-supervised learning (SSL) algorithms can capitalize on the abundance of unlabeled training data to improve the performan...
Aarti Singh, Robert D. Nowak, Xiaojin Zhu