Sciweavers

ICML
2010
IEEE
13 years 8 months ago
From Transformation-Based Dimensionality Reduction to Feature Selection
Many learning applications are characterized by high dimensions. Usually not all of these dimensions are relevant and some are redundant. There are two main approaches to reduce d...
Mahdokht Masaeli, Glenn Fung, Jennifer G. Dy
ICML
2010
IEEE
13 years 8 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
ICML
2010
IEEE
13 years 8 months ago
Deep Supervised t-Distributed Embedding
Deep learning has been successfully applied to perform non-linear embedding. In this paper, we present supervised embedding techniques that use a deep network to collapse classes....
Martin Renqiang Min, Laurens van der Maaten, Zinen...
ICML
2010
IEEE
13 years 8 months ago
Modeling Interaction via the Principle of Maximum Causal Entropy
The principle of maximum entropy provides a powerful framework for statistical models of joint, conditional, and marginal distributions. However, there are many important distribu...
Brian Ziebart, J. Andrew Bagnell, Anind K. Dey
ICML
2010
IEEE
13 years 8 months ago
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...
ICML
2010
IEEE
13 years 8 months ago
The Elastic Embedding Algorithm for Dimensionality Reduction
We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the d...
Miguel Á. Carreira-Perpiñán
ICML
2010
IEEE
13 years 8 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
ICML
2010
IEEE
13 years 8 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
ICML
2010
IEEE
13 years 8 months ago
A Stick-Breaking Construction of the Beta Process
We present and derive a new stick-breaking construction of the beta process. The construction is closely related to a special case of the stick-breaking construction of the Dirich...
John William Paisley, Aimee Zaas, Christopher W. W...
ICML
2010
IEEE
13 years 8 months ago
Boosting for Regression Transfer
The goal of transfer learning is to improve the learning of a new target concept given knowledge of related source concept(s). We introduce the first boosting-based algorithms for...
David Pardoe, Peter Stone