Sciweavers

Share
ICML
2007
IEEE
10 years 6 months ago
On learning linear ranking functions for beam search
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
Yuehua Xu, Alan Fern
ICML
2007
IEEE
10 years 6 months ago
Bayesian compressive sensing and projection optimization
This paper introduces a new problem for which machine-learning tools may make an impact. The problem considered is termed "compressive sensing", in which a real signal o...
Shihao Ji, Lawrence Carin
ICML
2007
IEEE
10 years 6 months ago
Online discovery of similarity mappings
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
Alexander Rakhlin, Jacob Abernethy, Peter L. Bartl...
ICML
2007
IEEE
10 years 6 months ago
Most likely heteroscedastic Gaussian process regression
This paper presents a novel Gaussian process (GP) approach to regression with inputdependent noise rates. We follow Goldberg et al.'s approach and model the noise variance us...
Kristian Kersting, Christian Plagemann, Patrick Pf...
ICML
2007
IEEE
10 years 6 months ago
Least squares linear discriminant analysis
Linear Discriminant Analysis (LDA) is a well-known method for dimensionality reduction and classification. LDA in the binaryclass case has been shown to be equivalent to linear re...
Jieping Ye
ICML
2007
IEEE
10 years 6 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICML
2007
IEEE
10 years 6 months ago
The matrix stick-breaking process for flexible multi-task learning
In multi-task learning our goal is to design regression or classification models for each of the tasks and appropriately share information between tasks. A Dirichlet process (DP) ...
Ya Xue, David B. Dunson, Lawrence Carin
ICML
2007
IEEE
10 years 6 months ago
Feature selection in a kernel space
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...
Bin Cao, Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng...
ICML
2007
IEEE
10 years 6 months ago
Dimensionality reduction and generalization
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
Sofia Mosci, Lorenzo Rosasco, Alessandro Verri
ICML
2007
IEEE
10 years 6 months ago
CarpeDiem: an algorithm for the fast evaluation of SSL classifiers
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
Roberto Esposito, Daniele P. Radicioni
books